Department of Computer Science and Engineering

Course Name : Design and Analysis of Algorithms

Course Number :

Course Designation: Core

Prerequisites : computer programming

III B Tech – I Semester

(2014-2015)

M.Madhavi
Associate Professor

SYLLABUS
 2

Introduction :Algorithm ,pseudo code for expressing

algorithms ,performance Analysis-Space complexity, Time
complexity ,Asymptotic Notation-Big oh notation, Omega notation,Theta
notation and Little Oh notation,Probabilistic analysis,Disjoint Sets-disjoint
Unit – I set operations,union and find operations.
Divide and conquer:General method,applications-Binary search,Quick
sort,Merge sort,Strassen’s matrix multiplications.

Graphs: breadth first search, depth first search, spanning trees,

connected and bi connected components.
Greedy method: General method ,applications-Job sequencing with
Unit – II deadlines,0/1 knapsack problem, Minimum cost spanning trees, Single
source shortest path problem.

Dynamic programming :General method,applications-Matrix chain

multiplication ,Optimal binary search trees,0/1 knapsack problem,All pairs
Unit –
III shortest path problem,Travelling sales person problem,Reliability design.

Backtracking :General method ,applications-n-queens problem,sum of

subsets problem,graph coloring,Hamiltonian cycles.
Unit –
Branch and bound: General method,applications-Travelling sales person
IV
problem,0/1 knapsack problem-LC Branch and bound solution ,FIFO
Branch and bound solution..

Lower Bound Theory: Comparison trees,NP-Hard and NP-Complete

problems:Basic concepts,non deterministic algorithms,NP-Hard and NP

Unit – V complete classes,Clique Decision problem(CDP),Node cover decision

problem
 3

TEXT BOOKS & OTHER REFERENCES

Text Books
Fundamentals of computer algorithms,Ellis Horowitz,Satraj Sahni
1.
and Rajasekharam ,Galgotia publications pvt ltd
Design and Analysis of algorithms ,Aho,Ullman and Hopcroft,Pearson
2.
education
Suggested / Reference Books
Introduction to Design and Analysis of Algorithms A strategic
3.
approach ,R.C.T.Lee ,SS Tseng Mc GrawHill
Data structures and Algorithm Analysis in C++,Allen Weiss,second
4.
edition,Pearson education
5.

Websites References
https://parasol.tamu.edu
1.
https://cse.unl.edu
2.
http://engineeringppt.net
3.
https://nptel.iitm.ac.in
4.
 4

5.
 5

Time Table

Room No: W.E.F:

Class 1 2 3 4 5 6 7
Hour
9:00 - 09.50 10:40 – 11:30 – 1:10 – 2:00 – 2:50 –
Time 09:50 –10:40 11:30 12: 20 2:00 2:50 3:40

MON III
CSE-C
DAA

TUE III III

CSE-D CSE-D
DAA DAA

LUNCH BREAK
12:20 – 1:10

WED III
CSE-D
DAA

THU III III

CSE-C CSE-D
DAA DAA

III III
FRI
CSE-D CSE-C
DAA DAA

III III
SAT
CSE-C CSE-C
DAA DAA
 6

PROGRAM EDUCATIONAL OBJECTIVES (PEO’s)

PEO1 The Graduates are employable as software professionals in reputed

industries.

PEO2 The Graduates analyze problems by applying the principles of

computer science, mathematics and scientific investigation to
design and implement industry accepted solutions using latest
technologies.

PEO3 The Graduates work productively in supportive and leadership roles

on multidisciplinary teams with effective communication and team
work skills with high regard to legal and ethical responsibilities.

PEO4 The Graduates embrace lifelong learning to meet ever changing

developments in computer science and Engineering.

PROGRAM OUTCOMES (PO’s)

PO1 An ability to communicate effectively and work on multidisciplinary

teams

PO2 An ability to identify, formulate and solve computer system

problems with professional and ethical responsibility.

PO3 A recognition of the need for, and an ability to engage in life-long

learning to use the latest techniques, skills and modern engineering
tools

PO4 The broad education necessary to understand the impact of

engineering solutions in a global, economic, environmental and
social context
 7

PO5 An ability to apply knowledge of mathematics, science, and

computing to analyze, design and implement solutions to the
realistic problems.

PO6 An ability to apply suitable process with the understanding of

