ITUL301.1

Understand the concept of asymptotic principles and employ them assessing the time complexity for various algorithms.

ITUL301.2

Describe stack and queue with their applications.

ITUL301.3

Apply operations of linked list to solve computational problems.

ITUL301.4

Analyze  non-linear data structure algorithms for solving real life problems like shortest path and MST.

ITUL301.5

Compute the efficiency of the principal algorithms for sorting, searching, and hashing.

 COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PSO 1

PSO 2

PSO 3

CO1

3

2

1

2

1

-

-

1

2

-

1

2

1

2

CO2

3

2

1

2

1

-

-

1

2

-

1

2

1

2

CO3

3

2

1

2

1

-

-

1

2

-

1

2

1

2

CO4

3

2

1

2

1

-

-

1

2

-

1

2

1

2

CO5

3

2

1

2

1

-

-

1

2

-

1

2

1

2

Avg

3

2

1

2

1

-

-

1

2

-

1

2

1

2