Scribd
Upload
10 views3 pages

CS F211 Dsa

Uploaded by

harshavardhanshah.31
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
10 views3 pages

CS F211 Dsa

Uploaded by

harshavardhanshah.31
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

Birla Institute of Technology and Science Pilani

K.K. Birla Goa Campus


AY 2024–25, Semester II

Course Handout (Part-II) for Data Structures and Algorithms (CS F211)

Course: Data Structures and Algorithms (CS F211)


Instructor-in-charge: Sujith Thomas
Chamber No. and contact: D 158, [email protected]

Lecture timing: 5 PM to 5:50 PM on Tue, Thurs, and Fri.


Lab timing: 2 PM to 3:50 PM on Wed in CC 219.

This document is Part-II of the handout for Data Structures and Algorithms (CS F211). You can
find Part-I of the handout appended to the time table for the current semester. Part-I contains
the general operational details for all the courses.

Course Objective
• Learn to analyse the efficiency of an algorithm.

• Learn to argue for the correctness of an algorithm.

• Learn to design and implement efficient algorithms.

Text Book(s)
B1 Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, Fourth Edition (2022).

R1 Goodrich, Tamassia and Mount, Data Structures and Algorithms, Second Edition.

Course plan

No. of
Topics Reference
Lectures
Module 1: Introduction
3 Introduction, Analyzing and Designing Algorithms Chapters 1 to 2 in B1
2 Growth function, Asymptotic notation Chapter 3 in B1
3 Divide-and-Conquer Approach, Solving Recurrences Chapter 4 in B1

1
Module 2: Sorting
2 Heapsort Chapter 6 in B1
2 Quicksort Chapter 7 in B1
2 Sorting in Linear Time Chapter 8 in B1
Module 3: Data Structures
3 Stacks, queues, linked lists Chapter 10 in B1
3 Hash tables Chapter 11 in B1
3 Binary Search Trees Chapter 12 in B1
2 Red-Black Trees Chapter 13 in B1
Module 4: Graph Algorithms
2 Elementary Graph Algorithms, Breadth-first search Chapter 22 in B1
2 Depth-first search, Topological sort Chapter 22 in B1
2 Minimum Spanning Trees Chapter 23 in B1
Single-Source Shortest Paths, The Bellman-Ford
2 Chapter 24 in B1
algorithm
Dijkstra’s algorithm, Difference constraints and
2 Chapter 24 in B1
shortest paths

Evaluation Scheme

Component Percentage Date


Weekly Labs (Open textbook - without internet access) 32% Wed 2 PM
Midsem Exam 25% 06/03/25 (Thu)
Research experiment participation / Take-home assignment 3% TBA
Comprehensive exam 40% 08/05/25 FN (Thu)

Course Notices
All the announcement will be made via e-mail.

Policies
• Each lab will have a total of 10 marks:
– Two marks will be allocated for attendance.
– The remaining 8 marks will be allocated for passing the testcases and/or other assess-
ments.
• Lab marks will be calculated based on best (N-2) of N lab marks. (N is usually around 10.)
There will be no make-up for the lab.
• One bonus mark will be awarded to the student who gets the highest total marks in all the N
labs.
• There will be no marks for lecture attendance.
• Any form of unfair means (or malpractice) in an exam or a lab will lead to strict action (e.g.
cancellation of registration) by the committee as per the institute rules.

2
Makeup Policy
• No makeups will be given for the lab components

• No makeup will be given based on OPD prescriptions.

• Compre makeup will be given only for exceptional cases having extremely genuine reasons for
not appearing for the regular exam.

• The makeup exam will be more difficult compared to the regular exam.

Office Hours / Online Consultation


Tuesday, 6 PM — 7 PM. Office: D-158

Sujith Thomas
Instructor-in-charge

You might also like