software development practice.

Course Objectives:

Course Objectives:

 Analyze the asymptotic performance of algorithms.

 Write rigorous correctness proofs for algorithms.
 Demonstrate a familiarity with major algorithms and data structures.
 Apply important algorithmic design paradigms and methods of analysis.
 Synthesize efficient algorithms in common engineering design situations.

Course Outcomes:

1. Explain fundamental concepts of asymptotic notations of an algorithm

divide and conquer techniques.
.
2 Know various design and analysis techniques such as greedy algorithms,

3 Understand the techniques used for designing of different graph

algorithms and also know design and analysis of dynamic programming

4. Apply backtracking, branch and bound techniques for real time

problems and
know the concepts of P, NP and NP-Complete problems.
 8

MAPPING OF COURSE OBJECTIVES & COURSE OUT COMES WITH

PO’s & PEO’s

Course Objectives Course Outcomes PO’s PEO’s

COURSE SCHEDULE

Distribution of Hours Unit – Wise

Chapters
Total No.
Unit Topic
of Hours
Book1 Book2

I Ch 1,2,3 - 15
Ch 2,4 -
II 10
Ch 5
III - 10
Ch 7,8
IV - 15
Ch 10,11
V - 15

Contact classes for Syllabus coverage 65

Tutorial Classes : 05 ; Online Quiz : 1 per unit

Descriptive Tests : 02 (Before Mid Examination)
Revision classes :1 per unit

Number of Hours / lectures available in this Semester / Year 65

 9

The number of topic in every unit is not the same – because of the
variation, all the units have an unequal distribution of hours

Lecture Plan

S.No Topic Date

Algorithm,Pseudo code
1 for expressing
algorithms
Performance Analysis-
2 Space and Time
Complexity
Asymptotic Notation-
Big og
3
notation,omega,theta
and little oh
Probabilistic
4 analysis,disjoint sets
operations
Union and find
5
operations
Divide and
6 conquer:general
method
Binary search,quick
7
sort
8 Mergesort
Strassen’s matrix
9
multiplication
UNIT -II
Graphs;breadth first
1 search,depth first
search
Spanning
2 trees,connected and bi
connected components
Greedy Method:general
3
method,applications
Job sequencing with
4
dead lines,
 10

5 0/1 knapsack problem

Minimum cost spanning
6
trees
Single source shortest
7
path
Graphs;breadth first
8 search,depth first
search
Spanning
9 trees,connected and bi
connected components
Greedy Method:general
10
method,applications
Job sequencing with
11
dead lines,
12 0/1 knapsack problem
UNIT III
1 Dynamic
Programming :General
method
2 Applications-matrix
chain multiplication
3 Optimal binary search
trees
4 0/1 knapsack problem
5 All pairs shortest path
problem
6 Traveling sales person
problem
7 Reliability design
8 Dynamic
Programming :General
method
UNIT IV
1 Backtracking: general
method
2 Applications:n-queen
problem
3 Sum of subsets
problem
4 Graph coloring,
Hamiltonian cycles
5 Branch and Bound
General method
6 Traveling sales person
problem
 11

7 0/1 knapsack problem

8 LC branch and bound
9 FIFO branch and bound
solution
UNIT V
1 Lower Bound Theory:
comparison trees
2 NP-Hard and NP-
Complete
problems;Basic
concepts
3 Non deterministic
algorithms,
4 NP-Hard and NP-
Complete classes
5 Clique Decision
Problem(CDP)
6 Node cover decision
problem
7 Lower Bound Theory:
comparison trees
8 NP-Hard and NP-
Complete
problems;Basic
concepts
9 Non deterministic
algorithms,
10 NP-Hard and NP-
Complete classes
11 Clique Decision
Problem(CDP),node
cover decision problem

Date of Unit Completion & Remarks

 12

Unit – 1

Date : __ / __ / __

Remarks:
________________________________________________________________________

________________________________________________________________________

Unit – 2

Date : __ / __ / __

Remarks:

________________________________________________________________________

________________________________________________________________________

Unit – 3

Date : __ / __ / __

Remarks:

________________________________________________________________________

________________________________________________________________________

Unit – 4

Date : __ / __ / __

Remarks:

________________________________________________________________________

________________________________________________________________________
 13

Unit – 5

Date : __ / __ / __

Remarks:

