Scribd
Upload
75 views

Data Structures-Model Paper

Uploaded by

dudekulabalabrahmam143
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
75 views

Data Structures-Model Paper

Uploaded by

dudekulabalabrahmam143
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Computer Science

Sub: Data Structures


Course: Mpcs,Bzcs,Zccs (2nd Sem)
Part-A Each one Carries 5 marks
Unit – 1
Short Answer Question:
) What are Linear and Non-Linear Data Structures?
2) Explain different primitive data type?
3) Define Data Structures?
4) What are benefits of learning data structures?
5) What is step wise refinement?
6) What is pseudo code?
7) What are different types of data structures? With examples
Unit-2:
Short Answer Questions:
1) Compare linked list and Arrays?
2) Mention some applications of linked list?
3) How to reverse a given linked list?
4) Write an Algorithm to insert a node from doubly linked list?
5) What is an address in c?
6) What is singly linked List?
Unit-3
1) Explain the difference between iteration and recursion?
2) What are applications of Queue?
3) What is infix and postfix notations? Explain with suitable Example?
4) Write ADT of stack and Queue?
5) What are applications of Stack?
6) What is polish notation? Explain prefix in as polish notation?
Unit-4
1) Write about Searching and inserting in binary search tree?
2) Explain about tree traversal?
3) What is complete binary tree?
4) Write a short note on extended binary tree?
5) Write the various applications of binary tree and binary search tree?
6) Write the expression tree for (a+b)*(c+d*e)?
7) Explain deleting a node from existing binary search tree?
Unit-5
1) What is the time complexity of selection sort?
2) Write the algorithm for Bubble Sort?
3) Define sorting? What are the advantages and Disadvantages of merge sort?
4) Write the algorithm for insertion sort?
5) What are the advantages and disadvantages of Linear (sequential) search? What is its time
complexity?
6) What is the time complexity of merge sort?
Part-B Each one carries 10 marks
Unit-1
Essay Questions:
1) What is the efficiency of algorithm? How to represent it using Big On notation?
2) What is recursion? Explain its advantages and disadvantages?
3) What is step wise refinement? Explain
4) Explain about the primitive and Non-primitive data Structures?
5) Explain the terms- data types and data structures?
Unit-2
1) What is an Array? What are its features? What is one-dimensional Array? What are the various
operations that can be performed on an array?
2) What is Linked List? Explain its advantages, disadvantages and applications?
3) What are two dimensional arrays? Explain about their declaration and initialization?
4) Explain the following giving example for each
a) Singly linked list b) Doubly linked list c) Circular linked list.
Unit-3
1) What is Stack? Explain the features of Stack?
2) Explain how String can be reversed with the help of Stack?
3) What is Queue? Explain Queue as ADT?
4) Write algorithm for stack operation?
5) Explain how to implement a stack?
Unit-4
1) What are non-linear data structures? Explain the differences in between linear and non-linear
data structures?
2) What is a binary tree? Explain the operations on binary tree?
3) What is traversing tree? Explain various methods of tree traversals?
4) Explain the following terms with regard to binary trees?
a) Root b) Parent c ) Child d) Leaf e) Sub tree
f) Visiting g) Traversing h) Levels i) Keys
5) What is a tree Define the following?
a) Node b) Degree c) Leaf or terminal d) Siblings
e) Ancestors f) Level g) Height or Depth h) Forest
Unit-5
1) What is bubble sort? Write algorithm and also give an example?
2) What is graph? Define the following terms in relation to graphs?
3) What is binary search? Explain its mechanism and algorithm?
4) What is merge sort? Write an algorithm and provide an example?
5) Explain Breadth First Search(BFS) procedure?

You might also like