KEMBAR78
Data Structures | PDF | Queue (Abstract Data Type) | Computer Programming
Scribd
Upload
20 views2 pages

Data Structures

The document outlines the syllabus for the Data Structures course for II Year B. Tech. students starting from the academic year 2024-25, covering essential topics such as ADTs, searching and sorting techniques, stacks, queues, linked lists, binary trees, and graphs. It specifies course outcomes that students should achieve by the end of the course, along with a detailed breakdown of units and lectures. Additionally, it lists textbooks, reference books, and web resources for further study.

Uploaded by

orr61115
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
20 views2 pages

Data Structures

The document outlines the syllabus for the Data Structures course for II Year B. Tech. students starting from the academic year 2024-25, covering essential topics such as ADTs, searching and sorting techniques, stacks, queues, linked lists, binary trees, and graphs. It specifies course outcomes that students should achieve by the end of the course, along with a detailed breakdown of units and lectures. Additionally, it lists textbooks, reference books, and web resources for further study.

Uploaded by

orr61115
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/ 2

R24- Syllabus of ECE-GVPW(A) w.e.f.

2024-25

DATA STRUCTURES
II Year B. Tech. I Semester
[Common to CSE, CSE (AI&ML), IT, ECE]
L T P C
Course Code: 24CT11RC09 3 0 0 3

Course Outcomes: At the end of the Course, the student shall be able to
CO1: Outline the concept of ADT, identify suitable data structures to solve problems, and experiment
with different searching & sorting techniques using arrays. (L2,L3)
CO2: Develop and analyse algorithms for stacks, queues, and priority queues. (L3,L4)
CO3: Model linked list representations for various applications. (L3)
CO4: Develop and analyse algorithms for Binary Trees and Binary Search Trees. (L3,L4)
CO5: Summarize the concepts of Graph representation, graph traversals and hashing. (L2)

UNIT-I 10 Lectures
Data Structures: Definition, Classification of Data Structures, Operations on Data Structures,
Abstract Data Type (ADT), Introduction to array ADT.
Searching: Linear search, Binary search.
Sorting: Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix sort)

UNIT-II 10 Lectures
Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Applications-
Infix to Postfix Conversion, Evaluating Postfix Expressions.
Queues: Introduction to Queues, Representation of Queues-using Arrays, Implementation of Queues-
using Arrays, Circular Queues.
Priority Queue: model, simple implementation, Binary Heap-structure property, heap order property,
heap operations, Heap sort.

UNIT-III 12 Lectures
Linked List: Introduction, Single linked list, Representation of Linked list in memory, Operations
on Single Linked list-Insertion, Deletion, Search and Traversal, Reversing Single Linked list,
Double Linked list, Circular Linked list.
Applications on Single Linked list: Stacks and queues using linked list, Polynomial Expression
Representation, Sparse Matrix Representation using Linked List

Page 4 of 43
R24- Syllabus of ECE-GVPW(A) w.e.f.2024-25

UNIT-IV 10 Lectures
Introduction: Terminology, Representation of trees
Binary Trees: The ADT, Properties of binary trees, Binary tree Representations, Binary tree
Traversals: in order traversal, preorder traversal, post order traversal
Binary Search Trees: Definition, Searching a BST, Insertion into a BST, Deletion from a BST
Efficient Binary Search Tree: AVL Trees.

UNIT-V 8 Lectures
Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list, Graph
Traversals (BFT & DFT), Hashing-Introduction, static hashing, hashing functions, overflow
handling techniques.

Text Books:
1. Fundamentals of Data Structures in C, 2nd Edition, Horowitz, Sahin, Universities Press.
2. Data Structures and algorithm analysis in C, 2nded, Mark Allen Weiss.

Reference Books:
1. Data Structures Using C. 2nd Edition, ReemaThareja, Oxford.
2. Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg, Behrouz A. Forouzon, Cengage.

Web References (e-Resources):


1. https://onlinecourses.swayam2.ac.in/cec25_ma15/preview.

Page 5 of 43

You might also like