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 By: Girish Patil Member Level: Diamond Posted Date: 04 Mar 2008
|
2007 Baba Saheb Bhimrao Ambedkar University B.E Computer Science Data structure Question paper
|
|
|
Q-82
SECOND YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2007
DATA STRUCTURE
Total Marks: 100
Time: 3.00pm to 6.00pm
Instructions: 1) Attempt any three questions from each section.
2) Figures to right indicate full marks.
SECTION-1
Q.1. a) Write a program to implement Insertion and Deletion in doubly linked list.[Marks 8]
b) Explain an algorithm for merge sort.[Marks 8]
Q.2. a) Write a C program to implement Bubble sort on array of string.[Marks 8]
b) Explain linear search and Binary Search with an example.[Marks 8]
Q.3. a) Write a C program to implement insertion and deletion in a singly linked list.[Marks 8]
b) Explain the Radix Sort with an example. [Marks 8]
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 collision resolution technique in hashing.[Marks 8]
b) Explain Heaps, its operations and its application.[Marks 8]
Q.8. a) Write a ‘C’ program to Implement Insertion in a Binary Search Tree.[Marks 8]
b) What causes deletion of a node in a binary search tree more difficult than insertion? Explain with example.[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.
|
Watch TV Channels
Watch Asianet TV onlineKairali TV in InternetSurya TV onlineAmritha TV Channel
|