Search & Filtering
Your task is to make a class and perform the following functions
1)void PrinList()
2)int search_Element(int X),
3)void Insert_Element(int X),
void
4)Insert_Element_at(int X, int pos), 5)bool Delete_Element(int X),
6)bool is_Empty(),
7) int
Length(),
8)void Print_Reverse_List(),
9) void Empty_List(),
10)void Copy_List(…)
Note:
1)No global declarations
2)Make copy constructor
3)Make default constructor
4)Make constructor with arguments
5)Test the functions inside main
def Matrix(r,c,s):
a = 1
Matrix = []
print("Enter Matrix %s: "%(s))
for p in range(r):
try:
while (a):
row = [int(i) for i in input().split()]
if len(row)==c:
Matrix.append(row)
break
except ValueError:
print("Error")
continue
return Matrix
rows,columns=map(int,input("Enter the dimensions:").split(","))
A = Matrix(rows,columns,"A")
B = Matrix(rows,columns,"B")
Then how do we show these code in a flowchart??
Sales Commissions) Use a single-subscripted array to solve the following problem. A company pays its salespeople on a commission basis. The salespeople receive $200 per week plus 9% of
their gross sales for that week. For example, a salesperson who grosses $3,000 in sales in a week receives $200 plus 9% of $3,000, or a total of $470. Write a C program (using an array of counters)
that determines how many of the salespeople earned salaries in each of the following ranges (assume
that each salesperson’s salary is truncated to an integer amount):
a) $200–299
b) $300–399
c) $400–499
d) $500–599
268 Chapter 6 C Arrays
e) $600–699
f) $700–799
g) $800–899
h) $900–999
i) $1000 and over
1)A function insert element at head of list
2)a function insert element at tail of list
3)A function insert element at any position
4)a function delete element at head of list
5)a function delete element at tail of list
6)a function delete element at any position
7) a function to check if list is sorted if not then returns sorted list
8) a function that displays the list
9) a function that reverses the list
Note:
no global declarations
Test the functions inside main
How to show def functions and exception handling in a flowchart?
how do you manage kernel services
Write a program to Detect Cycle in a Directed Graph. Suppose, you have a directed graph, check
whether the graph contains a cycle or not. Your function should return true if the given graph
contains at least one cycle, else return false
get()
update()
length()
back()
Next()
start()
end()
Remove()
Add()
NOTE: Implement above operations only using Pointers without using any indexes of arrays.
C programing: User Input, Error Conditions, and Math
Part A
DUE: Monday September 20, 2021 by midnight
Part B
DUE: Thursday September 23, 2021 by midnight
Part A
of lab = 4%
Part B
of lab = 1%
program for greedy's algorithm fill the remaining code
def printPath(root, sum):
def getRootToLeafSum(root):
def findMaxSumPath(root):
sum = getRootToLeafSum(root)
print("The maximum sum is:", sum)
print("The maximum sum path is :", end=' ')
printPath(root, sum)
def Rnode():
height=int(input("Enter the level of Binary tree:"))
p=int(input("Perfect=1,imperfect=0:"))
try:
B=tree(height,is_perfect=p)
B=list(B)[0]
print(B)
findMaxSumPath(B)
except:
print("level of Binary value between 0-9")
# This main method of given program to call Rnode() function
if _name_ == '__main__': Rnode()
ONLY THING YOU HAVE TO WRITE THE REMAINING CODE getRootToLeafSum(root) and printPath(root, sum)
