Scribd
Upload
12 views

Data Structure Assignment

DSA

Uploaded by

Pathak Ji
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
12 views

Data Structure Assignment

DSA

Uploaded by

Pathak Ji
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/ 3
B.C.A Semoster-ll Assignment for internal Assessment -& Term Work, undamentat Data Structure [2ECAQ ‘Choose the suitable alternative : 4. Tivelements of data structure ave relatively flexible in case of ¢) Veotor d) List 2. Which of the following data structures is known 3§ the non-linear structure: s)array 6) Suing a) Stack b)Digraph 3. Listi a) Linear data structure c) Both (a) &(b) 4, Theend ofa linked lists - ae byNULL 5, Transfer of olements in a stack is added or deleied in th a)Lastin, first out ¢) First in, last out and last in, first out 6. Reverse polish notation is: )iniix ') postfix ©) prefix 4) None of these cK Quene has = ey a)Oneend b)Twoend c) Three end 4) Four end 8. Queveis empty when- a a)Eroat=-1 ) Rear =-1 )Rear=Front 4) Rear>Front 9, _ Treeisageaph vith 2) One cycle b) Twoeycle c) Without eycle 4) All ofthe above 10, Treeis- 2)FIFO structure >) Recursive 6) Non- recursive d) Nowe 11, Header nade is useto 1) Hide the list ) Increase complexity ¢) Display more information easily d) None of the above 12, _Accharacteristics of the data that binary search uses but the linear search ignore is the: 4) Order of the list b) Length of the list ¢) Maximum value in the list d) Meanof the data vaines. c)Arey . 6) Deque ‘y) Non linear data structure a) None of the above ©)Both (a) & (6) _d) Neng of theabove ciple of: +) Fist in, first out 4)None of the above 13. Dynamically allocated memory release by the function. a) Delete ‘b) Free siaale 4) Colles. Page | of3 - “derorenreen it snotation the operaters precodes the two operands. do you mean by linear and non-linear data structue?’ Descibe algo revert an -copyingthe tree structure. _ Howa polynomial is evaluated using linked list? Implementit using ina program. 1g operation in it a) -b) Deiete ©) Display ayReverse display ‘Explain theconceprofstack as a data stricture Illustrate its veetorrepresentation and possibili ‘to-implement two stacks using one vectot. Describe the algorithm for FUSE, POP and PEE operations for a data structure representation. What's polish:notation? Write a program to convert an infixexpression to its equiralent post! _ notation. Describe importance of post fix notation in detail. ‘Define priority queue and circntar queue. Write program toperform foliowitig-operdtions in be 0) Display Describe binary tree representation of data structure. What is conéept of linked stora tee? Write a program to perform the following operations on BST. +b) Delete ©} Display (in order, ptéordér nd post onde: if pointer. What are memory allocation. tree? How itis different from Binary Search Tree (BST)? AML tree with following data. 1,8, 4. 1,0, 7,2, 6, 10. C program toimplementthe stack using an array. queue. Write an algorithm to perform the following operations on queve. b) Deletion c) Display yumenn by Dequeue? What are the different types of Dequeue? Explain briefly n.to merge two unsorted array.

You might also like