Scribd
Upload
71 views

BCA Data Structure

Uploaded by

kkkk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
71 views

BCA Data Structure

Uploaded by

kkkk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 8
Roll No. : Total No. of Questions : 9 ] [ Total No, of Pages : 4 97670 BCA 3rd Semester (New) (Full & Reappear) Examination, March-2021 DATA STRUCTURE-I Paper-BCA-202 Time : Three Hours | { Maximum Marks : 80 $e Before answering the questions, candidates should ensure that they have been supplied the correct and complete question paper. No complaint in this regand, well be entertained after examination. Note :— Attempt five questions in all. Question No. 1 is compulsory and attempt four more questions by selecting one question from each Unit. All questions carry equal marks. J. (a) What is String ? How is it stored in memory ? (b) What is Algorithm ? 97670_5050 (1) RD-564 P.ro. @ (©) What is Array ? (4) What is use of header node in linked list? (c) Define priority queue. (f) = Write four applications of priority queue, (g) Write the properties of urce. (nh) Give any tv applications of graph. Unit-I LR 2. Differentiate between ; @ R a (i) ~~ Linear and Non-linear data structure. Lee (ii The ... +. Of an algorithm is the amount of time the computer requires to execute the algorithm. (b) Best case complexity of the bubble sort algorithm iS sss + a is called a FIFO data structure. CH-71 (1) Tum Over ... is a data structure where data can be represented as a chain of nodes. ey A tree can be drawn if it is in preorder and traversal is given. (f) The running time for traversing all the nodes of binary search tree with n nodes and printing them in order is . 2. Answer the following questions in brief : \Qay~ Describe the stack data structure using an example. aby Briefly explain the difference between a tree and a binary tree. x(c) What do you mean by the time complexity . and the space complexity of an algorithm ? (d) Convert the following infix expression to postfix expression : A* (B + C)/ E - F* (G + HK) (c) Construct a binary tree from the given preorder traversal : Pre-order: * -+RAB+CD 5x4=20 Part-B 10 cach \4> What do you mean by time and space complexity ? Explain. Or 4. Write an algorithm for the subtraction two matrice, 3/4 of dimension r x c, where r and ¢ represent the number of rows and columns, respectively. Part-C 10 each 5. Write an algorithnYfunction to count the number of nodes in a singular linked list. CH-714 (3) Tum Over Or 46. Explain the advantages and disadvantages of a doubly “Linked list over a singular linked list. Part-D 10 cach 70 Give a brief description of operations that can be performed on a stack. Or 8. What is a circular queuc ? Write an algorithny function for deleting an element from circular queue. Part-E 10 cach UW. Traverse the tree as given below in preorder, inorder and postorder and list the vertices in‘ the order they would be visited in each traversal scheme : Or 10. Apply quick sort algorithm for the following list of elements by showing all the steps : 15, 10, 5, 4, 25, 30, 13. CH-714 (4) 4/4

You might also like