Scribd
Upload
2 views

CC-4 Data Structure

The document is an examination paper for a Data Structure course with a total of 60 marks and a duration of 3 hours. It consists of various types of questions including one-word answers, short descriptive answers, and algorithm writing related to data structures such as arrays, linked lists, trees, and queues. The paper tests knowledge on concepts like memory allocation, traversal methods, and the differences between various data structures.

Uploaded by

bijudeep2004
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

CC-4 Data Structure

The document is an examination paper for a Data Structure course with a total of 60 marks and a duration of 3 hours. It consists of various types of questions including one-word answers, short descriptive answers, and algorithm writing related to data structures such as arrays, linked lists, trees, and queues. The paper tests knowledge on concepts like memory allocation, traversal methods, and the differences between various data structures.

Uploaded by

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

BCA-Sem-II

CC-IV(R/B)

2022
Full Marks-60 Time: 3 Hours
Answer all the questions.
The figure in the right hand margin indicates marks.
(Data Structure)
1. Answer the question in one word. [1x8 = 8]
a. Is array a linear data structure or nonlinear data structure.
b. What is pointer?
c. Which function is used to allocate memory for linked list?
d. Linked list follows static allocation or dynamic memory allocation.
e. Which data structure is used in recursion?
f. Where queue is used?
g. What is the degree of a node if it contains 4 child nodes?
h. What is time complexity of bubble sort?
2. Answer any 8 questions in two to three sentences. [1.5x 8=12]

a.What is the difference between array and structure?


b.Define a node in single linked list with diagram.
c.What is a sparse matrix?
d.Convert the infix expression to postfix: (A+B)-(C*D^E+F/F)
e.Differentiate between stack and queue.
f.State the condition for underflow in queue?
g.Define height of a tree.
h.Construct a binary search tree from the given elements:
12,34,32,8,17,15,56,48,21,10.
i. What is complete binary tree?
j. Differentiate between linear search and binary search.
3. Answer any 8 questions. [2 x8 =16]
a. What is pointer? How memory allocation is achieved using pointer.
b. What is an array? List the different array operation with example.
c. For the given list write code to insert element after 20.
d. What is the difference between single and double linked list.
e. What is circular linked list explain with proper diagram.
f. Write the algorithm to push and pop element from a stack.
g. Write an algorithm for linked list implementation of queue.

1
h. Find the preorder, in order and post order traversal of the given tree.

i. Check if the tree given in question h is height balanced or not.


j. Write an algorithm for binary search.
4. a. Is array is static or dynamic. Write an algorithm to insert element at beginning of an
array of 10 elements. [6]
OR
b. How memory is allocated dynamically. Explain the memory allocation function in brief
with proper example.
5. a. Write an algorithm to create a linked list and insert element at the end of the list. [6]
OR
b. What is double linked list? How a node is created
created in double linked list. Write an
algorithm to delete element from the end of double linked list.
6. a. Write an algorithm to convert infix expression to postfix expression with suitable
example. [6]
OR
b. What is a queue? How many type of queue are there. Write algorithm to insert and
delete element from queue.
7. a. What is binary search tree? How insertion is performed in binary seasearch
rch tree. Explain
with example and proper diagram. Write the preorder tree traversal algorithm. [6]

OR
b. Given an AVL tree. If 17 will be inserted to the tree then what is the AVL tree.

****************************

You might also like