Roll No. || HEEEEEEE Total No. of Pages : 02
Total No. of Questions : 16
--- Content provided by FirstRanker.com ---
BCA (2014 to 2018) (Sem.-3)
DATA STRUCTURES
Subject Code : BSBC-302
M.Code : 10058
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains SIX questions carrying TEN marks each and students have to attempt any FOUR questions.
SECTION-A
Answer briefly :
--- Content provided by FirstRanker.com ---
- Define Big O notation.
- What is meant by an array?
- Name any two operations performed on stacks.
- List two benefits of linked lists over array.
- What is meant by record?
- Name the complexity of binary search.
- Define Polish notation.
- What is Recursion?
- What is meant by binary tree?
- Comment on dynamic storage management.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
- a) What is meant by problem analysis? Explain.
b) Explain the term “Time Space Trade-off”. - a) Discuss the steps for linear search algorithm.
--- Content provided by FirstRanker.com ---
b) Write an algorithm for insertion sort. - What is meant by stack data structure? Write a C program to demonstrate Push and Pop operations.
- Explain the concept of recursion by taking some suitable examples.
- a) Discuss the insertion and deletion for circular linked list.
b) What are priority queues? Explain. - a) Explain the inorder traversal of binary tree.
b) Discuss different applications of tree data structures.
--- Content provided by FirstRanker.com ---
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU BCA Last 10 Years 2011-2021 Previous Question Papers