Scribd
Upload
38 views

DATA STRUCTURES USING C

This document is an examination paper for the II-B.Tech I-Semester Regular Examinations in Data Structures using C at G. Narayanamma Institute of Technology & Science. It contains a total of eight questions covering various topics such as time and space complexity, sorting algorithms, data structures like queues and stacks, binary trees, and search algorithms. Each question is designed to assess the understanding and application of data structures concepts, with specific marks allocated and Bloom's taxonomy levels indicated.

Uploaded by

ashwathkamreddy
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
38 views

DATA STRUCTURES USING C

This document is an examination paper for the II-B.Tech I-Semester Regular Examinations in Data Structures using C at G. Narayanamma Institute of Technology & Science. It contains a total of eight questions covering various topics such as time and space complexity, sorting algorithms, data structures like queues and stacks, binary trees, and search algorithms. Each question is designed to assess the understanding and application of data structures concepts, with specific marks allocated and Bloom's taxonomy levels indicated.

Uploaded by

ashwathkamreddy
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/ 1

GNITS-R- 18 – 113NA

G. Narayanamma Institute of Technology & Science


(Autonomous) (for Women)
Shaikpet, Hyderabad- 500 104

II-B.Tech I-Semester Regular Examinations, FEB-MAR -2022.


DATA STRUCTURES USING C
(Common to CSM & CSD)
Max. Marks: 70 Time: 03 Hours
(Answer any 05 full questions. Each question carries 14 marks)
******
Q.No Question Marks Bloom’s
Level
Q.1(a) Define time and space complexity. Illustrate the various asymptotic notations. [08] [L2]
(b) Arrange the following list of elements in ascending order using Merge Sort [06] [L4]
C, O, R, O, N, A, V, I, R, U, S Clearly show the sorting process at each step. Explain
its time complexity.
Q.2(a) Explain Quick sort with an example. [06] [L2]
(b) Explain Binary Search algorithm. For the search element apply binary search in the [08] [L3]
data list given.
Search element: {766}
Data list: {111 453 231 112 679 238 876 655 766 877 988 009 122 233 344 566}

Q.3(a) Define queue. Write a C program to implement enqueue and dequeue operations. [08] [L3]
Use array data structure to implement the queue.
(b) Explain about insertion and deletion operations on single linked lists. Write a ‘C’ [06] [L3]
program for the same.

Q.4(a) Define stack. Write a C program to implement stack operations using array. [08] [L3]
(b) Explain sparse matrix representation using array with an example. Discuss the [06] [L2]
advantage and disadvantages of this method.

Q.5(a) Explain, in detail, deletion of a node from a binary tree with one suitable example. [06] [L2]
(b) Define priority queue. Discuss briefly about the heap representation of priority queue. [08] [L2]

Q.6(a) Given the following inorder and preorder traversals, construct the binary tree. [08] [L3]
Inorder traversal : B F G H P R S T W Y Z
Preorder traversal : P F B H G S R Y T W Z
(b) What is a threaded binary tree? Explain with an example. [06] [L1]

Q.7 Explain Depth First Search and Breadth First Search algorithms with an example in [14] [L2]
detail.

Q.8(a) Insert the following list of elements into the hash table by using linear probing (size [07] [L3]
of the hash table is 10) : 36, 48, 66, 27, 23, 87, 10, 12.
(b) What is trie? Explain the compressed trie with an example. [07] [L1]
END OF THE QUESTION PAPER

You might also like