Scribd
Upload
158 views2 pages

R18 B.Tech. Computer Science & Engg

This document provides information on the Data Structures course CS302ES, including objectives, outcomes, and content. The course explores basic data structures like stacks and queues, and introduces more advanced structures including hash tables, search trees, tries, heaps, and graphs. Students will learn to select appropriate data structures for problems, assess efficiency tradeoffs, and implement sorting and pattern matching algorithms. The course is divided into 5 units covering linear lists, dictionaries, hash tables, search trees, graphs, sorting, and pattern matching/tries. A related lab course CS307PC provides hands-on practice with data structures and algorithms.

Uploaded by

scet 315
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
158 views2 pages

R18 B.Tech. Computer Science & Engg

This document provides information on the Data Structures course CS302ES, including objectives, outcomes, and content. The course explores basic data structures like stacks and queues, and introduces more advanced structures including hash tables, search trees, tries, heaps, and graphs. Students will learn to select appropriate data structures for problems, assess efficiency tradeoffs, and implement sorting and pattern matching algorithms. The course is divided into 5 units covering linear lists, dictionaries, hash tables, search trees, graphs, sorting, and pattern matching/tries. A related lab course CS307PC provides hands-on practice with data structures and algorithms.

Uploaded by

scet 315
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

R18 B.TECH. COMPUTER SCIENCE & ENGG.

CS302ES: DATA STRUCTURES

B.TECH II Year I Sem. L T P C


3 1 0 4
Prerequisites: A course on “Programming for Problem Solving”.

Course Objectives:
Exploring basic data structures such as stacks and queues.
Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
Introduces sorting and pattern matching algorithms

Course Outcomes:
Ability to select the data structures that efficiently model the information in a problem.
Ability to assess efficiency trade-offs among different data structure implementations or
combinations.
Implement and know the application of algorithms for sorting and pattern matching.
Design programs using a variety of data structures, including hash tables, binary and general
tree structures, search trees, tries, heaps, graphs, and AVL-trees.

UNIT - I
Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation,
insertion, deletion and searching operations on linear list, Stacks-Operations, array and linked
representations of stacks, stack applications, Queues-operations, array and linked representations.

UNIT - II
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 - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and
Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and
Searching, Red –Black, Splay Trees.

UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods.
Sorting: Heap Sort, External Sorting- Model for external sorting, Merge Sort.

UNIT - V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm,
the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.

TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson
Freed, Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson
Education.
REFERENCE BOOKS:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A.
Forouzan, Cengage Learning.
R18 B.TECH. COMPUTER SCIENCE & ENGG.

CS307PC: DATA STRUCTURES LAB

B.Tech. II Year I Sem. L T/P/D C


0 0/3/0 1.5
Prerequisites: A Course on “Programming for problem solving”.

Course Objectives:
It covers various concepts of C programming language
It introduces searching and sorting algorithms
It provides an understanding of data structures such as stacks and queues.

Course Outcomes:
Ability to develop C programs for computing and real-life applications using basic elements
like control statements, arrays, functions, pointers and strings, and data structures like stacks,
queues and linked lists.
Ability to Implement searching and sorting algorithms

LIST OF EXPERIMENTS
1. Write a program that uses functions to perform the following operations on singly linked
list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on doubly linked
list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that uses functions to perform the following operations on circular linked
list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
4. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given list of
integers in ascending order
i) Bubble sort ii) Selection sort iii) Insertion sort
7. Write a program that use both recursive and non recursive functions to perform the
following searching operations for a Key value in a given list of integers:
i) Linear search ii) Binary search
8. Write a program to implement the tree traversal methods.

9. Write a program to implement the graph traversal methods.

TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson
Freed, Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M. J. Augenstein,
PHI/Pearson Education.

REFERENCE:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B. A.
Forouzan, Cengage Learning.

You might also like