[go: up one dir, main page]
Scribd
Upload
16 views2 pages

Syllabus_CS126

The document outlines the course structure for 'Data Structures' offered at R.V.R. & J.C. College of Engineering, detailing course objectives, outcomes, and content across four units. Key topics include linear and non-linear data structures, performance analysis, searching and sorting algorithms, and applications of stacks, queues, trees, and graphs. Recommended textbooks and reference materials are also provided for further study.

Uploaded by

rohitaditya710
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
16 views2 pages

Syllabus_CS126

The document outlines the course structure for 'Data Structures' offered at R.V.R. & J.C. College of Engineering, detailing course objectives, outcomes, and content across four units. Key topics include linear and non-linear data structures, performance analysis, searching and sorting algorithms, and applications of stacks, queues, trees, and graphs. Recommended textbooks and reference materials are also provided for further study.

Uploaded by

rohitaditya710
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

R.V.R. & J.C. College of Engineering (Autonomous), Guntur-522019, A.P.

R-24

CS126 DATA STRUCTURES L T P C Int Ext


(Common to branches CSE/CSD/CSO/IT) 4 - - 4.0 30 70
Semester II [First Year]
COURSE OBJECTIVES:
The main objectives of this course are to:
1. To illustrate operations of linear and non- linear data structure.
2. To demonstrate computational problems using suitable data structures.

COURSE OUTCOMES:
After successful completion of the course, the students are able to:
1. Analyze the perform anceof algorithms to evaluate their efficiency.
2. Apply searching, sorting and hashing techniques to organize and retrieve data efficiently.
3. Develop Liner a structures to manipulate sequential data and solve computational problems.
4. Implement Non-Linear data structures to solve real world problems.

UNIT I [CO:1] (15)

Introduction: Basic Concepts-Algorithm Specification, Data Abstraction, Performance Analysis-Time


complexity, Space complexity, Asymptotic Notations.

Searching and sorting: Linear Search, Binary Search, insertion sort, selection sort.

UNIT II [CO:2] (15)

Lists: Pointers, Singly Linked Lists, Double linked list, Circular Linked Lists: Operations & their
algorithms, Polynomials: Addition, Multiplication.

Hashing: Static Hashing-HashTables, Hashing Functions, Over flow Handling.

UNIT III [CO:3] (16)

Stacks and Queues: Stack ADT, Queue ADT, Stack applications, Multiple Stacks and Queues,
Dynamically Linked Stacks and Queues.

UNIT IV [CO:4] (14)

Trees: Introduction, binary trees, Binary Tree Traversals, Binary Search Trees, AVL Trees, Heaps,
Heap sort, B- Trees and B+ Trees.

Graphs: The Graph Abstract Data Type, representations of graphs, Elementary Graph Operations
Depth First Search, BreadthFirst Search,ConnectedComponents.

LEARNING RESOURCES:

TEXT BOOK:
Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, "Fundamentals of Data Structures in C", Second
Edition, University Press, 2008.

REFERENCE BOOK(s):
1. Mark Allen Weiss,"Data Structures and Algorithm Analysis in C", 2ndEdition,Pearson Education,
1997.
2. Y. Langsam, M.J.Augeustein and A.M. Tenenbaum, Data Structures Using C,Pearson Education
Asia, 2004.

B.Tech.(CS)/R-24/2024-2025 Printed through web on 12-02-2025 20:12:22 Page 1/ 2


R.V.R. & J.C. College of Engineering (Autonomous), Guntur-522019, A.P. R-24

3. Aho, Hopcroft and Ullman," Data Structures and Algorithms", PearsonEducation,1983. Jean Paul
Trembly and P.G .Sorenson, An Introduction of Data Structures with Applications.

B.Tech.(CS)/R-24/2024-2025 Printed through web on 12-02-2025 20:12:22 Page 2/ 2

You might also like