Data Struct
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Data Struct as PDF for free.
More details
- Words: 254
- Pages: 2
480 B. E. (Comp. Engg.) IIIrd Semester (New Scheme) Examination DATA STRUCTURES Paper-CSE-20S-C Time allowed: 3 houn
Maximum Marks: 100
Note: Attempt any five questiolls. A/I questiolls cany equaL marks.
1.
(a) Define data structures. Describe user-defined data
types with their importance and uses.
10
(b) List and explain various operations on ordered list. 2.
10
Describe the following with reference to arrays: (i) Lower and upper bound (ii) Multi-dimensional array (iii) Addressing an element
20
(iv) Sparse Matrix. 3.
(a) Develop an algorithm for applying push m:d pop (b) Explain two important applications of stack in computer science briefly. 10
4.
(a) Describe various operations on linear queue with examples.
IO
(b) Differentiate between linear and circular queues with their relative merits and demerits. 480-800-P2-(Q-8) (03)
]0 PT.O.
5.
( 2 ) 6.
Describe the use, purpose and importance of following operations on doubly linked list: (i)
getnode
(ii) freenode (iii) deletenodc (iv) insertleft (v) insertright. 6.
(a) How trees are used to represent postfix and prefix expressions? Explain briefly with examples.
2 0 10
(b) Describe following types of Binary tree traversals with examples : (i) Infix
(ii) Postfix (iii) Prefix.
7.
8.
1 0
(a)
Explain the use and importance of minimum spanning tree with an example. 10
(b)
Explain the following: (I)
Depth First Traversal in a graph
(ii)
Spanning Forests.
(a)
Develop an algorithm to implement Quick sort. Also discuss its complexity.
(b)
10
Discuss the following with their complexity: (i)
Bubble sort
(ii) Binary search.
480-800
10
10
Maximum Marks: 100
Note: Attempt any five questiolls. A/I questiolls cany equaL marks.
1.
(a) Define data structures. Describe user-defined data
types with their importance and uses.
10
(b) List and explain various operations on ordered list. 2.
10
Describe the following with reference to arrays: (i) Lower and upper bound (ii) Multi-dimensional array (iii) Addressing an element
20
(iv) Sparse Matrix. 3.
(a) Develop an algorithm for applying push m:d pop (b) Explain two important applications of stack in computer science briefly. 10
4.
(a) Describe various operations on linear queue with examples.
IO
(b) Differentiate between linear and circular queues with their relative merits and demerits. 480-800-P2-(Q-8) (03)
]0 PT.O.
5.
( 2 ) 6.
Describe the use, purpose and importance of following operations on doubly linked list: (i)
getnode
(ii) freenode (iii) deletenodc (iv) insertleft (v) insertright. 6.
(a) How trees are used to represent postfix and prefix expressions? Explain briefly with examples.
2 0 10
(b) Describe following types of Binary tree traversals with examples : (i) Infix
(ii) Postfix (iii) Prefix.
7.
8.
1 0
(a)
Explain the use and importance of minimum spanning tree with an example. 10
(b)
Explain the following: (I)
Depth First Traversal in a graph
(ii)
Spanning Forests.
(a)
Develop an algorithm to implement Quick sort. Also discuss its complexity.
(b)
10
Discuss the following with their complexity: (i)
Bubble sort
(ii) Binary search.
480-800
10
10
Related Documents
Data-struct
November 2019 20
Data Struct
November 2019 29
Data Struct 2004
November 2019 15
Data Struct Dec 2002
November 2019 19
Data Struct 2003
November 2019 12