Syllabus for Data Structures and Algorithms for ECE Students

1) Introduction to data structures: basic introduction, categories

of data structures, data representation with structures and
unions, abstract data type (ADT), implementation of ADTs
using array, introduction to linked list, doubly linked lists,
circular linked list, implementation of ADTs using linked
lists, conceptual understanding of recursive function using
stacks, principles of stacks (LIFO) and queues (FIFO),
balancing of parenthesis, operator precedence, evaluation
and interconversion of infix, prefix and postfix expression.
2) Introduction to Asymptotic Notations, Solving Recurrence
relations, Master’s theorem, Recurrence Tree method.
Incremental and Decremental Algorithm Design Strategies,
case studies, lower bound for sorting.
3) Divide and Conquer - Merge sort, Quick sort, Median
Finding, Greedy algorithms - knapsack problem (fractional
and 0/1 versions), Minimum spanning tree – Prim’s, Kruskal’s
algorithm, Huffman coding, Set of Intervals. Dynamic
programming - case studies – LCS, Matrix Multiplication,
Knapsack. Graph algorithms - Topological sort, Shortest path
algorithms - Dijskstra’s Algorithm, Bellman-Ford’s
Algorithms.
4) Searching and sorting techniques: linear Search, binary
Search, sorting: internal vs external, stable sorting, non-
comparison sorting: bucket sort, radix sort, comparison
sorting: insertion sort, selection sort, bubble sort, merge sort,
quick sort, etc.
5) Tree data structure: nodes and their properties, height and
depth of a tree, representation of tree data structure, ordered
trees, tree traversals, tree operations: insertion, deletion,
searching, binary trees, threaded binary trees, m-ary trees,
binary search trees, AVL trees, red-black tree, B-trees,
B+trees, decision trees, heaps, forests and Huffman coding.
6) Graphs: Introduction to graphs, representation of graphs,
terminologies: node, edge, path, walk, cycle, circuit, directed
vs undirected graphs, complete graph, bipartite graph,
cliques, wheels, pendant, cut set, etc., planar graph,
isomorphic graphs, introduction to graph colouring problem
and their applications, Dirac’s and Ore’s
theorem. Applications of graphs: shortest path problems and
their importance in real life, Dijkstra’s algorithm, traveling
salesman problem, Kuratowski’s theorem, depth first and
breadth first searches, spanning trees and their importance,
algorithms for finding the minimum spanning tree from
graphs

Software Engineering
1) The Software Problem - Cost, Schedule, and Quality, Scale
and Change; Software Processes - Process and Project,
Component Software Processes;
2) Software Development Process Models - Waterfall Model,
Prototyping,Iterative Development, Rational Unified Process,
Time boxing Model, Extreme Programming
and Agile Processes, Using Process Models in a Project.

3) Project Management Process. Software Requirements

Analysis and Specification - Value of a Good
SRS, Requirement Process, Requirements Specification;
4) Formal Specification- Formal Specification in the
Software process, Sub-system interface specification,
Behavioural Specification; Desirable Characteristics of
an SRS - Components of an SRS, Structure of a Requirements
Document;
5) Functional Specification with Use Cases - Basics, Examples,
Extensions, Developing Use Cases; Other Approaches for
Analysis - Data Flow
Diagrams, ER Diagrams, Validation; Planning a Software
Project
Effort Estimation - Top-Down Estimation Approach, Bottom-
Up
Estimation Approach;

6) Project Schedule and Staffing - Quality Planning, Risk

Management Planning - Risk Management Concepts, Risk
Assessment, Risk Control, A Practical Risk Management
Planning Approach; Project Monitoring Plan - Measurements,
Project Monitoring and Tracking. Detailed Scheduling;
7) Software Architecture - Role of Software Architecture,
Architecture Views - Component and Connector View -
Components, Connectors, An Example. Architecture Styles
for CC View - Pipe and Filter, Shared-Data Style, Client-
Server Style, Some Other Styles, Documenting Architecture
Design - Evaluating Architectures. Design - Design Concepts
–
Coupling, Cohesion, The Open-Closed Principle. Function-
Oriented Design (from Pressman) - Structure Charts,
Structured Design Methodology, An Example. Object-
Oriented Design (from Jalote)- OO Concepts, Unified
Modeling Language (UML), A Design Methodology,
Examples; Detailed Design - Logic/Algorithm Design, State
Modeling of Classes;

8) Verification Metrics - Complexity

Metrics for Function-Oriented Design, Complexity Metrics for
OO Design Coding and Unit Testing - Programming Principles
and Guidelines - Structured Programming, Information
 Hiding, Some Programming Practices, Coding Standards;
Incrementally Developing Code - An
Incremental Coding Process, Test-Driven Development, Pair
Programming;
9) Managing Evolving Code - Source Code Control and Build,
Refactoring; Unit Testing - Testing Procedural Units, Unit
Testing of Classes; Code Inspection - Planning, Self-Review,
Group Review Meeting; Metrics - Size Measures,
Complexity Metrics;
10) Testing - Testing Concepts - Error, Fault, and Failure,
Test Case, Test Suite, and Test Harness, Psychology of
Testing, Levels of Testing; Testing Process - Test Plan, Test
Case Design, Test Case Execution; Black-Box Testing -
Equivalence Class Partitioning, Boundary Value
Analysis, Pairwise Testing, Special Cases, State-Based
Testing; White-Box Testing - Control Flow-Based
Criteria, Test Case Generation and Tool Support; Metrics -
Coverage Analysis, Reliability, Defect Removal Efficiency.