Scribd
Upload
43 views2 pages

Bca Part 2

This document appears to be an exam for a theoretical foundations of computer science course assessing knowledge of data structures. It contains 10 short answer questions assessing basic definitions of common data structures like arrays, linked lists, stacks, trees, etc. It also contains 5 short answer questions requiring short algorithms or explanations of data structure applications and concepts. Finally, it contains 5 long answer questions requiring more in-depth algorithms or explanations of sorting, searching, and traversing various data structures. The exam is out of 50 total points and assesses students' understanding of fundamental data structure concepts and ability to describe algorithms for common data structure operations.

Uploaded by

Sangita Harmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views2 pages

Bca Part 2

This document appears to be an exam for a theoretical foundations of computer science course assessing knowledge of data structures. It contains 10 short answer questions assessing basic definitions of common data structures like arrays, linked lists, stacks, trees, etc. It also contains 5 short answer questions requiring short algorithms or explanations of data structure applications and concepts. Finally, it contains 5 long answer questions requiring more in-depth algorithms or explanations of sorting, searching, and traversing various data structures. The exam is out of 50 total points and assesses students' understanding of fundamental data structure concepts and ability to describe algorithms for common data structure operations.

Uploaded by

Sangita Harmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

http://www.hyvonline.

com
Roll No...................... Total No. of Section : 03
Total No. of Printed Pages : 03

Code No. : B-413(A)


Annual Examination - 2017
BCA-II
BCA-201
THEORETICAL FOUNDATION OF COMPUTER SCIENCE
Paper - III
DATA STRUCTURE
Max.Marks : 50
Time : 3 Hrs. Min Marks : 20
Note :Section 'A' is objective type, containing 10 questions, is
compulsory. Section 'B' consists of short answer type
questions and Section 'C' consists of long answer type
questions. Section 'A' has to be solved first.
(Section-'A')
(Very short answer type questions. Answer in one or two
lines.) (1 x 10=10)
Q.1 What is data structure?
Q.2 Write the different opperations of Data structure.
Q.3 What is Sorting?
Q.4 What is Pointer?
Q.5 What is linked list?
Q.6 What is Stack?
Q.7 What is Tree?
Q.8 What is Record?
Q.9 What is Array?
Q.10 What is Merging?

P.T.O.
http://www.hyvonline.com
(2) Code No. : B-413(A) (3) Code No. : B-413(A)

OR
(Section-'B')
Explain the significance of Record data structure with an
( Short answer type questions with word limit 150-200) example.
(3 x5=15) Q.2 Write an algorithm to count the number of elements in a linked
Q.1 Write the different applications of Data Structure. list.
OR OR
Write an algorithm for inserting an element ITEM into the Kth Explain overflow and underflow condition in stack.
position of a linear array of N elements. Q.3 What are the operations that can be done on a Queue?
Q.2 Write an algorithm for finding the smallest element in an array OR
of N elements. What are the different ways in which stack can be represented?
OR Q.4 Explain the different types of traversing in a binary tree.
Write an algorithm for performing binary search of an element OR
in a linear array of N elements. Write an algorithm for inserting in a Binary tree.
Q.3 What is pointer? Explain the pointer with an example.
Q.5 Write an algorithm for Insertion Sort.
OR
OR
Write the signifiance of linked list with an example.
Write an algorithm for selection sort.
Q.4 Explain the different types of tree in brief.
OR
----x----
Explain the different types of traversing in a tree.
Q.5 What is merging? Explain with an example.
OR
Write an algorithm for sorting an linear array of N elements in
ascending order.
(Section-'C')
( Long answer type questions with word limit 300-350)
(5 x5=25)
Q.1 Write an algorithm for performing linear search of an element
ITEM in an array of N elements.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy