FirstRanker.com
Code: 9F00105
Time: 3 hours
--- Content provided by FirstRanker.com ---
MCA I Semester Supplementary Examinations June/July 2018
DATA STRUCTURES
(For 2011 (LC), 2012, 2013, 2014, 2015 & 2016 admitted batches only)
Max. Marks: 60
Answer any FIVE questions
--- Content provided by FirstRanker.com ---
All questions carry equal marks
- What is a function? State the advantages of using a function.
- Write a C program to swap two numbers using pointers.
- Explain the insertion operation performed in circular linked list.
- Write a short note on sparse matrix manipulation and polynomial representation.
- How to represent stacks using linked list? Give the suitable example.
- Write a procedure to convert postfix to infix expression with a simple example.
- Explain about the queue operations with an example.
- Explain array representation of queues with an example.
- Explain with a simple example for:
- Bubble sort.
- Merge sort.
--- Content provided by FirstRanker.com ---
- Discuss in detail about the linear search with its algorithm and a simple example.
- Give a brief description about inverted tables.
- Explain various operations performed in the binary search tree in detail.
- Explain the insertion operation in B-tree.
- Write a short note on Min heap and Max heap with an example.
--- 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)