18 views

Uploaded by meenakshi more

- Anna Univ Syllabus for EIE 3rd to 8th Sem Syllabus -Www.annaunivedu.info
- IT
- Data Structures IndiaBix
- Data Structures Using C
- Data+structure+interview+Questions+and+Answers.pdf
- merge_04
- Entrance Examination (EE) for M Tech In
- CAP267 dsa.pdf
- 4.2 Advanced Classes
- Ccfaq[1]
- General Ledger Power Point Presentation
- aricent
- dsc
- DC (Common to ALL)
- Mca i and II Sem(Rest Paper)
- DATA Structure.pdf
- AZTEC Placement Paper | Freshers Choice
- C Questions
- EXAMPLES.docx
- SINGLY LINKED LIST (3).docx

You are on page 1of 4

*17330*

15162

3 Hours / 100 Marks

Instructions :

(1)

(2)

(3)

(4)

Seat No.

Illustrate your answers with neat sketches wherever necessary.

Figures to the right indicate full marks.

Assume suitable data, if necessary.

Marks

20

a) State the need of data structure. Write the operations performed using data structures.

b) Differentiate between Binary Search and Sequential Search.

c) Write the procedure for implementing stack using arrays.

d) Explain Queue Full and Queue Empty condition with suitable example.

e) Define dynamic memory allocation. State its importance.

f) Define the following with respect to tree :

i) Ancestor

ii) Depth

iii) Degree

iv) Path

g) Write algorithm to traverse graph using Depth First Search (DFS).

2. Attempt any four :

16

a) Write a program in C to sort the given numbers in descending order using selection sort.

b) Explain how stack can be used to reverse a list using suitable example.

c) State the disadvantage of linear queue. How to overcome disadvantage of linear queue ?

d) Write an algorithm to count number of nodes in singly linked list.

e) Draw binary search tree using following elements :

35, 15, 40, 7, 10, 100, 28, 82, 53, 25, 3

f) Define collision. How it is resolved ?

P.T.O.

17330

*17330*

[2]

Marks

16

a) Define internal and external sorting. Sort the following elements in descending order using radix

sort.

7, 103, 15, 10, 3, 25, 28, 67, 304, 36, 49, 84

b) Translate the following infix expression to its equivalent prefix expression.

(x + y)

( p q).

x = 2, y = 3, p = 6, q = 2.

c) Differentiate between tree and graph. Traverse the following tree in Inorder, Preorder and

Postorder.

16

b) Find location of element H by using binary search algorithm in the given list.

B

c) Explain the terms front and rear with relevance to queue. List the operations to be performed

at these ends.

d) Write the procedure to implement stack using linked list.

e) Describe binary tree representation.

f) Define the following terms in graph :

i) Source

ii) Isolated node

iii) Sink

*17330*

[3]

17330

Marks

16

i) Binary search

ii) Bubble sort

iii) Quick sort

iv) Linear search.

b) Explain working of quick sort with a suitable example.

c) State importance of top pointer in stack. Explain stack overflow and underflow.

d) With a neat sketch explain working of priority queue.

e) Give node structure for doubly linked list. Write advantages of doubly linked list over singly list.

f) What is hashing ? Explain mid square method using suitable example.

6. Attempt any two :

16

b) Draw expression tree for the following :

i) (6a3 4b2)3 (4c2 + 7b3 + 9c)4.

ii) (a2 + 2ab + b2)3 + (c2 2cd + d2)3.

i) Give adjacency matrix representation.

ii) Give adjacency list representation.

