Roll.

# Section A Name

Department: Telecommunication Engineering Program: B.S (MCS)

Assignment 1
MCS-205 computer system algorithm

Announced Date: 15/11/21 Due Date: 18/11/21 Total Marks = 2

Marks Obtained =
Teacher Name: Dr. Ali Akbar Siddique

Sr. No Course Learning Outcomes PLOs Blooms

Taxonomy

CLO_ PLO_1 C2
1 Engineering (Understanding)
To develop the concept of algorithm design strategies.
Knowledge

(CLO_1): (Cognitive Level C2, i.e., Understanding) (PLO_1: Engineering Knowledge)

Q1: Illustrate algorithm and code for binary search.

Q2: Illustrate algorithm and code for min-max search
Roll. #: Section: A Name:

Department: Telecommunication Engineering Program: B.S (MCS)

Assignment 2
MCS-205 computer system algorithm

Announced Date: 15/11/21 Due Date: 18/11/21 Total Marks = 4

Marks Obtained =
Teacher Name: Dr. Ali Akbar Siddique

Sr. No Course Learning Outcomes PLOs Blooms

Taxonomy

CLO_ PLO_1 C3
2 To apply the fundamentals of different searching and Engineering (Applying)
sorting technique based of greedy algorithm Knowledge

(CLO_1): (Cognitive Level C2, i.e., Understanding) (PLO_1: Engineering Knowledge)

Q#1: Illustrate a python code for longest common sub-sequence and also show the output.
Q#2: Illustrate a python code for matrix chain multiplication and also show the output.
Q#3: Illustrate a python code for All pair shortest path(Floyd warshall algorithm)and also show
the output.
Roll. # Section A Name is

Department: Telecommunication Engineering

Program: B.S (MCS)

Assignment.3
MCS-205 computer system algorithm

Announced Date: 15/11/21 Due Date: 18/11/21 Total Marks = 4

Marks Obtained =
Teacher Name: Dr. Ali Akbar Siddique

Sr. No Course Learning Outcomes PLOs Blooms

Taxonomy

PLO_2
(Problem C4
3 To analyze the algorithm based on space and Time
(Analyzing)
complexity, and their appropriate selection strategies. Analysis)

(CLO_1): (Cognitive Level C2, i.e., Understanding) (PLO_1: Engineering Knowledge)

Qno.1: Evaluate a recursive maze problem for a 4x4 block/matrix, starting source should
be your roll number.
Roll. # 2020f-bmcs- Section A Name

Department: Telecommunication Engineering Program: B.S (MCS)

Quiz.1
MCS-205 computer system algorithm

Announced Date: 15/11/21 Due Date: 18/11/21 Total Marks = 2

Marks Obtained =
Teacher Name: Dr. Ali Akbar Siddique

(CLO_1): (Cognitive Level C2, i.e., Understanding) (PLO_1: Engineering Knowledge)

Sr. No Course Learning Outcomes PLOs Blooms

Taxonomy

PLO_1 C2
1 To develop the concept of algorithm design strategies (Engineering (Understanding
knowledge) )

Qno.1:
Demonstrate a nine elements/digits array construct a tree using heap sort and illustrate the
method of BUILD-MINIMUM-HEAP on that array. Also write the code for minimum
heap tree.
The array should be sequenced as:
Roll no: 3
Arr = [3, 4 , 5, 6, (3*2) = 6, 7, 8, 9, 10, (3*3) = 9]
Roll. # Section A Name

Department: Telecommunication Engineering Program: B.S (MCS)

Quiz.2
MCS-205 computer system algorithm

Announced Date: / / Total Marks = 3

Marks Obtained =
Teacher Name: Dr. Ali Akbar Siddique

(CLO_2): C3 (Applying) (PLO_1: Engineering Knowledge)

Sr. No Course Learning Outcomes PLOs Blooms

Taxonomy

PLO_1
To apply the fundamentals of different searching and C3
2 ((Engineering
sorting techniques based of greedy Algorithm. (Applying)
knowledge)

Qno.1: Identify all possible Hamiltonian circuits, and calculate the adj matrix of the
following graph, the starting point is A.
Roll. # 2020f-bmcs-00 Section A Name

Department: Telecommunication Engineering Program: B.S (MCS)

Quiz.3
MCS-205 computer system algorithm
Announced Date: Total Marks =5
Marks Obtained =
Teacher Name: Dr. Ali Akbar Siddique

(CLO_2): C4 (Analyzing) (PLO_1: Engineering Knowledge)

Sr. No Course Learning Outcomes PLOs Blooms

Taxonomy

PLO_2
To analyze the algorithm based on space and Time C4
3 (Problem
complexity, and their appropriate selection strategies. (Analyzing)
Analysis)

Qno.1: Discover the shortest path from home to university in the following graph using
Dijkstra's algorithm:

weighted graph representing roads from home to university