Common to B.Sc. Honours Computer Science Major & B.Sc. Honours Information Technology Major
Data Structures using C
Semester II · Course 3 · Model Question Paper
Time: 3 Hours
Max. Marks: 70
FOCUS KEYWORDS
Data Structures using C
BSc CS Semester 2
BSc IT Semester 2
Linked List
Stack & Queue
Binary Tree Traversal
Graph Traversal
Binary Search Tree
Sorting & Searching
VSU Model Paper
Section A
Any 5 × 4 marks = 20- Define an Algorithm. Explain its characteristics.
- Differentiate Linked List and Array.
- Explain the types of linked lists.
- What is a stack? Write its applications.
- Write about Circular Queue.
- What is searching and sorting.
- Explain Binary Tree Traversals with examples.
- Define a Graph. Write the applications of Graph.
Section B
Any 5 × 10 marks = 50
UNIT I
9(a)
Define Data Structure. Explain the types of data structures in detail.
OR
9(b)
Write short notes on:
- Space Complexity
- Time Complexity
- Asymptotic Notations
UNIT II
10(a)
Implement Single Linked List ADT with the following operations:
- Creating a List
- Insertion (At first node, specified position, last node)
OR
10(b)
Implement Single Linked List ADT with the following operations:
- Creating a List
- Deletion (At first node, specified position, last node)
UNIT III
11(a)
Explain the implementation of Stack ADT using an Array.
OR
11(b)
Explain the implementation of Queue ADT using an Array.
UNIT IV
12(a)
Explain Binary Search with example.
OR
12(b)
Explain Bubble Sort with example.
UNIT V
13(a)
Define Binary Search Tree. Explain the operations of Binary Search Tree.
OR
13(b)
What are Graph Traversal techniques? Explain with examples.
మా వాట్సాప్ ఛానెల్లో జాయిన్ అవ్వండి
AP ప్రభుత్వ పథకాలు & జాబ్ అప్డేట్స్ కోసం జాయిన్ అవ్వండి!
Join WhatsApp Channel
