Roll No. ____________________ Total No. of Pages : 02
Total No. of Questions : 07
BCA (2014 to 2018) (Sem.-3)
--- Content provided by FirstRanker.com ---
DATA STRUCTURES
Subject Code : BSBC-302
M.Code : 10058
Time : 3 Hrs. Max. Marks : 60
INSTRUCTION TO CANDIDATES :
--- Content provided by FirstRanker.com ---
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains SIX questions carrying TEN marks each and a student has to attempt any FOUR questions.
SECTION-A
- Answer briefly :
- Write the use of pointers in data structure.
- What is FIFO in Queue?
- What is an array representation?
- Give introduction of sectors in storage device.
- Define the need of searching techniques.
- Discuss Garbage collection.
- Write basics of Priority queues.
- How does recursion work?
- Write concept of insertion sort.
- Give the applications of linked list.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
--- Content provided by FirstRanker.com ---
- What are steps involved in problem analysis? Write types of data structures and their applications?
- How Big-O Notation is used to analyze the algorithm in data structures? Show with example.
- How do we convert infix expressions to prefix expressions? Give example.
- Explain dynamic storage management. How it is done in data structures?
- What do you mean by Doubly Linked List? Write an algorithm to create a node in Linked List.
- Explain Binary tree representation. Give the syntax by taking an example.
--- 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