5CS4-23.1

Compute running time and analyse the performance using Asymptotic Analysis.

5CS4-23.2

Discuss various sorting, searching and Graph Traversal algorithm and implement it.

5CS4-23.3

Explain divide-and-conquer paradigm and apply it on various problems.

5CS4-23.4

Create programs for finding spanning tree, shortest path using different design techniques.

5CS4-23.5

Describe various design techniques and compare them.

COs 

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12

PSO1

PSO2

PSO3

CO1

3

2

2

2

2

-

-

-

1

2

-

2

3

1

2

CO2

2

1

2

2

2

-

1

-

-

2

-

3

3

1

2

CO3

3

2

2

2

2

-

-

-

2

2

-

2

3

1

2

CO4

3

1

2

2

2

2

1

-

2

2

-

2

3

1

2

CO5

1

3

1

1

2

2

1

-

2

2

-

3

3

1

2

Avg

2.4

1.2

1.8

1.8

2

2

1

-

1.75

2

-

2.4

3

1

2