- Anna Univ Syllabus for EIE 3rd to 8th Sem Syllabus -Www.annaunivedu.infoUploaded bysudentsidea
- ITUploaded bykumudha
- Data Structures IndiaBixUploaded byRanjith M Kumar
- Data Structures Using CUploaded byVikram Rao
- Data+structure+interview+Questions+and+Answers.pdfUploaded byramashankar1h
- Entrance Examination (EE) for M Tech InUploaded bybankuchhabra
- CAP267 dsa.pdfUploaded byAmar Deep
- Ccfaq[1]Uploaded bysureshv
- merge_04Uploaded byJether Pactol Tero
- 4.2 Advanced ClassesUploaded byMert Gurtan
- General Ledger Power Point PresentationUploaded bykmkasanga
- aricentUploaded byyogibabe
- dscUploaded byprashanth10gm
- DC (Common to ALL)Uploaded byChindam Hari Prasad
- Mca i and II Sem(Rest Paper)Uploaded byVikas Mishra
- DATA Structure.pdfUploaded bywww.bhawesh.com.np
- AZTEC Placement Paper | Freshers ChoiceUploaded bypradeep544
- C QuestionsUploaded bypranee967
- EXAMPLES.docxUploaded byBrandy White
- SINGLY LINKED LIST (3).docxUploaded byUmma
- Q2Uploaded bysimrang31
- Cpds Previous Papers Questions 2012 HarshaUploaded byHarsha Vardhan
- Link List Program in cUploaded byJavian Campbell
- 19 Linked ListsUploaded byjokylove acero
- AnnualsUploaded byiamsayan03
- M.Sc. IT Pt.IUploaded byerbalvinder
- Data Structure and Algorithms (Tree)Uploaded bySanjay Gowd
- Data Structures Course AssignmentUploaded byProfvip Abotaleb
- POD_omENaUploaded byAnonymous XS9jAhY1pE
- Data Structure Lec28 HandoutUploaded byJʋŋaiɗ Aĸɓar

- 17301 (1)Uploaded bymeenakshi more
- 17331 (1).pdfUploaded bymeenakshi more
- 17333 (1).pdfUploaded bymeenakshi more
- 17333 (2).pdfUploaded bymeenakshi more
- 17301 (2).pdfUploaded bymeenakshi more
- 12178Uploaded byManoj Kavedia
- 17332.pdfUploaded bymeenakshi more
- 17332 (1).pdfUploaded bymeenakshi more
- 17331 (2).pdfUploaded bymeenakshi more
- 17332 (2).pdfUploaded bymeenakshi more
- 17330 (1).pdfUploaded bymeenakshi more
- 17331.pdfUploaded bymeenakshi more
- 17330 (2).pdfUploaded bymeenakshi more
- 17301.pdfUploaded bymeenakshi more

- eBook Duane - Data Structure in Java for the Principled ProgrammerUploaded byanon
- gcse-5Uploaded byPrashantBhattacharji
- csc121Uploaded byIvan Chiu
- Geeksforgeeks graphsUploaded byExtc Eng
- Study Guide FinalUploaded byshivambarca
- Divide and Conquer-3Uploaded bymdhuq1
- Algorithms and Application ProgrammingUploaded byGuruKPO
- Heap SortUploaded byAlexandru Shapovalov
- C++Uploaded bygabation
- Data Structures Made SimpleUploaded byRaghav Agrawal
- MCA2ndUploaded bysiri42
- Lab QuestionsUploaded bySiddarth Wekhande
- cs301MCQSBYMOAZUploaded byMuhammad Rameez Khalid
- Daa Lab ManualUploaded byshom11235
- Nuts and BoltsUploaded byVibhash Kumar
- 05 Sorting MethodsUploaded byamitfegade121
- CS GATE 15 Paper 01 NewUploaded byPraveen Sp
- Using Perl 6 DraftUploaded bySaurabh Singh
- A New Data Structure for Heapsort With Improved Number of ComparisonsUploaded byravg10
- scnditUploaded bySurya Kumar
- 4 Technology 2Uploaded byJed Achas
- 27253270 Computer Project for ISCUploaded byPankaj Kumar Bajpaee
- CcfaqUploaded byjmeasow
- Chapter 1Uploaded byMohammad Gulam Ahamad
- Practical 16 17Uploaded byRishabh Singh
- Adobe Interview _ Set 2 _ GeeksforGeeksUploaded byroheat09
- CS1252 – Design and Analysis of Algorithms.pdfUploaded byNaresh Babu Merugu
- Final SolUploaded byRaghu Vamsi Potukuchi
- Basic C language for interviews by swetankUploaded byJanmayjay Swetank
- CS350-CH03 - Algorithm AnalysisUploaded byAsha Rose Thomas