________________________________________________________________________

________________________________________________________________________

Unit – 6

Date : __ / __ / __

Remarks:

________________________________________________________________________

________________________________________________________________________

Unit – 7
Date : __ / __ / __

Remarks:

________________________________________________________________________

________________________________________________________________________

Unit – 8

Date : __ / __ / __

Remarks:
 14

_______________________________________________________________________
_

_______________________________________________________________________

Unit Wise Assignments (With different Levels of thinking (Blooms

Taxonomy))
Note: For every question please mention the level of Blooms taxonomy

Unit – 1

1. Define an algorithm ( L1)

2. List the characteristics of an algorithm( L1)

3. Describe algorithm design and analysis process (L2)

4. Describe an algorithmic solution for a given simple problem(L2)

5. Demonstrate the working of an algorithm for a specific problem

instance (L3)

Unit – 2
1. Test the recursive and iterative versions of binary search and
compare times. (L4)
.

2. Write and explain the control abstraction for Divide and conquer
(L3)

3. Explain the 0/1 knapsack problem algorithm with greedy concept.

(L2)

4. Applying the greedy strategy find the solution for optimal storage
 15

on tapes problem instance n = 3, (l1, l2, l3) = (5, 10, 3). (L3)

Unit – 3
1. Write an algorithm of matrix chain multiplication. (L3)

2. Design a three stage system with device types D1,D2 and D3. The
costs are Rs.30, Rs.15 and Rs.20 respectively. The cost of the
system is to be no more than Rs.105. the reliability of each device
type is 0.9, 0.8 and 0.5 respectively(L4).

3. Explain in detail the reliability design problem. (L2)

Unit – 4
1. Discuss the relevance of backtracking technique to m-coloring graph.
Explain with an example. (L3)

2. write a solution for 8 queen’s problem.

Compare and contrast Bruteforce approach Vs
backtracking.
prove that the size of the set of all subsets of n elements is 2n.
(L3)

3. Write about graph coloring? Present an algorithm, which finds m-

coloring of a graph Draw the state space for m-closing graph using
an usable graph (L2)
Unit – 5

1. What is meant by Halting problem explain with an example. (L2)

2. Explain the classes of P and NP. (L2)

3. State and Explain cook’s theorem. (L1)

 16

4. Explain the satisfiability problem (L2)

5. Explain the satisfiability problem and write the algorithm for the
same. (L3)
6. Differentiate between NP-complete and NP-Hard (L4)

Unit Wise Case Studies (With different Levels of thinking (Blooms

Taxonomy))
Note: For every Case Study please mention the level of Blooms
taxonomy

Unit – 1

1. Compute the time complexities of different sorting methods (L3)

2. Describe the analysis (L1)

3. List all the different methods to solve recurrence relations(L1)

Unit – 2

1. Use different methods to solve 0/1 knapsack problem(L3)

2. Sketch the spanning trees (L3)

Summarize the different problems that can be solved by greedy
3.
method(L2)
Unit – 3

1. Apply dynamic method for real time application (L3)

2. Describe optimal binary search tree (L2)

3. Express travelling sales person problem with an example (L2)

4. List all the problems that can be solved with dynamic programming
(L1)
Unit – 4

1. Summarize the applications of back tracking(L2)

 17

2. Define branch and bound method(L1)

3. Illustrate n queen problem (L3)

Unit – 5
1. Write about NP hard (L3)

2. Compute 0/1 knapsack problem (L3)

