Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
17 views11 pages

01 Introduction

The Data Structures course (CS 1002) taught by Dr. Rajesh Tavva includes 3 hours of lectures and 2 hours of practicals weekly, with a grading policy consisting of Minor-I (20%), Minor-II (20%), Major (40%), and Internal Assessment (20%). Students are required to maintain a minimum attendance of 75% and a SGPA/CGPA of 4.0 to progress, with strict policies on mobile usage and exam retakes. The syllabus covers various topics including arrays, linked lists, stacks, queues, trees, and graphs, with assessments scheduled after specific topic groups.

Uploaded by

monishreddy920
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
17 views11 pages

01 Introduction

The Data Structures course (CS 1002) taught by Dr. Rajesh Tavva includes 3 hours of lectures and 2 hours of practicals weekly, with a grading policy consisting of Minor-I (20%), Minor-II (20%), Major (40%), and Internal Assessment (20%). Students are required to maintain a minimum attendance of 75% and a SGPA/CGPA of 4.0 to progress, with strict policies on mobile usage and exam retakes. The syllabus covers various topics including arrays, linked lists, stacks, queues, trees, and graphs, with assessments scheduled after specific topic groups.

Uploaded by

monishreddy920
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/ 11

Data structures (CS 1002)

Dr. Rajesh Tavva


[email protected]
Credits: 4
Each week:

● 3 hr lectures
● 2 hr practicals (lab)
Grading Policy
● Minor-I: 20%
● Minor-II: 20%
● Major: 40%
● Internal Assessment: 20%
Office hours
● Wednesdays: 03:30 - 04:30 PM
● Venue: My office (cubicle#9 in the second floor faculty
space)
Communication channels
● Discord Server (Join now): https://discord.gg/e2y2sKzY
○ Doubts and discussions among batchmates is encouraged
● In person (check the previous slide on office hours)
● Email
○ Please use your discretion before shooting a mail, try not to spam
the instructor’s inbox
Resources
● Textbook:
○ Fundamentals of Data structures in C, 2nd Edition, E.Horowitz, S.Sahni and Susan
Anderson-Freed, Universities Press.

● Reference books:
○ Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI.
○ Data structures: A Pseudocode Approach with C, 2nd edition, R.F.Gilberg And
B.A.Forouzan, Cengage Learning.
○ Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss, Pearson.
○ Data Structures using C, A.M.Tanenbaum,Y. Langsam, M.J.Augenstein, Pearson.
○ Data structures and Program Design in C, 2nd edition, R.Kruse, C.L.Tondo and
B.Leung,Pearson.

● Any material shared with you


● And, internet, in general
Some Points to Note
● Minimum attendance of 75% in a course and minimum
SGPA/CGPA required to promote to the next class is 4.0.
No waiver can be granted.
● Mobiles and personal laptops are not allowed in labs. You
can access only intranet, particularly Euclid, during the
lab sessions.
● No re-test/alternative tests will be offered for missing
any of the Minor exams under any circumstances for any
reasons whatsoever.
● Maximum grade allowed in a supplementary exam will be
“D”. So, in your own interest, you should try your best
to pass in every subject and not leave any backlog.
Some tips to get a better grade
● Attend lectures as well as labs regularly
● Some of the problems discussed in the labs/lectures might
come in the exam
● Try to perform well in the Minors since their syllabus is
short (typically of around 5 weeks before each Minor)
Course syllabus
● Arrays
● Basics of Linked Lists
● Searching and Sorting
● Complexity Theory
● Singly Linked Lists and Circular Linked Lists
● Doubly Linked Lists and Matrix representations in array
and linked representations
(the above topics upto Minor-I)
Course syllabus (Contd.)
● Stacks
● Queues
● Binary Trees
● Heaps
(the above topics upto Minor-II)
Course syllabus (Contd.)
● BSTs
● AVL Trees
● Graphs
(all the above topics from the beginning upto Major exam)

You might also like