Indian Institute of Information Technology, Allahabad

Data Structures

Jan-May 2023 Semester

Course Instructor

Dr. Shiv Ram Dubey

Course Information

Course Description: In this course, students learn the concepts of computer programming and practice them using C language.

Course Outline:

Unit 1: Introduction, Complexity Analysis, Recursion, Searching, Sorting

Unit 2: Linked List, Abstract Data Types, Stacks and Queues

Unit 3: Trees, Traversal, Binary Search Tree, Heap, Priority Queue, Heap Sort, Height Balanced Tree, K-ary Tree

Unit 4: Hashing, Graphs, Graph Representation, Graph Traversal - DFS, BFS, Minimum Spanning Tree - Prim's and Kruskal's, Shortest Path - Dijkstra

Class Schedule (Section C)

Class: Tuesday 09.00 AM - 11.00 AM, Tute: Thursday 11.00 AM - 01.00 PM, Lab: Thursday 03.00 PM - 05.00 PM

Course Ethics

• Students are strictly advised to avoid the unethical practices in the course including tests and practice components.
• It is best to try to solve problems on your own, since problem solving is an important component of the course.
• You are allowed to discuss class material, problems, and general solution strategies with your classmates. But, when it comes to formulating or writing solutions you must work/implement by yourself.
• You are not allowed to take the codes from any source, including online, books, your classmate, etc. in the assignments and exams.
• You may use free and publicly available sources (at idea level only), such as books, journal and conference publications, and web pages, as research material for your answers. (You will not lose marks for using external sources.)
• You may not use any paid service and you must clearly and explicitly cite all outside sources and materials that you made use of.
• Students are not allowed to post the code/report/any other material of course assignment/project in public domain or share with any one else without written permission from course instructors.
• We consider the use of uncited external sources as portraying someone else's work as your own, and as such it is a violation of the Institute's policies on academic dishonesty.
• Instances will be dealt with harshly and typically result in a failing course grade.
• Cheating cases will attract severe penalties.

Schedule

Grading

• C1 (30%)
• C2 (30%)
• C3 (40%)

Prerequisites

• Ability to deal with abstract mathematical concepts
• Introduction to Computer Programming

Books/References

• Data Structures and Algorithm Analysis in C (DSAC) by Mark Allen Weiss, Second Edition
• Data Structures, S. Lipschutz, Schaum’s Outline Series
• Data structures and Network Algorithms by Robert Endre Tarjan, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 1983, ISBN:0-89871-187-8
• Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Third Edition, The MIT Press
• Algorithms Design by Jon Kleinberg and Eva Tardos, Pearson
• The Design and Analysis of Algorithms by A V Aho, J E Hopcroft, and J D Ullman, Pearson
• The C Programming Language by Brian W. Kernighan and Dennis M. Ritchie, Prentice Hall
• Programming with C, Byron Gottfried
• Programming in ANSI C, E. Balaguruswamy
• Expert C Programming: Deep C Secrets by Peter van der Linden, Prentice Hall
• C Programming FAQs by Steve Summit, Deborah Lafferty, Addison-Wesley Professional
• C Traps and Pitfalls by Andrew Koenig, Addison-Wesley Professional
• The C Puzzle Book by Alan R. Feuer, Addison-Wesley Professional

Disclaimer

The content (text, image, and graphics) used in this slide are adopted from many sources for Academic purposes. Broadly, the sources have been given due credit appropriately. However, there is a chance of missing out some original primary sources. The authors of this material do not claim any copyright of such material.