Scribd
Upload
52 views3 pages

CC05

The document is an examination paper for a BCA course with a duration of 3 hours and a total of 60 marks. It consists of two groups, with Group A being compulsory and requiring answers to specific questions about data structures and algorithms, while Group B allows candidates to choose three questions from a list. Topics include multidimensional arrays, linked lists, recursion, stacks, trees, hashing, and various search algorithms.

Uploaded by

rajaking9771
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
52 views3 pages

CC05

The document is an examination paper for a BCA course with a duration of 3 hours and a total of 60 marks. It consists of two groups, with Group A being compulsory and requiring answers to specific questions about data structures and algorithms, while Group B allows candidates to choose three questions from a list. Topics include multidimensional arrays, linked lists, recursion, stacks, trees, hashing, and various search algorithms.

Uploaded by

rajaking9771
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/ 3

COPYRIGHT RESERVED End Sem(lUl)-

BCA (CC5)

2021
Time: 3 hours

Full Marks: 60

Candidates are required to give their answers in


their own words as far as practicable.

The figures in the margin indicate full marks.

Answer from both the Groups as directed.

Group A

(Compulsory)
1. Answer the following questions 1x10 10
(a) What is multidimensional array?
(b) What is circular linked list ?
(c) Write the limitation of recursion.
(d) Why are stack useful ?
(e) Define push and pop operation of stack.

SQ-94/1 (Turn over)


( Define tree.

(g) What is hashing? and


difference
between stack
(h) Write the

queue
What is the need for hashing ?
)
non-linear data
Write the example of

structure.

understand by the term "data


2 What do you
5
structure"? Explain its usefulness.

Group B

following:
Answer any three questions of the
15x3 4 5

Postfix
3. Explain.what are Infix, Prefix and

expressions. Explain with example.

4. What are the differences between array and

linked list ? Explain single and doubly linked list


with figure.

5.
5. What is binary tree ? Explain different traversal
algorithms of binary tree.

SQ-94/1 (2) Contd.


linear and binary
6. Write the differences between

search. How binary search will be performed on


N represents any
given list of 'N' elements, where
number of elements ?

7. What is priority queue ? Explain the advantages

of queue.

sQ-94/1 (150) (3) End Sem(ll)-


BCA (CC-5)

You might also like