Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions Task/Swarup Dash/Q10.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
R = int(input("Enter the number of rows:"))
C = int(input("Enter the number of columns:"))

matrix = []
print("Enter the entries rowwise:")

for i in range(R): # A for loop for row entries
a =[]
for j in range(C): # A for loop for column entries
a.append(int(input()))
matrix.append(a)


for i in range(R):
for j in range(C):
print(matrix[i][j], end = " ")
print()

transpose = []
for j in range(C):
transpose.append([])
for i in range (R):
t_num = matrix[i][j]
transpose[j].append(t_num)

#printing the transpose matrix
print('Transpose matrix: ')
for i in range (R):
for j in range (C):
print (transpose[i][j], end = ' ')
print()
31 changes: 31 additions & 0 deletions Task/Swarup Dash/Q1Anagram.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
def is_anagram(s, t):

if len(s) != len(t):
return False

count_s = [0] * 26 #list of size 26 to store each 26 alphabet :)
count_t = [0] * 26 #list of size 26 to store each 26 alphabet :)

for char in s:
index = ord(char) - ord('a') #Ascii value of a=97
count_s[index] += 1

for char in t:
index = ord(char) - ord('a')
count_t[index] += 1

for i in range(26):
if count_s[i] != count_t[i]:
return False
return True

#Example 1
s1 = "anagram"
t1 = "nagaram"
print(is_anagram(s1, t1))

#Example 2
s2 = "rat"
t2 = "car"
print(is_anagram(s2, t2))

28 changes: 28 additions & 0 deletions Task/Swarup Dash/Q2_Frequency.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
def char_frequency(s):
frequency = {}

uppercase_letters = []
lowercase_letters = []

for char in s:
if char in frequency:
frequency[char] += 1
else:
frequency[char] = 1
if char.isupper():
uppercase_letters.append(char)
else:
lowercase_letters.append(char)

all_letters = [chr(i) for i in range(ord('A'), ord('Z') + 1)] + \
[chr(i) for i in range(ord('a'), ord('z') + 1)]


for char in all_letters:
if char in frequency:
print(f"{char}: {frequency[char]}")


#Example:
s = "Robotics Society"
char_frequency(s)
20 changes: 20 additions & 0 deletions Task/Swarup Dash/Q6_Prime.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
lower = int(input ("Please, Enter the Lowest Range Value: "))
upper= int(input ("Please, Enter the Upper Range Value: "))

lst=[]
print ("The Prime Numbers in the range are: ")
for number in range (lower, upper + 1):
if number > 1:
for i in range (2, number):
if (number % i) == 0:
break
else:
lst.append(number)

print(lst)

large_primeno=max(lst)
small_primeno=min(lst)

absolute_diff=large_primeno-small_primeno
print("The absolute diff between largest and smallest prime number is:",absolute_diff)
14 changes: 14 additions & 0 deletions Task/Swarup Dash/Q8_Freqdict.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
def count_frequency(lst):

frequency_dict = {}
for element in lst:
if element in frequency_dict:
frequency_dict[element] += 1
else:
frequency_dict[element] = 1
return frequency_dict


sample_list = [1, 2, 2, 3, 3, 3, 4, 4, 4, 4,4]
frequency_dict = count_frequency(sample_list)
print(frequency_dict)