0% found this document useful (0 votes)
9 views1 page

BCA 3RDData Structure2021

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
0% found this document useful (0 votes)
9 views1 page

BCA 3RDData Structure2021

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/ 1

E-3917

B. C. A. (Part - III) EXAMINATION : 2021


(New Course)
Paper Fifth
Data Structure
(305)
Time : Three Hours ] [ Maximum Marks : 80
Note :-All questions are compulsory. Attempt any two (2) questions from each unit. All questions carry
equal marks.
UNIT -1
1. Explain the basic terminologies of Data Structures.
2. Explain the concept of complexity and time-space tradeoff of algorithms.
3. Explain Data Structure operations.
UNIT -2
1. What are records? When we use records explain with example.
C

2. Explain concept or Multi dimensional arrays.


g

3. Explain pointers in Data Structures & How and why they are used.
U
ni
ve

UNIT -3
rs

1. What is linked list? How can we search an element in a linked list explain with an example.
ity

2. What do you understand by a stack? Describe Stack operations.


U
ns

3. What are Queues? Explain how queues are processed using a simple example.
ol

UNIT -4
ve
d

1. What are Binary Trees? Explain the terminologies related with Binary Trees.
Pa

2. Explain Threading in Trees with examples.


pe

3. What is a Binary Search Tree? Explain with an example.


rs
Ap

UNIT -5
k

1. Describe selection sort.


2. Define Binary Search. Explain how Binary search works with suitable example.
3. Describe the concept of hashing.

***

You might also like