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: ashish Member Level: Diamond Posted Date: 27 Dec 2007
|
2007 Mangalore University B.C.A DATA STRUCTURES Question paper
|
|
|
MODEL QUESTION PAPER
Credit Based Third Semester B.C.A Degree Examination
October/November
(New Syllabus)
DATA STRUCTURES BCA-303
Duration: 3 Hours Max. Marks: 80
Part-A
Any ten from Part- A
(2X10=20)
1. a) What is a data structure? Mention the various types of data structures.
b) What is an array? Give the formula to find the address of a particular
Location in the array.
c). What is a circular queue? How it differs from linear queue?
d). Give the postfix form of an expression: (a - b * c + d) / (e + f)
e). What is the time complexity of a linear search algorithm, binary search.
f). What is a doubly linked list?
g).Give the linked memory representation of a binary tree.
h). What is a sparse matrix?
i). Differentiate between terminal nodes and non-terminal nodes.
j) Mention any 2 application of linked list
k) What is a graph?
l) Mention any 2 application of stack.
Part-B
Note: Answer any one full question from each part
UNIT-1
2. a) What is a Stack? Explain various operations performed using stack with
Examples.
b). Write an algorithm to generate first ten Fibonacci numbers recursively.
c). What is recursion? How does it differ from iteration? (6+6+3)
OR
3. a) . Distinguish between
i) Primitive and Non-primitive data structure
ii) Array and list.
b) Write an algorithm to convert infix to postfix expression.
c). Write algorithms to insert and delete elements from a circular queue (4+5+6)
UNIT-II
4. a) Write an algorithm to return the maximum number in a linked list
b). What is a linear linked list? How do you perform insertion and deletion
operation such a list?
c). What is a linked list? Explain the different types of linked list with a neat
diagram (5+5+5)
OR
5. a). Write and explain an algorithm to search for an element in a linked list. b) Write and explain an algorithm to add a node to a doubly linked list.
c). Write an algorithm to implement queue using linked list. (5+5+5)
UNIT-III
6. a). Define the following terminologies
1) Node 2) Root 3) Siblings 4) level
5) leaf node
b).Write a recursive algorithm for Preorder and Postorder traversals of a binary tree.
c). How to represent the graph in memory? Explain in detail. (5+6+4)
OR
7. a). What is graph? Explain different types of graph.
b) The order of nodes of a binary tree in Preorder and Inorder traversal are as
under
Preorder: A B D G H C E F I K J Inorder : B G H D A E I C K F J .
Draw the corresponding binary tree.
c). Compare tree and graph. (5+6+4)
UNIT-IV
8. a). Write an algorithm to sort a list of numbers using Merge sort.
b) Write and explain an algorithm to search a list of numbers using sequential
search method.
c) Show the bubble sort steps for the following numbers.
25 10 72 18 40 11 32 9 (6+4+5)
OR
9. a). Describe the concept of binary search technique.
b). Write an algorithm to sort the elements using Quick sort.
c). Discuss the procedure and develop an algorithm to sort a list of elements
using SELECTION Sort technique (4+6+5)
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
|