3. Express different NP complete problems ((L2)

4. Define lower bound theory (L1)

Unit Wise Important Questions (With different Levels of thinking

(Blooms Taxonomy))
Note: For every question please mention the level of Blooms taxonomy

Unit – 1
Define time complexity. Describe different notations used to
1.
represent these complexities L-1
What are best case, average case, and worst-case performance?
2.
Explain.L-2
Examine the differences between different time complexities of
3.
different notations L-3
Explain Divide and Conquer method with an example -2
4.
Demonstrate quick sort and merge sort with an example along
5.
with their time complexities L-4
Unit – 2
Compare divide and conquer method with greedy method L-4
1.
Describe spanning trees L-1
2.
 18

Explain the applications of greedy method L-2

3.
Explain the algorithms for minimum spanning trees L-2
4.

Unit – 3
Explain optimal binary search tree . l-2
1.
Apply Dynamic method for travelling sales person problem? L-3
2.
Explain reliability design ? L-2
3.

Unit – 4
Describe approaches for solving 0/1 knapsack problem? L-2
1.
Explain graph coloring ? L-2
2.
List various applications of backtracking and Branch and bound
3.
method?l-4
Compare travelling sales person problem in branch and
4.
bound method and other methods?l-4
Unit – 5
What are comparison trees ? L-1
1.
Distinguish NP-Hard and NP-complete classes. L-3
2.
Explain non deterministic algorithms. L-2
3.
Explain node cover decision problem. L-2
4.
Explain Clique decision problem(CDP)
5
Reviews will be done to uncover mistakes in SDLC?JustifyL-5
6
Explain the quality concepts in detail?
7
Explain the FTR?
8
 19

Unit Wise Multiple Choice Questions for CRT & Competitive

Examinations

1. Two main measures for the efficiency of an algorithm are

a. Processor and memory
b. Complexity and capacity
c. Time and space
d. Data and space

2. The time factor when determining the efficiency of algorithm is measured by

a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm

3. The space factor when determining the efficiency of algorithm is measured by

a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm

4. Which of the following case does not exist in complexity theory

a. Best case
b. Worst case
c. Average case
d. Null case

5. The Worst case occur in linear search algorithm when

a. Item is somewhere in the middle of the array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all

6. The Average case occur in linear search algorithm

a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
 20

7. The complexity of the average case of an algorithm is

a. Much more complicated to analyze than that of worst case
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of
worst case
d. None or above

8. The complexity of linear search algorithm is

a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)

9. The complexity of Binary search algorithm is

a. O(n)
b. O(log )
c. O(n2)
d. O(n log n)

10. The complexity of Bubble sort algorithm is

a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)

11. The complexity of merge sort algorithm is

a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)

12. The indirect change of the values of a variable in one module by another
module is called
a. internal change
b. inter-module change
c. side effect
d. side-module update
 21

13. Which of the following data structure is not linear data structure?
a. Arrays
b. Linked lists
c. Both of above
d. None of above

14. Which of the following data structure is linear data structure?

a. Trees
b. Graphs
c. Arrays
d. None of above

15. The operation of processing each element in the list is known as

a. Sorting
b. Merging
c. Inserting
d. Traversal

16. Finding the location of the element with a given value is:
a. Traversal
b. Search
c. Sort
d. None of above

17. Arrays are best data structures

a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly
changing
c. for both of above situation
d. for none of above situation

18. Linked lists are best suited

a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly
changing
c. for both of above situation
d. for none of above situation

19. Each array declaration need not give, implicitly or explicitly, the information
about
 22

a. the name of array

b. the data type of array
c. the first data from the set to be stored
d. the index set of the array

20. The elements of an array are stored successively in memory cells because
a. by this way computer can keep track only the address of the first element
and the addresses of other elements can be calculated
b. the architecture of computer memory does not allow arrays to store other
than serially
c. both of above
d. none of above

21. What do you mean by Amortized Analysis?

Amortized analysis finds the average running time per operation over a worst
case
sequence of operations. Amortized analysis differs from average-case
performance in that
probability is not involved; amortized analysis guarantees the time per
operation over
worst-case performance.

22. What are important problem types? (or) Enumerate some important types
of
problems.
1. Sorting 2. Searching
3. Numerical problems 4. Geometric problems
5. Combinatorial Problems 6. Graph Problems
7. String processing Problems

23. Name some basic Efficiency classes

1. Constant 2. Logarithmic 3. Linear 4. nlogn
5. Quadratic 6. Cubic 7. Exponential 8. Factorial

24. What are algorithm design techniques?

Algorithm design techniques ( or strategies or paradigms) are general
approaches to solving problems algorithmatically, applicable to a variety of
problems from different areas of computing. General design techniques are:
(i) Brute force (ii) divide and conquer
(iii) decrease and conquer (iv) transform and concquer
(v) greedy technique (vi) dynamic programming
(vii) backtracking (viii) branch and bound

25. How is an algorithm’s time efficiency measured?

Time efficiency indicates how fast the algorithm runs. An algorithm’s time
 23

efficiency is measured as a function of its input size by counting the number of

times its basic operation (running time) is executed. Basic operation is the most
time consuming operation in the algorithm’s innermost loop.

