VASIREDDY VENKATADRI INSTITUTE OF

TECHNOLOGYNAMBUR-522508.

YEAR: I B. Tech SEMESTER: II

COURSE NAME: DATA STRUCTURES
COURSE CODE:
BRANCH: COMPUTER SCIENCE & ENGINEERING
PREREQUISITE: At least one programming language such as C, C++, Java, or
Python
COURSE OBJECTIVE:
 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: Students will be able to:
Cognitive
Levels as
S.N Weightag
OUTCOME per
o e (%)
Bloom’s
Taxonomy
Summarize the role of linear data structures in L1, L2, L3,
CO1 20
organizing and accessing data efficiently in algorithms. L4
Design, implement, and apply linked lists for dynamic
L1, L2, L3,
CO2 data storage, demonstrating understanding of memory 20
L4
allocation.
Develop programs using stacks to handle recursive
L1, L2, L3,
CO3 algorithms, manage program states, and solve related 20
L4
problems.
Devise novel solutions to small scale programming
L1, L2, L3,
CO4 challenges involving data structures such queues, 20
L4
dequeues.
Recognize scenarios where trees, hashing is L1, L2, L3,
CO5 advantageous, and design hash-based solutions for 20
L4
specific problems.

WEIGHTAGE OF BLOOM’S LEGENDS & PERCENTAGEOF QUESTIONS IN

EXAMINATIONS:
L1 (Remembering) = 20- 30%, L2 (Understanding) = 30 - 40%,
L3 (Applying) = 20-30 %, L4 (Analysing) = 20 - 30%,
Easy (%) = 15%-20%, Average (%)= 60% - 70%, Difficult(%)= 15% - 20%
TOTAL = L1 + L2 + L3 + L4 = 100% (on an average about 2 minutes per mark)
Note: This specification weightage in above shall be treated as a general
guideline for students, teachers, and paper setters. The actual distribution of
marks in the question paper may vary slightly.
DETAILED SYLLABUS:
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:

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
MICRO-SYLLABUS:

Unit 1 Module Micro content

Linear Data Structures, Definition and importance of linear data
Linear Data ADT, Algorithmic structures, Abstract data types (ADTs) and
Structures& Complexity, their implementation
Algorithms performance and Time complexity and space complexity
analysis for Linear Data Structures
Searching & Searching in Linear Linear Search
Sorting List Binary Search
Techniques
Sorting Bubble sort, Selection sort, Insertion Sort
Additional Topics Quick sort, Merge sort
Unit 2 Module Micro content
Singly Linked List: Representation
Operations: Insert at begin, insert at end,
insert at position, delete at begin, delete at
end, Delete at position, search
Doubly Linked List: Representation
Representation and Operations: Insert at begin, insert at end,
Linked List Insert at position, Delete at begin, Delete at
Operations
end, Delete at position, search
Circular Linked List: Representation
Operations: Insertion, Deletion and search
Comparing arrays and linked lists, Applications
of linked lists.
Unit 3 Module Micro content

Introduction properties and operations

Stacks Representation and Stacks: Representation using arrays

Operations Operations: push, pop, peek

Applications expression evaluation, reversing list

Convert infix expression to postfix

Additional Topics:
expression
Unit 4 Module Micro content
Definition, Representation, properties and
Introduction
operations
implementing queues using arrays and
Implementation
linked lists
Queues / Deques
Applications Queues in breadth-first search, scheduling
Introduction to deques (double-ended
Deques queues), Operations on deques and their
applications.
Additional Topics: Types of Queues

Unit 5 Module Micro content

 Introduction to Trees, Binary Search Tree –
Trees Introduction
Insertion, Deletion & Traversal.
Concept of Hashing, Hash Functions:
Division Method, Folding Method, Mid
Collision Resolution Square Method
Hashing
using Hashing Collision Resolution Techniques: Linear
Probing, Quadratic Probing, Double
Hashing, Separate Chaining
basic implementation and operations,
Implementation &
Hash tables Applications of hashing in unique identifier
Operations
generation, caching, etc
Additional Topics Construct a Binary Tree from its traversals

*****
 R23
Code No:
I B. TECH II SEMESTER REGULAR EXAMINATIONS, JULY-2024
DATA STRUCTURES
(COMMON TO CSE, IT & ALLIED BRANCHES)
Time: 3 Hours Max. Marks:
70
_________________________________________________________________________________
Note: 1. The question paper consists of two parts (Part-A and Part-B)
2. All the questions in Part-A are Compulsory
3. Answer ONE Question from Each Unit in Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PART – A (20 Marks)

1. a) Define Time and Space Complexity. [2M]

b) Define ADT. (Abstract Data Type) [2M]
c) List advantages of linked list over arrays. [2M]
d) Discuss operations performed with polynomials. [2M]
e) Write the differences between stack and queue. [2M]
f) What are the disadvantages of representing a stack using [2M]
Arrays
g) Write the applications of queues. [2M]
h) Define Double Ended Queue (deque). [2M]
i) Define Sibling. [2M]
j) Write about hash functions. [2M]

PART – B (50 Marks)

UNIT-I
2. a) Apply the insertion sort for given numbers: 34, 8, 14, 61, 4, [5 M]
53, 81, 47.
b) Illustrate the step-by-step procedure for sorting the following [5 M]
unordered list of elements 52, 37, 63, 14, 17, 8, 6, 25 using
Quick sort technique.
(OR)
3. a) Define Algorithm. Explain time complexity and space [5 M]
complexity of an algorithm.
b) Discuss merge sort algorithm with a suitable example. [5 M]
UNIT-II
4. a) Explain the steps to implement the following operations of [6M]
singly-linked list without head node using illustrative
examples?
(i) removing at front
(ii) removing at end
(iii) removing node before a specified node
b) Provide an example of a real-life scenario where the use of a [4M]
doubly linked list would be appropriate.
(OR)
5. a) Discuss the steps involved in searching for an element in a [5 M]
 single linked list.
b) Illustrate how a polynomial can be represented using linked [5 M]
list. Write an algorithm for adding two polynomials
represented by linked lists.
UNIT-III
6. a) Convert following expression X+ (Y * Z) – ((N * M +O) /Q) in [5 M]
to postfix form.
b) Explain the procedure to evaluate postfix expression. [5 M]
Evaluate the following Postfix expression 7 3 4 + - 2 4 5 / + *
6 / 7 +.
(OR)
7. a) Explain the basic operations of stack with pseudo code.(L2) [5 M]
b) Write an algorithm to push and pop an element from linked [5 M]
stack.
UNIT-IV
8. a) Compare the advantages and disadvantages of array-based [5 M]
and
linked list based implementations for queues.
b) Give the structure of Queue. Explain the operations in it. [5 M]
(OR)
9. a) Write an algorithm to insert and delete a key from circular [6M]
queue.
b) Define Deque. Explain the operations in it. [4M]
UNIT-V
10. a) Construct Binary Search Tree by inserting the following key [5 M]
elements: 10, 12, 5, 4, 20, 8, 7, 6, 15.
b) Explain pre-order, in-order and post-order traversals of Binary [5 M]
tree.
(OR)
11. a) What is hashing? Briefly explain various hashing methods. [5 M]
b) Summarize various Collision Resolution Techniques? [5 M]

*****

THE ABOVE MODEL PAPER ATTAINMENTS OF BLOOM’S TEXONOMY AS FOLLOWS

L1: 29 Marks (24%)

L2: 42 Marks (35%)

L3: 25 Marks (21%)

L4: 24 Marks (20%)

SIGNATURES OF

COURSE COORDINATER MODULE COORDINATER HOD