Course Outline
Department of Electronics and Communication Engineering
Delhi Technological University
1. Subject Code: EC 102 Title: Data Structures and Algorithms
2. Semester: II Credits: 4
3. Contact Hours: L: 3 T: 0 P: 2
4. Objective: To familiarize students with the basic data structures and their usage in
fundamental algorithms
5. Detailed Syllabus
S.No. Contents Contact
Hours
1. Introduction: Introduction to Algorithmic, Complexity- Time- Space 8
Trade off. Introduction to C programming through Arrays, Stacks, Queues
and Linked lists.
2. Trees: Basic Terminology, Traversals, Binary search trees, optimal and 7
average BST’s. 2-4 trees, Applications of Binary search Trees, Complete
Binary trees, Extended binary trees.
3. Introduction to algorithms: Concept of algorithmic efficiency, run time 9
analysis of algorithms, Asymptotic Notations. Growth of Functions,
Master’s Theorem,
Searching and Searching: Linear Search, Binary search, Insertion Sort,
Quick sort, Merge sort, Heap sort, Radix Sort.
4. Graphs: Terminology and Representations, Graphs & Multi-graphs, 8
Directed Graphs, Representation of graphs, Breadth first search and
connected components. Depth first search in directed and undirected
graphs and strongly connected components.
5. Spanning trees: Prim’s and Kruskal’s algorithm, union-find data 10
structure. Dijkstra’s algorithm for shortest paths, shortest path tree.
Directed acyclic graphs: topological sort and longest path.
Dynamic programming: Principles of dynamic programming.
Applications: Matrix multiplication, Travelling salesman Problem.
Total 42
6. Course Outcomes
After completion of this course, the students will be able to:
EC102.1. Access different kinds of data structures with their respective applications.
EC102.2. Develop programs using different types of data structures
EC102.3. Analyze the correctness, efficiency and asymptotic runtime complexity of
algorithms
including formulating recurrence relations.
EC102.4. Understand and analyze different sorting algorithms
EC102.5. Understand and design binary and spanning trees and algorithms using dynamic
programming.
EC102.6. Demonstrate a familiarity with major data structures and efficient algorithms and
synthesize them in common engineering design situations
7. Text Books and Reference Books:
S.No. Name of Books / Authors/ Publishers Year of
Publication/
Reprint
Text Books:
Horowitz and Sahni, “Fundamentals of Data structures”, 1983
1.
Galgotia publications
2. Tannenbaum, “Data Structures”, PHI 2007( Fifth
Impression)
3. T .H . Cormen, C . E . Leiserson, R .L . Rivest
“Introduction to Algorithms”, 3rd Ed., PHI. 2011 ( reprint)
E. Horowitz, S. Sahni, and S. Rajsekaran,
4. “Fundamentals of Computer Algorithms,” Galgotia
Publication
Reference Books:
1. R.L. Kruse, B.P. Leary, C.L. Tondo, “Data structure and 2009( Fourth
program design in C”, PHI Impression)
2. Aho ,Ullman “Principles of Algorithms ”
8. Course Evaluation Scheme:
S. No. Component Exam Duration Marks
1. Mid Term Examination ( MTE) 1Hr :30 Min 20
2. End Term Examination ( ETE) 3Hrs 40
3. Class Work Sessional (CWS) Continuous Assessment 15
4. Practical Sessional (PRS) Continuous Assessment 25
9. Evaluation Schemes for CWS component (15) and PRS (25):
CWS (15)
S. No. Component Marks
1 Attendance 5
Attendance % Marks
96-100 5
91-95 4
85-90 3
80-84 2
75-79 1
< 75 0
2. Assignments, Homework, Interaction in class 10
PRS (25)
S. No. Component Weight
1. Experiment performance and Lab Record presentation 50
2. Project Design/Quiz 20
3. Practical Examination 30
Total 100*
*This will be scaled down to 25.
With reference to component 1 of PRS, students shall perform experiment and show
readings/results to respective faculty/ instructor/lab assistant. The completed lab record shall be
submitted by the student for evaluation in the next lab session. Marks shall be awarded for each
experiment as per the given scheme. The viva voce shall be conducted by the faculty/ instructor
twice during the semester.
For component 2, a group of two/three students shall design a project using given specifications
and prepare a report showing the details of design computations.
For component 3, at the end of semester practical examination shall be conducted. Each student
shall perform experiment individually which shall be evaluated by the faculty.