26. What is Big ‘Oh’ notation?

A function t(n) is said to be in O(g(n)), denoted t(n) O(g(n)) , if t(n) is bounded
aboveby some constant multiple of g(n) for all large n, i.e., if there exist some
positive constantc and some nonnegative integers n 0 such that
t(n) ≤ cg(n) for all n≥ n0

27. What is an Activation frame?

It is a storage area for an invocation of recursive program (parameters, local
variables, return address/value etc.). Activation frame allocated from frame
stack pointed by frame pointer.

28. Define order of an algorithm

Measuring the performance of an algorithm in relation with the input size n is
known as order of growth.

29. What is recursive call?

Recursive algorithm makes more than a single call to itself is known as
recursive call. An algorithm that calls itself is direct recursive.An algorithm”A” is
said to be indirect recursive if it calls another algorithm which in turn calls “A”.

30. What do you mean by stepwise refinement?

In top down design methodology the problem is solved in sequence (step by
step)is known as stepwise refinement.

31. How is the efficiency of the algorithm defined?

The efficiency of an algorithm is defined with the components.
(i) Time efficiency -indicates how fast the algorithm runs
(ii) Space efficiency -indicates how much extra memory the algorithm needs

32. Define direct recursive and indirect recursive algorithms.

Recursion occurs where the definition of an entity refers to the entity itself.
Recursion can be direct when an entity refers to itself directly or indirect when it
refers to other entities which refers to it. A (Directly) recursive routine calls
itself. Mutually recursive routines are an example of indirect recursion. A
(Directly) recursive data type
contains pointers to instances of the data type.

33. Which data structure allows deleting data elements from front and inserting
at rear?
a. Stacks
b. Queues
 24

c. Deques
d. Binary search tree

34. Identify the data structure which allows deletions at both ends of the list
but insertion at only one end.
a. Input-restricted deque
b. Output-restricted deque
c. Priority queues
d. None of above

35. Which of the following data structure is non-linear type?

a. Strings
b. Lists
c. Stacks
d. None of above

36. Which of the following data structure is linear type?

a. Strings
b. Lists
c. Queues
d. All of above

37. To represent hierarchical relationship between elements, which data

structure is suitable?
a. Deque
b. Priority
c. Tree
d. All of above

38. A binary tree whose every node has either zero or two children is called
a. Complete binary tree
b. Binary search tree
c. Extended binary tree
d. None of above

39. The depth of a complete binary tree is given by

a. Dn = n log2n
b. Dn = n log2n+1
c. Dn = log2n
d. Dn = log2n+1

40. When representing any algebraic expression E which uses only binary
operations in a 2-tree,
a. the variable in E will appear as external nodes and operations in internal
nodes
 25

b. the operations in E will appear as external nodes and variables in internal

nodes
c. the variables and operations in E will appear only in internal nodes
d. the variables and operations in E will appear only in external nodes

41. A binary tree can easily be converted into q 2-tree

a. by replacing each empty sub tree by a new internal node
b. by inserting an internal nodes for non-empty node
c. by inserting an external nodes for non-empty node
d. by replacing each empty sub tree by a new external node

42. When converting binary tree into extended binary tree, all the original
nodes in binary tree are
a. internal nodes on extended tree
b. external nodes on extended tree
c. vanished on extended tree
d. None of above

43. The post order traversal of a binary tree is DEBFCA. Find out the pre order
traversal
a. ABFCDE
b. ADBFEC
c. ABDECF
d. ABDCEF

44. Which of the following sorting algorithm is of divide-and-conquer type?

a. Bubble sort
b. Insertion sort
c. Quick sort
d. All of above

45. An algorithm that calls itself directly or indirectly is known as

a. Sub algorithm
b. Recursion
c. Polish notation
d. Traversal algorithm

46. In a binary tree, certain null entries are replaced by special pointers which
point to nodes higher in the tree for efficiency. These special pointers are called
a. Leaf
b. branch
c. path
d. thread

47. The in order traversal of tree will yield a sorted listing of elements of tree in
a. Binary trees
 26

b. Binary search trees

c. Heaps
d. None of above

48. In a Heap tree

a. Values in a node is greater than every value in left sub tree and smaller than
right sub tree
b. Values in a node is greater than every value in children of it
c. Both of above conditions applies
d. None of above conditions applies

