INTRODUCTION TO DATA STRUCTURES (BCS654A)

INTRODUCTION TO DATA STRUCTURES

Course Code BCS654A 
CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 
SEE Marks 50
Total Hours of Pedagogy 40 
Total Marks 100
Credits 03 
Exam Hours 03
Examination type (SEE) Theory

Module-1

Arrays: Introduction, One-Dimensional Arrays, Two-Dimensional Arrays, Initializing TwoDimensional Arrays, Multidimensional arrays.

Pointers: Introduction, Pointer Concepts, Accessing Variables through Pointers, Pointer Applications, Dynamic Memory Allocation Functions.

Structures and Unions: Introduction, Declaring Structures, Giving Values to Members, Structure Initialization, Comparison of Structure Variables, Arrays of Structures, Arrays within Structures, Nested Structures, Unions, Size of Structures.

Textbook 1: Ch. 8.1 to 8.5, Ch. 12.1 to 12.8, 12.10, 12.11.

Textbook 2: Ch. 2.1 to 2.3, 2.5, 2.9.

Module-2

Stacks: Introduction, Stack Operations, Stack Implementation using Arrays, Applications of Stacks.

Queues: Introduction, Queue Operations, Queue Implementation using Arrays, Different Types of Queues: Circular Queues, Double-Ended Queues, Priority Queues, Applications of Queues.

Textbook 2: Ch. 6.1 to 6.3, Ch. 8.1 to 8.2.

Module-3

Linked Lists: Introduction, Singly Linked List, Self-Referential Structures, Operations on Singly Linked Lists: Insert-Delete-Display, Implementation of Stacks and Queues using Linked List, Concatenate two Lists, Reverse a List without Creating a New Node, Static Allocation Vs Linked Allocation.

Circular Singly Linked List: Introduction, Operations: Insert-Delete-Display.

Textbook 2: Ch. 9.1 to 9.2, 9.3 (Only 9.3.1 to 9.3.5, 9.3.11 to 9.3.12), 9.4 to 9.5.

Module-4

Trees: Introduction, Basic Concepts, Representation of Binary Trees, Operations on Binary Trees: Insertion-Traversals-Searching-Copying a Tree, Binary Search Trees, Operations on Binary Search Trees: Insertion-Searching-Find Maximum and Minimum Value-Count Nodes, Expression Trees.

Textbook 2: Ch. 10.1 to 10.4, 10.5 (Only 10.5.1, 10.5.2, 10.5.3.1, 10.5.3.2, 10.5.3.4), 10.6.3.

Module-5

Sorting: Introduction, Bubble Sort, Selection Sort, Insertion Sort.

Searching: Introduction, Linear Search, Binary Search.

Textbook 1: Ch. 17.1, 17.2.6, 17.3.2.

Textbook 2: Ch. 11.1 to 11.3, 11.10.1.

Suggested Learning Resources:

Text Books:

1. E Balagurusamy, “C Programming and Data Structures”, 4th Edition, McGraw-Hill, 2007.

2. A M Padma Reddy, “Systematic Approach to Data Structures using C”, 9th Revised Edition, Sri Nandi Publications, 2009.

Reference Books:

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

2. Seymour Lipschutz, “Data Structures Schaum’s Outlines”, Revised 1st Edition, McGraw-Hill, 2014.