My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted Date: 04 Mar 2008 Posted By: Girish Patil Member Level: Platinum
|
2008 Dr. Bhim Rao Ambedkar University(Agra University) B.E Computer Science Data Structure Question paper
H-419
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2005
DATA STRUCTURE
Total Marks: 100
Time: 2.30pm to 5.30pm
Instructions: 1) Attempt any three questions from each section.
2) Figures to right indicate full marks.
SECTION-1
Q.1. a) Explain the differences between an ordinary tree and binary tree.[Marks 4]
b) Write an algorithm for detection of a node in binary tree.[Marks 8]
c) Explain HASH function.[Marks 4]
Q.2. a) Show the status of array after each step in sorting the following elements using heap sort:
95, 19, 44,8,32,75,25,65
b) Explain the following with suitable examples: [Marks 8]
1) Linear search
2) Binary search
Q.3. a) Suppose CLIST is a circular linked list in memory consisting of numerical values. Write algorithms for each of the following operations:[Marks 8]
1) Finding the numbers ‘NUM’ holding total number of even numbers in the CLIST.
2) Finding product ‘PRODS’ of numbers in the CLIST.
Q.4. Write a short notes on any two: [Marks 18=9*2]
1.Comparison of sorting methods.
2.Traversals techniques in binary trees.
3.AVL tree.
SECTION-2
Q.5. a) what is hashing? Explain open Hashing and Closed Hashing. [Marks 8]
b) Write a C program to implement searching of numbers in a table using Hashing technique.[Marks 8]
Q.6. a) what is a binary tree? Explain its traversal methods.[Marks 8]
b) Write a ‘C’ program to implement deletion of node in a binary tree.[Marks 8]
Q.7.a) Explain closed hashing and open hashing.[Marks 8]
b) Write an algorithm for insertion and deletion into binary search tree.[Marks 8]
Q.8.a) Explain Reheap-up and Reheap-down functions in heap.[Marks 8]
b) Compare B-Tree AND B+ Tree.[Marks 8]
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Advertise Here
|