Scribd
Upload
15 views1 page

DSUC

data structure using c

Uploaded by

Aamina Khatoon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
15 views1 page

DSUC

data structure using c

Uploaded by

Aamina Khatoon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

BRANCH: Diploma (CSE)

void fun1(struct node* head)


YEAR: Second ENROLL. NO. ---------------------------- {
if(head == NULL)
return;
DIPLOMA fun1(head->next);
printf("%d ", head->data);
PRE BOARD EXAMINATION 2024-25 }
b) Convert the infix expression (A+B) *(C-D) $E*F to postfix. Give the answer
DATA STRUCTURE USING C without any spaces.
c) What is BST? Draw the BST that results from inserting the following
numbers in sequence starting with 11: 11, 47, 81, 9, 61, 10, 12,
Time: 2.00 Hours [Total Marks: 50]
Q.4. Attempt any two parts of the following: (5*2=10)
Q.1. Attempt any TEN parts of the following: (1*10=10) a) Differentiate between DFS and BFS. Draw the breadth First Tree for the
a) Define bottom-up design approach. given graph.
b) Explain searching algorithm of an array.
c) Describe the traversal of doubly linked list.
d) What is circular queue?
e) Define complete binary tree.
f) What is binary search?
g) Draw the figure of multigraph.
h) What is Boolean data type?
i) Write any two applications of linked list. b) Use the merge sort algorithm to sort the following elements in
j) Show the types of queue. ascending order. 13, 16, 10, 11, 4, 12, 6, 7.
k) Take any binary tree and show its linked representation What is the time and space complexity of merge sort?
l) Describe the definition of bubble sort. c) (i) Design a method for keeping two stacks within a single linear
array so that neither stack overflow until all the memory is used.
Q.2 Attempt any FIVE parts of the following: (2*5=10)
(ii) Write a C program to reverse a string using stack.
a) Explain the concept of function pointer.
b) Describe the storage representation of multi-dimensional array.
c) Write the iterative and recursive method to traverse a linked list Q.5. Attempt any two parts of the following: (5*2=10)
d) Define the application of stack. a) Write algorithms of insertion sort. Implement the same on the following
e) What is heap? Explain in detail. numbers; also calculate its time complexity. 13, 16, 10, 11, 4, 12, 6, 7
f) What is the difference between internal and external sorting. b) Write a C program insert a element in array at beginning, last and
g) Take any graph and show its array and linked representation. random location.
c) Define the categories of data structure. Also write the difference between
Q.3. Attempt any two parts of the following: (5*2=10) structured and functional programming.
a) Explain the operations on linked list. What does the following recursive
function do for a given Linked List with first node as head?

You might also like