Scribd
Upload
20 views4 pages

Dsa 2

Uploaded by

202404045
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
20 views4 pages

Dsa 2

Uploaded by

202404045
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/ 4

IT205: Data Structures

Academic Year 2024-25 (Winter)

Instructor: Dr. Arpit Rana [[email protected]]


Prerequisites: Discrete Mathematics, C Programming
Slot/ Category: B.Tech. II Semester - Section B | Core
Course Credits: 3 Credits (3-0-0)
Associated Lab Course: IT206/Data Structures Lab using OOP/1-0-2-2.
Foundation for: CS/IT stream of courses
Lectures: TBD

TA contact info: TBD

Course Description:

This course aims to introduce the concept of data structures, their indispensability in implementing
algorithms, and how they aid in improving performance. Extensive coverage of the well-known and
essential data structures such as arrays, linked lists, queues, stacks, hash tables, binary search trees,
AVL trees, red-black trees, 2-3-4 trees, heaps, along with associated routines/algorithms such as
dictionary operations, order statistics, sorting will constitute the contents of the course.

Suggested Books:

● Textbook:
○ ‘Data Structures and Algorithms,’ by Aho, Hopcroft and Ullman, Addison-Wesley,
1999.

● Reference books:
○ ‘Data Structures and Algorithms in C++/Java,’ by Goodrich, Tamassia, and Goldberg,
Wiley 2011
○ ‘Introduction to Algorithms,’ by Cormen, Leiserson, Rivest, and Stein, PHI, 2010

Course Outcomes:

After successful completion of the course, the student will have the ability to -

● Utilize appropriate simple data structures in problem-solving


● Understand data abstraction and order statistics
● Understand program efficiency through analysis of algorithms

P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12

X X X X X X
IT205: Data Structures
Academic Year 2024-25 (Winter)

Evaluation Scheme:

● In-Semester Exams (I & II): 30% (15% + 15%)


● Course Project: 40%
● End-Semester Exam: 30%

Tentative Course Plan1:

Units Topics Number of


Lectures

Representation of data on a computer, data types & array and


Preliminaries linked list representations, ways of representing programs and 3
associated data on computers

The notion of the running time of an algorithm, Recurrences,


Analysis Tools 3
Parameters of performance

Dictionary Find, Max, Min, Successor, Predecessor (query operations);


6
Operations Insert, Delete (modify operations)

Stacks, queues, variants implementation using arrays and


List Data 6
linked lists, hashing

Comparison-based sorting algorithms, Other sorting


algorithms, lower bounds for comparison-based sorting
Sorting 9
algorithms, Best-case, worst-case, and average-case running
times. Heap Sort, Bubble Sort, etc.

Maximum and minimum elements of a set, Finding median,


Order searching for an element of a given rank, finding the rank of a
3
Statistics given element, ranks of a subset of elements, Maintaining rank
information for a dynamic set

Heaps, Binary search trees (BST), the height of BST, Tries,


Trees 9
Balanced BSTs: Red Black trees, AVL Trees, B Trees..

Representation using adjacency matrices and adjacency lists,


Graphs 3
Graph searching algorithms BFS and DFS

1 — This course plan is subject to change without notice.


IT205: Data Structures
Academic Year 2024-25 (Winter)

Preliminary Schedule of the Course:

Week Lecture Capstone1

Week-1 Course Admin; Introduction to Data Structures: Variables, Data


–
[1 Jan 2025] Types, and Data Structures.

Algorithm Analysis: Counting operations; Asymptotic Analysis Big-O


Week-2
notation (Upper-Bound); three cases of analysis Best-case, –
[6 Jan 2025]
Worst-case, Average-case; Abstract Data Types (ADTs)

Week-3 Arrays: Definition, Types, Terminology, Computer Representation, Capstone


[13 Jan 2025] Operations, and Applications. Assigned

Week-4 Linked List: Definition, Types, Terminology, Computer


–
[20 Jan 2025] Representation, Operations, and Applications.

Week-5
Order Statistics –
[27 Jan 2025]

Week-6 First In-Semester Examination


–
[3 Feb 2025] (7th Feb - Friday to 11th Feb - Tuesday)

Week-6 Stacks: Definition, Types, Terminology, Computer Representation, Progress


[10 Feb 2025] Operations, and Applications. Check I

Week-7 Queues: Definition, Types, Terminology, Computer Representation,


–
[17 Feb 2025] Operations, and Applications.

Week-8 Tables: Definition, Types, Terminology, Computer Representation,


–
[24 Feb 2025] Operations, and Applications.

Introduction to Trees, Binary Trees, and its Types, Implementation


Week-9
of Binary Trees in Arrays, and Traversals: Inorder, preorder, and –
[3 Mar 2025]
postorder; Basic Operations in Binary Trees

Week-10 In-semester Break Progress


[10 Mar 2025] (Entire week) Check II

Week-11 Introduction to BST, BST traversals and sorting, Insertion and


creation of BSTs; Deletion in BST, augmented BST, update cost in –
[17 Mar 2025]
augmented BST
IT205: Data Structures
Academic Year 2024-25 (Winter)

Week-12 Second In-Semester Examination


–
[24 Mar 2025] (22 Mar Saturday to 26th Mar Wednesday)
nd

Week-13 Introduction to AVL trees: Min and max height of AVL trees,
–
[31 Mar 2025] searching on an AVL tree, insertion in an AVL tree

Week-14 Introduction to heaps, insertion and deletion in heaps, heapsort,


[7 Apr 2025] heapify, priority queues,

Week-15 Introduction to Graphs: Representation using adjacency matrices Capstone


[14 Apr 2025] and adjacency lists, Graph searching algorithms BFS and DFS Evaluation

Week-16 Last date of Classes, Labs, and Tutorials


[21 Apr 2024] (23rd Apr 2025)

Week-17 End-Semester Examination


[29 Apr 2024] (24 Apr 2025 to 02 May 2025)

1 – Course Project will be assigned group-wise (4 students in each group), i.e., around 40 groups. We will
release the project themes and evaluation policy later.

You might also like