Maulana Abul Kalam Azad University of Technology, West Bengal
(Formerly West Bengal University of Technology)
Syllabus for B. Tech in Electronics & Communication Engineering
(Applicable from the academic session 2018-2019)
Course Code : ES-CS 301 Category : Engineering Science Course
Course Title : Data Structure & Algorithm Semester : Third
L-T-P : 3-0-0 Credit:3
Pre-Requisites:
Objectives of the course:
1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and graphs.
4. To enable them to write algorithms for solving problems with the help of
fundamental data structures
Detail Contents:
Module 1 6L
Introduction: Basic Terminologies: Elementary Data Organizations, Data
Structure Operations: insertion, deletion, traversal etc.; Analysis of an
Algorithm, Asymptotic Notations, Time-Space trade off.
Searching: Linear Search and Binary Search Techniques and their complexity
analysis.
Module 2: 8L
Stacks and Queues: ADT Stack and its operations: Algorithms and their
complexity analysis, Applications of Stacks: Expression Conversion and
evaluation -corresponding algorithms and complexity analysis. ADT queue,
Types of Queue: Simple Queue, Circular Queue, Priority Queue; Operations on
each types of Queues: Algorithms and their analysis.
Module 3: 8L
Linked Lists: Singly linked lists: Representation in memory, Algorithms of
several operations: Traversing, Searching, Insertion into, Deletion from linked
list; Linked representation of Stack and Queue, Header nodes, Doubly linked list:
operations on it and algorithmic analysis; Circular Linked Lists: all
operations their algorithms and the complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded
Binary Tree, Binary Search Tree, AVL Tree; Tree operations on each of the
trees and their algorithms with complexity analysis. Applications of Binary
Trees. B Tree, B+ Tree: definitions, algorithms and analysis.
Module 4: 8L
Sorting and Hashing: Objective and properties of different sorting
algorithms: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge
Sort, Heap Sort; Performance and Comparison among all the methods, Hashing.
mywbut.com
Maulana Abul Kalam Azad University of Technology, West Bengal
(Formerly West Bengal University of Technology)
Syllabus for B. Tech in Electronics & Communication Engineering
(Applicable from the academic session 2018-2019)
Graph: Basic Terminologies and Representations, Graph search and traversal
algorithms and complexity analysis.
Suggested books:
1. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz,
Sartaj Sahni, Computer Science Press.
Suggested reference books:
1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated
Edition by Mark Allen Weiss, Addison-Wesley Publishing Company
2. “How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education.
Course outcomes
1. For a given algorithm student will able to analyze the algorithms to determine
the time and computation complexity and justify the correctness.
2. For a given Search problem (Linear Search and Binary Search) student will
able to implement it.
3. For a given problem of Stacks, Queues and linked list student will able to
implement it and analyze the same to determine the time and computation
complexity.
4. Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion
Sort, Quick Sort, Merge Sort, Heap Sort and compare their performance in term
of Space and Time complexity.
5. Student will able to implement Graph search and traversal algorithms and
determine the time and computation complexity.
mywbut.com
