Your IP : 216.73.216.40
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="description" content="">
<title>DSA</title>
<link rel="canonical" href="https://www.cc.gatech.edu/classes/AY2021/cs7643_fall//">
<link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/bootstrap/4.3.1/css/bootstrap.min.css" integrity="sha384-ggOyR0iXCbMQv3Xipma34MD+dH/1fQ784/j6cY/iJTQUOhcWr7x9JvoRxT2MZw1T" crossorigin="anonymous">
<link rel="stylesheet" type="text/css" href="https://www.cc.gatech.edu/classes/AY2021/cs7643_fall/css/main.css" >
<script src="https://code.jquery.com/jquery-3.3.1.slim.min.js" integrity="sha384-q8i/X+965DzO0rT7abK41JStQIAqVgRVzpbzo5smXKp4YfRvH+8abtTE1Pi6jizo" crossorigin="anonymous"></script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/popper.js/1.14.7/umd/popper.min.js" integrity="sha384-UO2eT0CpHqdSJQ6hJty5KVphtPhzWj9WO1clHTMGa3JDZwrnQq4sF86dIHNDz0W1" crossorigin="anonymous"></script>
<script src="https://stackpath.bootstrapcdn.com/bootstrap/4.3.1/js/bootstrap.min.js" integrity="sha384-JjSmVgyd0p3pXB1rRibZUAYoIIy6OrQ6VrjIEaFf/nJGzIxFDsf4x0xIM+B07jRM" crossorigin="anonymous"></script>
<link rel="shortcut icon" href="/classes/AY2021/cs7643_fall/images/icon.png">
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
inlineMath: [ ['$','$'], ["\\(","\\)"] ],
processEscapes: true
}
});
</script>
</head>
<body>
<nav class="navbar">
<div class="navbar-header">
<a class="navbar-brand" href="https://profile.iiita.ac.in/srdubey/teaching/ds2026/">Data Structures and Algorithms, Jan-May 2026 Semester</a>
</div>
</nav>
<div class="container">
<div class="content">
<div style="padding-top: 15px;" class="card">
<h1 id="cs-4803--7643-deep-learning"><center>Indian Institute of Information Technology, Allahabad</center></h1>
<h1 id="cs-4803--7643-deep-learning"><center>Data Structures and Algorithms</center></h1>
<h3 style="font-weight: 300;"><center>Jan-May 2026 Semester</center></h3>
<hr />
<div class="row">
<ul class="nav">
<li class="nav-item">
<a class="nav-link" href="#info">Course Information</a>
</li>
<li class="nav-item">
<a class="nav-link" href="#schedule">Schedule</a>
</li>
<li class="nav-item">
<a class="nav-link" href="#grading">Grading</a>
</li>
<li class="nav-item">
<a class="nav-link" href="#prereqs">Prerequisites</a>
</li>
<li class="nav-item">
<a class="nav-link" href="#related">External Resources</a>
</li>
</ul>
</div>
</div>
<p><a name="info"></a></p>
<div class="card">
<!--<h2 id="course-information">Previous Offerings</h2>
<a href="https://cvbl.iiita.ac.in/courses/visual-recognition/odd-sem-2021-2022/" target="_blank">Visual Recognition 2021<a>
</br>-->
<h2 id="course-information">Course Information</h2>
<p>Course Description: In this course, students learn the concepts of Data Structures and Algorithms and practice them using C language.
<p>Course Outline:</p>
<ul>
<li>Unit 1: Introduction, Complexity Analysis, Recursion, Searching, Sorting.</li>
<li>Unit 2: Linked List, Abstract Data Types, Stacks and Queues.</li>
<li>Unit 3: Trees, Traversal, Binary Search Tree, Height Balanced Tree (AVL Tree), Heap, Priority Queue, Heap Sort, Hashing.</li>
<li>Unit 4: Graphs, Graph Representation, Graph Traversal - DFS, BFS, Minimum Spanning Tree - Prim's and Kruskal's, Single Source Shortest Path - Dijkstra.</li>
</ul>
<h2 id="course-information">Course Instructor</h2>
<p><a href="https://profile.iiita.ac.in/srdubey/" target"_blank">Dr. Shiv Ram Dubey</a></p>
<!--<h2 id="course-information">TAs</h2>
<ul style="display: grid; grid-template-columns: repeat(2, 1fr);">
<li>Ajay Kumar Yadav - RSI2022502</li>
<li>Akash Verma - RSI2023001</li>
<li>Rahulkumar Ranjeet Jha - MNS2023002</li>
<li>Swarnendu Banik - MHC2023012</li>
<li>Shubham Harsh - MML2023004</li>
<li>Utkarsh Kumar Singh - MRH2024019</li>
</ul>-->
<dl class="dl-horizontal">
<dt>Class Schedule (Section A)</dt>
<dd>Class: Monday 02.30 PM - 03.30 PM and Wednesday 11.00 AM - 01.00 PM, Lab: Friday 02.30 PM - 04.30 PM</dd>
<dt>Class Schedule (Section B - with Dr. Navjot Singh)</dt>
<dd>Class: Tuesday 11.00 AM - 01.00 PM and Thursday 02.30 PM - 03.30 PM, Lab: Friday 02.30 PM - 04.30 PM</dd>
</dl>
<dl class="dl-horizontal">
<dt>Course Ethics</dt>
<ul>
<li>Students are strictly advised to avoid the unethical practices in the course including tests and practice components.</li>
<li>It is best to try to solve problems on your own, since problem solving is an important component of the course.</li>
<li>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.</li>
<li>You are not allowed to take the codes from any source, including online, books, your classmate, etc. in the assignments and exams.</li>
<li>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.)</li>
<li>You may not use any paid service and you must clearly and explicitly cite all outside sources and materials that you made use of.</li>
<li>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.</li>
<li>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.</li>
<li>Instances will be dealt with harshly and typically result in a failing course grade.</li>
<li>Cheating cases will attract severe penalties.</li>
</ul>
</dl>
</div>
<p><a name="schedule"></a></p>
<div class="card">
<h2 id="schedule">Schedule</h2>
<table class="table table-hover">
<thead>
<tr class="table-active">
<td style="width: 250px;">Lecture</td>
<td style="width: 400px;">Topic</td>
<td style="width: 250px;">Class Material</td>
</tr>
</thead>
<tbody>
<tr> <td>L01-03 </td>
<td>Introduction and Sorting</td>
<td><a href="01-Introduction.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L04-06</td>
<td>Asymptotic Analysis</td>
<td><a href="02-AsymptoticAnalysis.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L07</td>
<td>Searching</td>
<td><a href="03-Searching.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L08-09</td>
<td>Quick Sort</td>
<td><a href="04-QuickSort_RandomizedAlgorithm.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L10</td>
<td>Linked List</td>
<td><a href="05-LinkedLists.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L11-12</td>
<td>Stacks</td>
<td><a href="06-Stacks.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L13-14</td>
<td>Queues and Lists</td>
<td><a href="07-QueuesLists.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L15-16</td>
<td>Binary Search Tree</td>
<td><a href="08-BinarySearchTree.pdf" target="_blank"> Slide</a></td>
</tr>
<!--<tr> <td>L17-19</td>
<td>Height Balanced Tree (AVL Tree)</td>
<td><a href="09-AVL-Tree.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L20-22</td>
<td>Heap Sort and Priority Queues</td>
<td><a href="10-HeapSort_PriorityQueues.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L23-24</td>
<td>Hashing</td>
<td><a href="11-Hashing.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L25</td>
<td>Graphs</td>
<td><a href="12_Graphs.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L26-27</td>
<td>Depth First Search (DFS)</td>
<td><a href="13_DFS.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L28-29</td>
<td>Breadth First Search (BFS)</td>
<td><a href="14_BFS.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L30-31</td>
<td>Minimum Spanning Tree (MST)</td>
<td><a href="15_MinimumSpanningTree.pdf" target="_blank"> Slide</a></td>
</tr>
<tr> <td>L32-34</td>
<td>Single Source Shortest Path (Dijkstra)</td>
<td><a href="16_Dijkstra.pdf" target="_blank"> Slide</a></td>
</tr>-->
</tbody>
</table>
</div>
<p><a name="grading"></a></p>
<div class="card">
<h2 id="grading">Grading</h2>
<ul>
<li>Internal (35%)</li>
<li>Mid Exam (25%)</li>
<li>End Exam (40%)</li>
</ul>
</div>
<p><a name="prereqs"></a></p>
<div class="card">
<h2 id="prerequisites">Prerequisites</h2>
<ul>
<li>Ability to deal with abstract mathematical concepts</li>
<li>Problem Solving</li>
<li>Computer Programming</li>
</ul>
</div>
<p><a name="related"></a></p>
<div class="card">
<h2 id="book">Books/References</h2>
<ul>
<li>Fundamentals of Data Structures in C by E. Horowitz, S. Sahni, S. Anderson-Freed, Second Edition, 2008.</li>
<li>Data Structures Using C and C++ by Y. Langsam, M. J. Augenstein, A. M. Tenenbaum, PHI, New Delhi, 2001.</li>
<li>Data Structures and Algorithm Analysis in C (DSAC) by Mark Allen Weiss, Second Edition, 2002</li>
<li>Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Third Edition, The MIT Press</li>
<li>Algorithms Design by Jon Kleinberg and Eva Tardos, Pearson</li>
<li>The Design and Analysis of Algorithms by A V Aho, J E Hopcroft, and J D Ullman, Pearson</li>
<li>Data Structures, S. Lipschutz, Schaum’s Outline Series</li>
<li>Data structures and Network Algorithms by Robert Endre Tarjan, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 1983, ISBN:0-89871-187-8</li>
<li>The C Programming Language by Brian W. Kernighan and Dennis M. Ritchie, Prentice Hall</li>
<li>Programming with C, Byron Gottfried</li>
<li>Programming in ANSI C, E. Balaguruswamy</li>
<li>Expert C Programming: Deep C Secrets by Peter van der Linden, Prentice Hall</li>
<li>C Programming FAQs by Steve Summit, Deborah Lafferty, Addison-Wesley Professional</li>
<li>C Traps and Pitfalls by Andrew Koenig, Addison-Wesley Professional</li>
<li>The C Puzzle Book by Alan R. Feuer, Addison-Wesley Professional</li>
</ul>
</div>
<p><a name="extra"></a></p>
<div class="card">
<h2 id="note-to-people-outside-georgia-tech">Disclaimer</h2>
<p>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. </p>
</div>
</div>
</div>
<footer style="font-weight: 300;">
<hr>
© <script>document.write(new Date().getFullYear())</script>, Dr. Shiv Ram Dubey, Indian Institute of Information Technology, Allahabad
</footer>
<!-- mathjax -->
<script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
</body>
</html>