NITK –Surathkal

Department of Computer Science & Engineering

Course Plan

CO202 – Data Structures and Algorithms

Name of the Course: Data Course No: CO202 No. of Credits (L-T-P): 3-1-0 (4)
Styructures and Algorithms
Year & Semester, Section: Course Type: Program Academic Session: Odd
2019, III Sem Core (Pc)

Prerequisites (if any): None

Name and Contact Details of Course Instructor: Jeny Rajan / Vani M, ( jenyrajan@nitk.edu.in.
vani.nitk@gmail.com )

Evaluation Scheme: Surprise Test/Tutorials/Viva - 40%, Mid Sem - 20%, End Sem - 40%.

Course Objectives
1. To help the students to understand how to structure information to support efficient
processing.
2. To provide knowledge in various data structures and algorithms.
3. To teach how to measure the effectiveness (in terms of time and space complexities) of
algorithms.
Course (Learning) Outcomes (COs)
CO1 – Understand the properties of various data structures and identify the strengths and
weaknesses of different data structures.
CO2 – Should be able to design and employ appropriate data structures for solving computing
problems
CO3 – Possess the ability to design efficient algorithms for solving computing problems
CO4 – To write efficient programs using appropriate data structures

Mapping of COs with POs:

(Strength of correlation: S-Strong, M-Medium, W-Weak)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 S S S S M W W W W M W W
CO2 S S S S S W W W W M W W
CO3 S S S S S M S M M S S S
CO4 S S S S M W M M M M S W

1. Teaching Learning Interaction

L-T-P
Module – Title Content
hours

M1 Introduction Introduction to basic data structures and algorithms, abstract data 2-0-0
 types, dynamic memory allocation, pointer concepts classification
of data structures (linear and non-linear structures).

M2 Analysis of Classification of algorithms and their efficiencies, best case, 10-0-0

Algorithms average-case and worst-case analysis, time complexity and space
complexity, asymptotic notation, Classical Searching & Sorting
Algorithms

M3 Linked List Linear list, circular list , doubly list, and doubly circular list, 6-0-0
applications of linked list.

M4 Stack Stack implementation using array and linked list, multiple stacks 4-0-0
implementation using array, implementation of recursion,
evaluation of arithmetic expressions.

M5 Queue Queue implementation using array and linked list, deque, priority 4-0-0
queue, circular queue, application of queues

M6 Trees: Definition and concepts, binary trees, representation of binary 8-0-0

trees, operations on binary trees, tree traversal methods, types of
binary trees, applications of trees.
M7 Graphs Introduction to graphs, graph terminologies, graph representation 6-0-0
using array and lined list, operations on graphs, graph traversals ,
shortest path problem, minimum spanning trees

2. List of Text Books & Reference Books, On-line Course Resources

1. Alfred V Aho, John E Hoperoft, Jeffrey D Ullman, “Data Structures and Algorithms”,
Addison Wesley, 2003.
2. Horowitz and Sahni, “Fundamentals of Data Structures and Algorithms in C++” ,
Universities Press, 2007.
3. Clifford A Shaffer, A Practical Introduction to Data Structures and Algorithms, Prentice
Hall International, 1997.Willam K Pratt, Digital Image Processing, Wiley-Interscience
Publication, Third Edition, 2001.
4. Aaron M Tanenbaum, Yedidyah Langsam, Moshe J Augenstein, Data Structures using
C,Pearson Education, 1998.
5. J Kleinberg, E Tardos, “Algorithm Design”, Addison-Wesley, 2005.
6. Jean Paul Trembley and Paul G Sorenson, "An Introduction to Data Structures with
Applications", Tata McGraw Hill, 2001.
7. R. Kruse and B. P, Leung, "Data Structures and Program Design in C", Penguin
Books,2007.
8. Donald E Knuth, “The Art of Computer Programming : Fundamental Algorithms”, Dorling
Kindersley (3rd Edition), 2008.

4. Laboratory Instructions (if any): Nil

5. Assessment Pattern
(Use Bloom’s Taxonomy to design rubrics for evaluating student performance)

Level Knowledge Assessment (%)

No. Level Evaluation Component
Course Practical Mid Sem Final
project/viva exam (20%) Exam
voce/assignments (20%) (40%)
(20%)
K1 Remember 10% 10% 10% 10% 9.8
K2 Understand 25% 20% 20% 20% 20.7
K3 Apply 20% 25% 20% 20% 20.7
K4 Analyse 20% 15% 20% 20% 18.3
K5 Evaluate 15% 20% 20% 20% 18.3
K6 Create 10% 20% 10% 10% 12.2
100%

Sd/-
Jeny Rajan/Vani M.