18CS652 Introduction to Data Structures and Algorithms syllabus for CS

Introduction to C, constants, variables, data types, input output operations, operators and expressions, control statements, arrays, strings, built-in functions, user defined functions, structures, unions and pointers

Text Book 1: Chapter 1 and 2

Algorithms, Asymptotic notations, Introduction to data structures, Types of data structures, Arrays.

Text Book 1: Chapter 3 and 4

Linked lists, Stacks

Text Book 1: Chapter 5 and 6

Queues, Trees

Text Book 1: Chapter 7 and 8

Graphs, Sorting ,(selection, insertion, bubble, quick)and searching(Linear, Binary, Hash)

Text Book 1: Chapter 7 and 8

Course Outcomes:

The student will be able to :

• Identify different data structures in C programming language
• Appraise the use of data structures in problem solving
• Implement data structures using C programming language.

Question Paper Pattern:

• The question paper will have ten questions.
• Each full Question consisting of 20 marks
• There will be 2 full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub questions covering all the topics under a module.
• The students will have to answer 5 full questions, selecting one full question from each module.

Textbooks:

1. Data structures using C , E Balagurusamy, McGraw Hill education (India) Pvt. Ltd, 2013.

Reference Books:

1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Ed, Universities Press, 2014.

2. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill, 2014.