49. In a graph if e=[u, v], Then u and v are called

a. endpoints of e
b. adjacent nodes
c. neighbors
d. all of above

50. A connected graph T without any cycles is called

a. a tree graph
b. free tree
c. a tree
d. All of above

51. In a graph if e=(u, v) means

a. u is adjacent to v but v is not adjacent to u
b. e begins at u and ends at v
c. u is processor and v is successor
d. both b and c

52. If every node u in G is adjacent to every other node v in G, A graph is said

to be
a. isolated
b. complete
c. finite
d. strongly connected

University Question Papers

B.Tech II Year II Semester Examinations, May-2013

Design and Analysis of Algorithms
(Common to CSE, IT)

Time: 3 hours Max. Marks: 75

Answer any five questions
All questions carry equal marks
 27

-
1. Define time complexity, Describe different
asymptotic notations used to represent the time complexities with suitable
examples. [15]

2. Develop algorithms for UNION and FIND using weighing rule and collapsing
rule respectively. [15]

3.a) Write and explain the control abstraction for Divide and
conquer and give the time complexity.
b) Discuss Strassen’s matrix multiplication and derive the time complexity.
[15]

4.a) What is the solution generated by the function Job sequencing when N=7,
(P1, P2, … …P7) = (3, 5, 20, 18, 1, 6, 30) and (d1, d2, … d7) = (1, 3, 4, 3, 2, 1,
2)
b) What is Greedy method and discuss its applications. [15]

5.a) Solve the following 0/1 Knapsack problem using dynamic programming
P= (11, 21, 31, 33), W= (2, 11, 22, 15), C=40, n=4.
b) Consider three stages of a system with r1=0.3, r2=0.5, r3=0.2 and c1=30,
c2=20,c3=30 Where the total cost of the system is C=80 and u1=2, u2=3,
u3=2 find the reliability design. [15]

6.a) Explain the Back Tracking Strategy with an example.

b) State and explain the n-Queen problem using backtracking. [15]

7.a) Generate FIFO branch and bound on the traveling salesman problem and
find the solution space tree.
b) What is bounding? Explain the principles of bounding. [15]
8. State and explain cook’s theorem and also discuss about NP complete
classes.
[15]

Tutorial Sheet

Unit-I
 28

Topics Revised Date:

Quick Test Topics Date:

Case Study Discussed Date:

Unit-II
 29

Topics Revised Date:

Quick Test Topics Date:

Case Study Discussed Date:

Unit-III
Topics Revised Date:
 30

Quick Test Topics Date:

Case Study Discussed Date:

Unit-IV
Topics Revised Date:

Quick Test Topics Date:

 31

Case Study Discussed Date:

Unit-V
Topics Revised Date:

Quick Test Topics Date:

Case Study Discussed Date:

Unit-VI
 32

Topics Revised

Quick Test Topics

Case Study Discussed

Unit-VII
Topics Revised
 33

Quick Test Topics

Case Study Discussed

Unit-VIII
Topics Revised

Quick Test Topics

 34

Case Study Discussed

TOPICS BEYOND SYLLABUS

Unit – 1

1.

2.

3.

4.

Unit – 2

1.

2.

3.

4.

Unit – 3

1.

2.
 35

3.
4.

Unit – 4

1.

2.

3.

4.

Unit – 5

1.

2.

3.

4.
 36

ASSESMENT OF LEARNING OBJECTIVES AND OUT COMES: DIRECT

Blooms Taxonomy:
LEVEL 1 REMEMBERING Exhibit memory of previously learned
material by recalling facts, terms,
basic concepts, and answers
LEVEL 2 UNDERSTANDING Demonstrate understanding of facts
and ideas by organizing, comparing,
translating, interpreting, giving
descriptions, and stating main ideas.
LEVEL 3 APPLYING Solve problems to new situations by
applying acquired knowledge, facts,
techniques and rules in a different way
LEVEL 4 ANALYZING Examine and break information into
parts by identifying motives or causes.
Make inferences and find evidence to
support generalizations.
LEVEL 5 EVALUATING Present and defend opinions by
making judgments about information,
validity of ideas, or quality of work
based on a set of criteria.
LEVEL 6 CREATING Compile information together in a
different way by combining elements
in a new pattern or proposing
alternative solutions.

