Download SGBAU BCA 2019 Summer 3rd Sem Data Structure Question Paper

Download SGBAU (Sant Gadge Baba Amravati university) BCA 2019 Summer (Bachelor of Computer Applications) 3rd Sem Data Structure Previous Question Paper

AVV?l800
B.C.A. (Part?Il) Scmcstcr?III Examination
SS'l'l : DATA STRUCTURE
Time : Three Hours] [Maximum Marks ; 60
Note :?-(1) All questions carry equal marks.
1. (a)
(2) All questions are compulsory.
What is Data Structure ?? Explain the types ofData Structure with suitable examplc. 6
(b) What is Stack ?.? Explain how over?ow and undcr?ow condition occurs in stack with
2. (21)
(b)
b)
A
n:
V
4. (a)
(b)
(b)
example. 6
0R
Consider the following stack ofcharactcrs when: S'l'ACK is allocated N ? 8 mcmory
cells :
STACK ?> |7x|c| D] E ! F
Describe the stack as following operations take place :
(1) PUSH (STACK. G)
(ii) PUSH (STACK. H)
(iii) PUSII (STACK. 1)
(iv) POP (STACK, l'l'I?lM)
(v) POP (STACK, ITEM)
(vi) PUSH (STACK. P) _ 6
What is array ? Explain the algorithm to traversing an array with suitable example. 6
Explain the recursive de?nition using multiplication ol?Natural Numbers. 6
What is Recursion ?2 lixplain the types ofRecursion with suitable example. 6
0R
Explain the Tower 01'] Ianoi problem with example. 6
Explain the recursion algorithm to ?nd the factorial of given numbers. 6
What is linked list '2 Explain the advantages and disadvantages oflinked list. 6
W rite and explain the al gorithm to delete an elcmcnt from Queue with suitable example.
6
OR
YBC?l 5364 1 ( C ontd .)

6. (a) Explain the different types (it (QLICulcx'. 6
(b) Explain the algorithm to U?HVCI?S?C i linear linked list with suitable example. 6
7. What is Tree ?1? Explain the families of [rec with suitable cxaiiiplc 12
()R
8. Explain the typef: nfTrce Travci?siiig ?.V:th suitable cxnmplc. 12
9. (a) What is sorjng '7 Explain the buh-ilc wrt algorithm will: suitable example. 6
(b) Explain tht: Binary Search A?gorit 1m with suimblc cxample. 6
()R
10. (a) What is Searching ?? Explain the algorithm to search the olcmcm using Linear Search Method.
6
(b) Explain the algorithm to sort the L?ictik?ttl using: sclectian :ort mcthod with suitable example.
6
YBC?i 5 $61
[\J
\J
x)
(/1