Scribd
Upload
7 views

CS201 DSA CS211 DSALab CourseContent Jan April2024

The document outlines the syllabus for the Data Structures and Algorithms course (CS201) and its corresponding lab (CS211) at the Indian Institute of Technology Dharwad. It covers topics such as complexity analysis, sorting algorithms, data structures like stacks, queues, trees, heaps, and graphs, along with evaluation methods and class schedules. Instructors and teaching assistants are listed, along with their contact information.

Uploaded by

ch23bt004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

CS201 DSA CS211 DSALab CourseContent Jan April2024

The document outlines the syllabus for the Data Structures and Algorithms course (CS201) and its corresponding lab (CS211) at the Indian Institute of Technology Dharwad. It covers topics such as complexity analysis, sorting algorithms, data structures like stacks, queues, trees, heaps, and graphs, along with evaluation methods and class schedules. Instructors and teaching assistants are listed, along with their contact information.

Uploaded by

ch23bt004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Indian Institute of Technology Dharwad

CS201: Data Structures and Algorithms (Theory)


Syllabus (3-0-0-6)

1. Introduction to data structure and algorithms (DSA), array data structure and its application
(sorting)

2. Complexity analysis of algorithms – best case, average case and worst-case analysis, Complexity
analysis of sorting algorithms (insertion sort, rank sort, selection sort and bubble sort), Asymptotic
analysis, recursive programming, recurrence relations and solving recurrence relations

3. Sorting algorithms using divide and conquer method (merge sort and quicksort) and their analysis

4. Abstract data type (ADT) – Sequential linear list, Linked list (singly linked list, doubly linked list
and circular list)

5. Stack and queue data structures – array and linked list implementation, applications of stack and
queue

6. Dictionary data structure:


● Binary search
● Hashing and hash tables, Collision resolution, Chaining and its analysis, open addressing
(linear probing and double hashing)

7. Tree data structure: Representation of tree, tree traversal (preorder, inorder and postorder), search
trees – binary search tree (BST) and AVL tree

8. Heap data structure: Binary heap, heap sort, priority queue

9. Graph data structure: Directed and undirected graphs, properties of graphs, representation of graphs
– adjacency matrix and adjacency list
● Graph searching algorithms – breadth first search (BFS) and depth first search (DFS)
● Minimum spanning tree (MST) – Kruskal’s algorithm (implemented using BFS) and Prim’s
algorithms (implemented using binary heap based priority queues)

Textbooks:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press,
3/e, 2009.
2. Y. Langsam, M. J. Augenstein, and A. M. Tenenbaum, Data Structures Using C and C++, Prentice
Hall, 2/e, 2000.
3. S. Sahni, Data Structures, Algorithms, and Applications in C++, Silicon Press, 2/e, 2005.
4. Michael T. Goodrich, Roberto Tamassia, and David M., Data Structures and Algorithms in C++,
John Wiley & Sons, Inc., 2/e, 2004
Week 1 Introduction to DSA and array ADT [1, 2, 3, Online]
Week 2-3 Complexity of algorithms, analysis of sorting algorithms [1, Online]
Week 3-4 Asymptotic analysis, recurrence relation [1, Online]
Week 4-5 Divide and conquer – merge sort and quicksort [1, 2, 3, Online]
Week 6 Linked list data structure [1, 2, Online]
Week 6-7 Stacks and queue [1, 2, Online]
Week 8-9 Dictionary – Binary search and Hashing [1, 2, Online]
Week 10-11 Tree DS [1]
Week 11-12 Heap DS [1, 2, Online]
Week 13-14 Graph DS [1, 2, 3, Online]

Instructor(s):
Vandana Bharti (e-mail: [email protected])
Dileep A. D (e-mail: [email protected], Phone number: 9459477409)

TAs: Deepan Raj (email: [email protected])


Lavanya M (email: [email protected])
Venkatesh G (email: [email protected])

Evaluation: Midsem exam (30%), Endsem exam (40%), Online quiz (15%), Assignments/Projects
(15%)

Class Hours and Slot: C slot - Monday (10:30 – 11:20 AM), Wednesday (11:30 AM – 12:20 PM),
Friday (08:30 – 09:20 AM)

Classroom: 008 (for Batch D0, Instructor: Vandana)


F300 (for Batch D1+Final and Pre-final year), Instructor: Dileep)

Attendance Requirement: 80%


Indian Institute of Technology Dharwad
CS211: Data Structures and Algorithms (Lab)
Syllabus (0-0-3-3)

Laboratory and Slot: L1 and L2 Slot – Tuesday (03:20 – 05:55 PM) – for Batch D0
M1 and M2 Slot – Thursday (03:20 – 05:55 PM) – for Batch D1

● Programming in C
● Lab to be conducted on a 2.5-hour slot. It will be conducted in tandem with the theory course so
the topics for problems given in the lab are already initiated in the theory class. The topics taught
in the theory course should appropriately be sequenced for synchronization with the laboratory.

Instructor(s):
Vijeth Jinachandra Kotagi (e-mail: [email protected])
Jivnesh Balasaheb Sandhan (e-mail: [email protected])
Vandana Bharti (e-mail: [email protected])
Dileep A. D (e-mail: [email protected], Phone number: 9459477409)

TAs: Deepan Raj (email: [email protected])


Lavanya M (email: [email protected])
Venkatesh G (email: [email protected])

Evaluation: weekly lab practice and assessment (20%), Two programming exams (40%) – towards
midsem exam, Endsem exam (40%)

You might also like