S.No. Hall I- Assignment Remark II- Assignme Remar Av

Ticket Internal Marks s & Interna nt ks & g.
Numbe Marks Blooms l Marks Bloom Ma
r Taxono Marks s rks
my Taxon
Assess omy
ment Asses
 37

sment
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
 38

45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

ASSESMENT OF LEARNING OBJECTIVES AND OUT COMES: INDIRECT

Blooms Taxonomy:
LEVEL 1 REMEMBERING Exhibit memory of previously learned
material by recalling facts, terms,
basic concepts, and answers
LEVEL 2 UNDERSTANDING Demonstrate understanding of facts
and ideas by organizing, comparing,
translating, interpreting, giving
descriptions, and stating main ideas.
LEVEL 3 APPLYING Solve problems to new situations by
applying acquired knowledge, facts,
techniques and rules in a different way
LEVEL 4 ANALYZING Examine and break information into
parts by identifying motives or causes.
Make inferences and find evidence to
support generalizations.
LEVEL 5 EVALUATING Present and defend opinions by
making judgments about information,
validity of ideas, or quality of work
based on a set of criteria.
LEVEL 6 CREATING Compile information together in a
different way by combining elements
in a new pattern or proposing
alternative solutions.
 39

CSP Rubric
S. Criteri LEVEL ( Level : 3-Excellent Level :2-Good Level : 1-
N0 a Poor
Student speaks in phase with the given topic confidently using
Communica
3
Audio-Visual aids. Vocabulary is good
Student speaking without proper planning, fair usage of Audio-Visual
Oral

tion

1 2
aids. Vocabulary is not good
Student speaks vaguely not in phase with the given topic. No
1
synchronization among the talk and Visual Aids
Proper structuring of the document with relevant subtitles,
Writing Skills

3 readability of document is high with correct use of grammar. Work is

genuine and not published anywhere else
2 Information is gathered without continuity of topic, sentences were
2
not framed properly. Few topics are copied from other documents
Information gathered was not relevant to the given task, vague
1
collection of sentences. Content is copied from other documents
Student identifies most potential ethical or societal issues and tries
3
Awareness
Social and

to provide solutions for them discussing with peers

Ethical

Student identifies the societal and ethical issues but fails to provide
3 2
any solutions discussing with peers
Student makes no attempt in identifying the societal and ethical
1
issues
3 Student uses appropriate methods, techniques to model and solve
Knowledg
Content

the problem accurately

4 2 Student tries to model the problem but fails to solve the problem
e

1 Student fails to model the problem and also fails to solve the
problem
Listens carefully to the class and tries to answer questions
Participatio

3
confidently
Student

Listens carefully to the lecture but doesn’t attempt to answer the

5 2
n

questions
Student neither listens to the class nor attempts to answer the
1
questions
The program structure is well organized with appropriate use of
technologies and methodology. Code is easy to read and well
3
analytical Skills

documented. Student is able to implement the algorithm producing

Technical and

accurate results
Program structure is well organized with appropriate use of
6 technologies and methodology. Code is quite difficult to read and not
2
properly documented. Student is able to implement the algorithm
providing accurate results.
Program structure is not well organized with mistakes in usage of
1 appropriate technologies and methodology. Code is difficult to read
and student is not able to execute the program
 40

Independently able to write programs to strengthen the concepts

3
covered in theory
Knowledge
Independently able to write programs but not able to strengthen the
Practical
2
concepts learned in theory
7 Not able to write programs and not able to strengthen the concepts
learned in theory
1

Student uses appropriate methods, techniques to model and solve

Understanding
of Engineering

3
the problem accurately in the context of multidisciplinary projects
Student tries to model the problem but fails to solve the problem in
2
core

8 the context of multidisciplinary projects

Student fails to model the problem and also fails to solve the
1 problem in the context
of multidisciplinary projects

CSP Rubric Name & Number:

S.No. Hall Ticket Rubric Blooms Remarks

Number Assessment Taxonomy
Assessment
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 41

22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

Remedial Classes:

Unit Number Date Conducted Topics Revised

 42

Unit-I
Unit-II
Unit-III
Unit-IV
Unit-V

Add-on Programmes:
1

Guest Lectures:

1.
2.
3.
4.

Unit Wise PPT’s:

Unit Wise lecture Notes: