JNTUA MCA 1st Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)
Code: 9F00105
MCA I Semester Supplementary Examinations May/June 2019
--- Content provided by FirstRanker.com ---
DATA STRUCTURES
(For 2009, 2010, 2011 & 2012 (LC), 2013, 2014, 2015 & 2016 admitted batches only)
Time: 3 hours Max. Marks: 60
Answer any FIVE questions
All questions carry equal marks
--- Content provided by FirstRanker.com ---
- Explain in detail about different types of arrays.
- How do we find out the particular item in the array with the help of formula? Explain with one example.
- What are the disadvantages of arrays?
- Explain the standard routine operations of stack with algorithms.
- What is the postfix expression of the equation ((L+M)*N—(0—-P)^(Q+R) with the precedence of %, ^ (left — right).
- Discuss queue operations.
- Explain the applications of queues.
- Explain the applications of priority queues.
- Explain the differences between single linked list and double linked list.
- Explain sparse matrix multiplication.
- Explain divide and conquer quick sort algorithm with tracing.
- Derive the complexity of bubble sort algorithm.
- What are the different types of collision resolution techniques? Explain any one of them.
- Explain binary search.
- What is a tree? Explain tree traversals with examples.
- Explain different types of binary tree traversals with examples.
- What is height balanced tree? Explain.
- Give a brief note on threaded binary trees.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUA MCA 1st Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)