Scribd
Upload
31 views6 pages

Apr-2023 BS23B

Uploaded by

oripri3013
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views6 pages

Apr-2023 BS23B

Uploaded by

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

(6 pages)

APRIL 2023 62528/BS23B

Time : Three hours Maximum : 75 marks

PART A — (10  2 = 20 marks)

Answer any TEN questions.

1. What is a raw data?

‰»uμÄ GßÓõÀ GßÚ?

2. What is meant by a 1-Dimensional array?

1–£›©õn Á›ø\ GßÓõÀ GßÚ?

3. Define : Linear data structure.

Áøμ¯ÖUP : ÷|›¯À uμÄ Aø©¨¦.

4. What is meant by OVERFLOW condition in stack?

ìhõUQÀ KÁºL¨÷Íõ {ø» GßÓõÀ GßÚ?

5. How can you differentiate the ‘front’ end with


‘rear’ end in queue?

‘•ß’ •øÚø¯ Á›ø\°À ‘¤ß’ •øÚ²hß


GÆÁõÖ ÷ÁÖ£kzxÁx?
6. Define : Multiple stacks.
Áøμ¯ÖUP : £» AkUSPÒ.

7. Mention two different kinds of linked list.

Cμsk öÁÆ÷ÁÖ ÁøP¯õÚ CønUP¨£mh


£mi¯ø»U SÔ¨¤hÄ®.

8. What is meant by a dynamic data structure?

øhÚªU uμÄ Pmhø©¨¦ GßÓõÀ GßÚ?

9. Why binary tree is named as a special tree?

ø£Ú›©μ® Hß ]Ó¨¦ ©μ® GßÖ ö£¯›h¨£mhx?

10. What is the degree of the leaf node in a tree?

©μzvÀ Cø» •øÚ°ß AÍÄ GßÚ?

11. What is the purpose of graph traversal?

Áøμ£h¨ £¯nzvß ÷|õUP® GßÚ?

12. How can you differentiate a spanning tree with a


tree?

£μ¢x ›¢xQhUS® ©μzøu J¸ ©μzxhß G¨£i


÷ÁÖ£kzxÁx?

2 62528/BS23B
PART B — (5  5 = 25 marks)

Answer any FIVE questions.

13. What is a primitive data type? How it differs from


non-primitive data type?
£Çø©¯õÚ uμÄ ÁøP GßÓõÀ GßÚ? Cx
£Çø©¯õÚx AÀ»õu uμÄ ÁøPP°¼¸¢x
GÆÁõÖ ÷ÁÖ£kQÓx?

14. Write down the procedure for linear search in a


1–D array.

÷|›¯À ÷uh¾UPõÚ ö\¯À •øÓø¯ 1–D


Á›ø\°À GÊuÄ®.

15. Interpret different applications of a Stack.

AkUQß öÁÆ÷ÁÖ £¯ß£õkPøÍ ÂÍUPÄ®.

16. What does ‘rear’ signifies in a queue? If in a queue,


the ‘rear’ points to the ‘front’, what is the queue
called?

Á›ø\°À ‘¤ß¦Ó®’ Gߣx GøuU SÔUQÓx? J¸


Á›ø\°À, ‘¤ß¦Ó®’ ‘•ß’ _miUPõmiÚõÀ, Á›ø\
GÆÁõÖ AøÇUP¨£kQÓx?

3 62528/BS23B
17. How can you delete an item from the singly linked
list? Explain with a diagram.

uÛzuÛ¯õP CønUP¨£mh £mi¯¼¼¸¢x J¸


E¸¨£iø¯ GÆÁõÖ }USÁx? ÂÍUP¨£hzxhß
ÂÍUPÄ®.

18. What is a binary tree? Describe the properties of a


binary tree.

ø£Ú› ©μ® GßÓõÀ GßÚ? ø£Ú› ©μzvß


£s¦PøÍ ÂÁ›UPÄ®.

19. Write a short note on “Minimum Spanning Tree”


with suitable example.

ö£õ¸zu©õÚ Euõμnzxhß “SøÓ¢u£m\ ›¢u


©μ®” £ØÔ¯ ]Ö SÔ¨ø£ GÊuÄ®.

PART C — (3  10 = 30 marks)

Answer any THREE questions.

20. Explain the following terms and their purpose in


data structure

(a) Simple data structure

(b) Compound data structure.

4 62528/BS23B
[P.T.O.]
uμÄ Pmhø©¨¤À ¤ßÁ¸® Âv•øÓPÒ ©ØÖ®
AÁØÔß ÷|õUPzøu ÂÍUSP.

(A) Gί uμÄ Aø©¨¦

(B) Tmk uμÄ Aø©¨¦.

21. Convert (A *(B+((C+D) * (E+F)) /G)) *H to postfix


notation.

©õØÖP (A *(B+((C+D) * (E+F)) /G)) *H


÷£õìmL¤Uì BP.

22. Illustrate the process of pushing an element in


linked-stack with appropriate diagram.

ö£õ¸zu©õÚ Áøμ£hzxhß CønUP¨£mh


AkUQÀ J¸ EÖ¨ø£z uÒЮ ö\¯À•øÓø¯
ÂÍUPÄ®.

23. Explain the following terminologies in a Tree :

(a) Parent node

(b) Child node

(c) Root node

(d) Sibling.

5 62528/BS23B
J¸ ©μzvÀ ¤ßÁ¸® ö\õØPøÍ ÂÍUSP :
(A) Parent node
(B) Child node
(C) Root node
(D) Sibling.

24. Differentiate BFS (Breadth First Search) with


DFS (Depth First Search).
BFS (AP»® •uÀ ÷uhÀ) DFS (BÇ® •uÀ
÷uhÀ) Ehß ÷ÁÖ£kzuÄ®.

________________

6 62528/BS23B

You might also like