[go: up one dir, main page]
Scribd
Upload
90 views1 page

(R18A0503) DATA STRUCTURES Digital Notes 001

The document outlines the syllabus for the Data Structures course at Malla Reddy College of Engineering and Technology for II Year B.Tech CSE students. It covers fundamental concepts of data structures, including linked lists, stacks, queues, searching and sorting techniques, graphs, dictionaries, hash tables, binary search trees, AVL trees, and B-trees. The course aims to provide students with a comprehensive understanding of various data structures and their applications.

Uploaded by

srise8260
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
90 views1 page

(R18A0503) DATA STRUCTURES Digital Notes 001

The document outlines the syllabus for the Data Structures course at Malla Reddy College of Engineering and Technology for II Year B.Tech CSE students. It covers fundamental concepts of data structures, including linked lists, stacks, queues, searching and sorting techniques, graphs, dictionaries, hash tables, binary search trees, AVL trees, and B-trees. The course aims to provide students with a comprehensive understanding of various data structures and their applications.

Uploaded by

srise8260
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/ 1

MALLA REDDY COLLEGE OF ENGINEERING AND TECHNOLOGY

L T/P/D C
II Year B.Tech CSE - I Sem 3-/-/-3
(R18A0503) DATA STRUCTURES

Prerequisites: A course on ―Programming for Problem Solving‖.


Course Objectives:
 To impart the basic concepts of data structures
 Exploring basic data structures such as stacks queues and lists.
 Introduces a variety of data structures such as hash tables, search trees, heaps, graphs.
 To understand concepts about searching and sorting techniques

UNIT-I
Introduction : Abstract data types, Singly linked list: Definition, operations: Traversing,
Searching, Insertion and deletion, Doubly linked list: Definition, operations: Traversing,
Searching, Insertion and deletion ,Circular Linked List: Definition, operations: Traversing,
Searching, Insertion and deletion.
UNIT-II
Stack: Stack ADT, array and linked list implementation, Applications- expression conversion
and evaluation. Queue : Types of Queue: Simple Queue, Circular Queue, Queue ADT- array
and linked list implementation. Priority Queue, heaps.
UNIT-III
Searching: Linear and binary search methods. Sorting: Selection Sort, Bubble Sort, Insertion
Sort, Quick Sort, Merge Sort, Heap Sort. Time Complexities .Graphs: Basic terminology,
representation of graphs, graph traversal methods DFS,BFS
UNIT IV
Dictionaries: linear list representation, skip list representation, operations - insertion, deletion
and searching. Hash Table Representation: hash functions, collision resolution- separate
chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing,
extendible hashing.
UNIT-V
Binary Search Trees: Various Binary tree representation, definition, BST ADT,
Implementation, Operations- Searching, Insertion and Deletion, Binary tree traversals,
threaded binary trees,
AVL Trees :Definition, Height of an AVL Tree, Operations – Insertion, Deletion and
Searching, B-Trees: B-Tree of order m, height of a B-Tree, insertion, deletion and searching,
B+ Tree.

You might also like