Syllabus
Syllabus
Course Outcomes:
On the successful completion of the course, the student will be able to
COs Course Outcomes
CO1 Apply the concepts of pointers and structures in problem solving.
CO2 Use different types of linked lists to solve problems.
CO3 Demonstrate stack and queue data structures to solve problems.
Illustrate the operations performed on tree data structures, hash functions for
CO4
problem solving.
Course Structure
No. of No. of
Lecture Tutorial
Nos Modules
Hours Hours
Module – 1 Pointers and Data Structures Fundamentals
1.1 Pointers: Introduction 1 0
1.2 Structures, Nested Structures, Arrays of Structures 2 0
1.3 Structures and Functions, Self-Referential Structures 2 0
Introduction to Data Structures, Classification of data structures,
1.4 1 0
Operations on data structures, Abstract data type
Module – 2 Linked Lists
2.1 Linked Lists - Singly linked lists 3 0
2.2 Circular linked lists 2 0
2.3 Doubly linked lists 2 0
2.4 Circular doubly linked lists 2 0
Text Books:
1. “Data Structures using C”, Reema Thareja, 2nd Edition, 2018, Oxford University Press.
2. “Data Structures using C”, Aaron M Tenenbaum, Yedidyah Langsam and Moshe J Augenstein,
2014, low price edition, Pearson education.
Reference Books:
1. Richar F Gilberg and Behronz A Forouzan, “Data Structures, A Pseudocode Approach with
C”, 2nd Edition, 2012, Thomson.
2. Horowitz, Sahni, Anderson-Freed, “Fundamentals of Data Structures in C”, 2nd Edition,
2011, Universities Press.
Online Resources:
1. NPTEL: Programming and Data structures- https://nptel.ac.in/courses/106/105/106105085/
2. Coursera: Data Structures - https://www.coursera.org/learn/data-structures
3. Programming & Data structures: http://nptel.ac.in/courses/106106130/
4. Programming, Data structures and Algorithms: http://nptel.ac.in/courses/106106133/