Data Struct 2003
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 2003 as PDF for free.
More details
- Words: 307
- Pages: 2
Roll No .................................. .
480/2003 B. E. EXAMINATION (Third Semester)
COMPUTER ENGINEERING CSE-205-C' Data Structure Time: Three Hours Maximum Marks: toO Note : Att.empt any Five questions. AIl questions carry equal marks. Before answering the question-paper candidates should ensure that they have been supplied to correct and complete question-paper. Complaints in this regard, if any, will not be entertained after the examination. 1. (a) Differentiate between built-in and user-defined data types with their relative advantages and
10
10
examples. 20
10
4&Q/2.00'30
disadvantages. 10
of linkyd lists with their relative advantages and
(b) Distinguish between array and dynamic implementation
at any position in a doubly linked list. 10
5. (a) Develop an algorithm for inserting and deleting an element
. deletion operations on Ii circular queue.
(b)' Develop an algorithm for applying ins'eItion and
with their relative merits and demerits.
10
applications in Comput(~r Science in detail with suitable
Define Stack. Discuss its importance through various
4. (a) Differentiate between linear and circular queue
3.
arrays.
Two dimensional and Multi-dimensional
(ii) Structure and union data structures.
(i)
(b) Differentiate the following :
its importance through examples. 10
2. (a) Define sparse matrix. For what purpose is it used ? Explain
operations on it through examples.
(b) Define ordered list. List and explain the various
(b)
8. (a)
(b)
7. (a)
(b)
10
used ? Explian through an example. 10
Depth first traversal
Binary search
(ii) Merge sort.
(i)
Describe the following with their complexity :
its complexity. 10
Explain Heap sort with an algorithm. Also discuss
(ii) Transitive closure.
(i)
Describe the following with reference to graphs:
IS it
10
10
What is Minimum Spanning Tree ? For what purpose
and prefix expressions using trees. 10
Write short note on representation of infix, postfix
suitable examples of each.
6. (a) Explain the various binary tree traversals with
480/2003 B. E. EXAMINATION (Third Semester)
COMPUTER ENGINEERING CSE-205-C' Data Structure Time: Three Hours Maximum Marks: toO Note : Att.empt any Five questions. AIl questions carry equal marks. Before answering the question-paper candidates should ensure that they have been supplied to correct and complete question-paper. Complaints in this regard, if any, will not be entertained after the examination. 1. (a) Differentiate between built-in and user-defined data types with their relative advantages and
10
10
examples. 20
10
4&Q/2.00'30
disadvantages. 10
of linkyd lists with their relative advantages and
(b) Distinguish between array and dynamic implementation
at any position in a doubly linked list. 10
5. (a) Develop an algorithm for inserting and deleting an element
. deletion operations on Ii circular queue.
(b)' Develop an algorithm for applying ins'eItion and
with their relative merits and demerits.
10
applications in Comput(~r Science in detail with suitable
Define Stack. Discuss its importance through various
4. (a) Differentiate between linear and circular queue
3.
arrays.
Two dimensional and Multi-dimensional
(ii) Structure and union data structures.
(i)
(b) Differentiate the following :
its importance through examples. 10
2. (a) Define sparse matrix. For what purpose is it used ? Explain
operations on it through examples.
(b) Define ordered list. List and explain the various
(b)
8. (a)
(b)
7. (a)
(b)
10
used ? Explian through an example. 10
Depth first traversal
Binary search
(ii) Merge sort.
(i)
Describe the following with their complexity :
its complexity. 10
Explain Heap sort with an algorithm. Also discuss
(ii) Transitive closure.
(i)
Describe the following with reference to graphs:
IS it
10
10
What is Minimum Spanning Tree ? For what purpose
and prefix expressions using trees. 10
Write short note on representation of infix, postfix
suitable examples of each.
6. (a) Explain the various binary tree traversals with
Related Documents
Data Struct 2003
November 2019 12
Data-struct
November 2019 20
Data Struct
November 2019 29
Data Struct 2004
November 2019 15
Data Struct Dec 2002
November 2019 19