Data Structures Lab (211)
Lectures/ Tut and Lab evaluation will be held physically
Announcements, Assignment submissions via Google Classroom
Course Objective:
Course Outline:
Component / Unit  Topics 

 Introduction  Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm, Time and Space Complexity; Asymptotic notations  Theta, BigO, and Omega, TimeSpace tradeoff. Arrays  Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Application of arrays, Sparse Matrices and their representations. Linked Lists  Array Implementation and Dynamic Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Header node based Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition, Generalized Linked List Abstract Data Types (ADT) Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion, Tower of Hanoi Problem, Simulating Recursion, Principles of recursion, Tail recursion, Removal of recursion Queues: Abstract Data Type, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C, Doubly Ended Queue.; 
 Searching  Sequential search, Binary Search, Comparison and Analysis; Sorting  Internal Sorting: Bubble Sort, Selection Sort, Insertion Sort, Two Way Merge Sort, Heap Sort (to be discussed after Heaps), Quick Sort 
 Trees: Basic terminology, kary trees, Binary Trees, Binary Tree Representation: Array Representation and Linked Representation, Skew Binary Tree, Strict Binary Tree, Complete Binary Tree, Full Binary Tree, Binary Tree Traversals: In order, Preorder and Post order, Binary Search Trees, Threaded Binary trees, Traversing Threaded Binary trees, Forest, Expression Tree, Heaps, AVL tree, B Tree and B+ Tree.
Priority Queues: Array based and Heap based 
 Hashing: Hash table, hash function, collison, collision resolution strategies  Direct Chaining, Open Addressing  Linear Probing and Quadratic Probing
Graphs: Basic Terminology, Sequential and linked Representations of Graphs: Adjacency Matrix, Adjacency List, Graph Traversals: Depth First Search and Breadth First Search, Connected Components. Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm, single source shortest pathDijkstra algorithm, Topological Sort. 
Working in the Windows environment
1. Ellis Horowitz, Satraj Sahni and Susan AndersonFreed, Fundamentals of Data Structures in C, W. H. Freeman and Company.
2. Seymour Lipschutz ,
Data Structures, Schaum's Outlines Series, Tata McGrawHill.
3. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein ,
Data Structures Using C and C++, Prentice Hall of India.
4. R. Kruse et al. ,
Data Structures and Program Design in C, Pearson Education.
1. Donald Knuth,
The Art of Computer Programming, Volume 1 and 3, AddisonWesley, Reading, Mass., 1973.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
Introduction to Algorithms, MIT Press.
3. Ritchie and Kerningham,
The C Programming Language,
4. R. G. Dromey, How to Solve it by Computer, PrenticeHall of India. .
Important Instructions:
1.
The lab classes will mainly consist of implementation of programming concepts discussed in class and the assignments covered in tutorial sessions. of the course website for details. .
2.
Every student is expected to have access to at least one of the text books
.
3.
Attendance in the classes is mandatory. If the
attendance of a student falls below 75%, he/she may will be dropped from the course after Component 2
4.
The course will consist of laboratory and takehome
assignments, which has to be done very seriously. If a student does not submit
the assignments, his/her grade will remain as incomplete.
5.
The vehicular language for the course will be "C". All codes, assignments and lab exercises will be implemented in C language only.
.
6.
The laboratory assignments will be mainly implementationoriented
which have to coded in C and will be based the topics discussed in theoretical lectures.
7.
Grading Policy :
o
Component 1 Lab assignments and a lab test will form the 10% of this component.
o
Component 2  Lab assignments and lab test will form the 10% of this component.
o
Component 3  Group Project evalution
Lab Related Instructions:
1. Submission : All submissions must be made using Google Classroom . You will be notified about mode and way to submit in the tutorial classes. Email submission is strongly discouraged and if submitted will be ignored. Submissions after the deadline will not be considered.
2. Programming Language : All programs must be written in the C programming language. algorithms. Although we will initially help you to debug your codes, the debugging support will be slowly withdrawn as time progresses. For C syntax, look at the lecture slides, or bring with you any textbook on ANSI C.
3. Plagiarism : We have a zero tolerance policy towards plagiarism. Any case of cheating or stealing codes would result in imposition of “ Unfair Means “ charge on you and you will have to face the disciplinary committee of the Department leading to probable deregistration from the course. The person who allowed his program to be copied and the one who copied it will face same consequences. If you copy parts of your code from the Internet, you must mention that clearly in your code. Failure to do that will lead to your entire submission being invalid.
4. Comments and Indentation : We want your programs to follow a proper indentation style as instructed in the lab
Lab 
Topic 
Tutorial / Reference Codes / Helpful Resources 
Tutorial/Assignments 
0. 
Setting Up your Linux environment to compile a C code Working with Arrays and Structures Working with Linked List 
Example Code : Reading from a file in C Example Code : Writing a file in C 

1. 
Abstract Data Types  Stack and Queue 
Code : Stack using Linked List 

2. 
Data Structuring  Tournament Sort 

Assignment on Data Structuring 
3. 
Sorting Algorithms 


4. 
Trees 


5. 
Priority Queue and Heap 

