Scribd
Upload
18 views2 pages

CSE UG DS

The document outlines the course structure for Data Structures at Bhimavaram Institute of Engineering & Technology, detailing course objectives and outcomes. It covers various topics including linear data structures, linked lists, stacks, queues, trees, and hashing, along with their applications and implementations. The document also lists recommended textbooks and reference materials for further study.

Uploaded by

satyamca41
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
18 views2 pages

CSE UG DS

The document outlines the course structure for Data Structures at Bhimavaram Institute of Engineering & Technology, detailing course objectives and outcomes. It covers various topics including linear data structures, linked lists, stacks, queues, trees, and hashing, along with their applications and implementations. The document also lists recommended textbooks and reference materials for further study.

Uploaded by

satyamca41
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

BHIMAVARAM INSTITUTE OF

ENGINEERING & TECHNOLOGY


AUTONOMOUS
Approved by AICTE, New Delhi & Affiliated to JNTUK, Kakinada
Accredited with “A” Grade by NAAC & ISO 9001:2015 Certified Institution
PENNADA, Bhimavaram-534 243, W.G. Dt. (A.P)
Ph: +91-9948639666 Email: [email protected] Website: https://bietbvrm.ac.in/

BIET/ B.Tech/CSE/R24 Regulations


L T P C
3 0 0 3
DATA STRUCTURES
(Common to First Year CSE & allied branches)
Course Objectives:
• To provide the knowledge of basic data structures and their implementations.
• To understand importance of data structures in context of writing efficient programs.
• To develop skills to apply appropriate data structures in problem solving.

Course Outcomes: At the end of the course, Student will be able to


CO1: Explain the role of linear data structures in organizing and accessing data efficiently in algorithms.
CO2: Design, implement, and apply linked lists for dynamic data storage, demonstrating understanding of
memory allocation.
CO3: Develop programs using stacks to handle recursive algorithms, manage program states, and solve
related problems.
CO4: Apply queue-based algorithms for efficient task scheduling and breadth-first traversal in graphs and
distinguish between deques and priority queues, and apply them appropriately to solve data management
challenges.
CO5: Devise novel solutions to small scale programming challenges involving data structures such as
stacks, queues, Trees.
CO6: Recognize scenarios where hashing is advantageous, and design hash-based solutions for specific
problems.

UNIT I
Introduction to Linear Data Structures: Definition and importance of linear data structures, Abstract data
types (ADTs) and their implementation, Overview of time and space complexity analysis for linear data
structures. Searching Techniques: Linear & Binary Search, Sorting Techniques: Bubble sort, Selection sort,
Insertion Sort

UNIT II
Linked Lists: Singly linked lists: representation and operations, doubly linked lists and circular linked lists,
Comparing arrays and linked lists, Applications of linked lists.

UNIT III
Stacks: Introduction to stacks: properties and operations, implementing stacks using arrays and linked lists,
Applications of stacks in expression evaluation, backtracking, reversing list etc.

UNIT IV
Queues: Introduction to queues: properties and operations, implementing queues using arrays and linked
lists, Applications of queues in breadth-first search, scheduling, etc.
Deques: Introduction to deques (double-ended queues), Operations on deques and their applications.

UNIT V
Page 1 of 2
Trees: Introduction to Trees, Binary Search Tree – Insertion, Deletion & Traversal
Hashing: Brief introduction to hashing and hash functions, Collision resolution techniques: chaining and
open addressing, Hash tables: basic implementation and operations, Applications of hashing in unique
identifier generation, caching, etc.

Textbooks:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Silicon Press,
2008

Reference Books:
1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft
3. Problem Solving with Algorithms and Data Structures" by Brad Miller and David Ranum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford
Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph
Algorithms" by Robert Sedgewick

Page 2 of 2

You might also like