Data Structures Syllabus

Name of Department:- Computer Science and Engineering
Data Structures with C

1. Subject Code: TCS 302 Course Title:
2. Contact Hours: L: 3 T: - P: -
3. Semester: III
4. Pre-requisite: Good Knowledge of Programming in C (TCS 101, TCS 201)
5. Course Outcomes: After completion of the course students will be able to
1. Describe the concept of Data Structures and assess how the choice of data structures
impacts the performance of programs
2. Compare and contrast merits and demerits of various data structures in terms of time
and memory complexity.
3. Identify and propose appropriate data structure for providing the solution to the real
world problems.
4. Implement operations like searching, insertion, deletion, traversing mechanism etc. on
various data structures
5. Be familiar with advanced data structures such as balanced search trees, hash tables,
AVL trees, priority queues, ADT etc.
6. To augment merits of particular data structures on other data structure to develop
innovation in subject of study.
6. Details of Syllabus
Contact
UNIT CONTENTS
Hrs
Introduction: Basic Terminology, Pointer and dynamic memory allocation,
Elementary Data Organization, Data Structure operations, Algorithm
Complexity and Time-Space trade-off Arrays: Array Definition,
Representation and Analysis, Single and Multidimensional Arrays, address
calculation, application of arrays, Array as Parameters, Ordered List, Sparse
Unit – I Matrices. Stacks:Array. Representation and Implementation of stack,
10
Operations on Stacks: Push & Pop, Array Representation of Stack, Linked
Representation of Stack, Operations Associated with Stacks, Application of
stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of
postfix expression using stack. Recursion: Recursive definition and
processes, recursion in C, example of recursion, Tower of Hanoi Problem,
tail recursion.
Queues: Array and linked representation and implementation of queues,
Operations on Queue: Create, Add, Delete, Full and Empty. Circular queue,
Dequeue, and Priority Queue.
Unit - II
Linked list: Representation and Implementation of Singly Linked Lists, Two-
10
way Header List, Traversing and Searching of Linked List, Overflow and
Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion
Algorithms, Doubly linked list, Linked List in Array, Polynomial representation
and addition, Generalized linked list.
Unit – III Trees: Basic terminology, Binary Trees, Binary tree representation,
algebraic Expressions, Complete Binary Tree. Extended Binary Trees, Array 9
and Linked Representation of Binary trees, Traversing Binary trees,
Threaded Binary trees. Traversing Threaded Binary trees, Huffman
algorithm & Huffman tree.
Searching and Hashing: Sequential search, binary search, comparison and
analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash
Table Implementation
Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort,
Unit – IV Heap Sort, Sorting on Different Keys, Practical consideration for Internal
Sorting. 9
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in
BST, Complexity of Search Algorithm, Path Length, AVL Trees
File Structures: Physical Storage Media File Organization, Organization of
records into Blocks, Sequential Files, Indexing and Hashing, Primary
Unit – V indices, Secondary indices, B+ Tree index Files, B Tree index Files, 8
Indexing and Hashing Comparisons, Graph, Traversal(DFS,BFS) ,Minimum
spanning tree
Total 46
Text/ Reference Books:
1. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., New
Delhi.
2. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi-2002
3. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd., New Delhi.
4. K Loudon, “Mastering Algorithms with C”, Shroff Publisher & Distributors Pvt. Ltd.
5. Bruno R Preiss, “Data Structures and Algorithms with Object Oriented Design Pattern in C++”,
Jhon Wiley & Sons, Inc.
6. Adam Drozdek, “Data Structures and Algorithms in C++”, Thomson Asia Pvt

Data Structures Syllabus

Uploaded by

Data Structures Syllabus

Uploaded by

Name of Department:- Computer Science and Engineering

Data Structures with C

4. Pre-requisite: Good Knowledge of Programming in C (TCS 101, TCS 201)

5. Course Outcomes: After completion of the course students will be able to

Text/ Reference Books:

You might also like