Scribd
Upload
8 views2 pages

Data Structure 1

This document outlines an examination paper for a Data Structures course, including instructions for answering questions and a breakdown of topics covered in each unit. It features a compulsory question and a variety of topics such as stacks, queues, linked lists, binary trees, sorting algorithms, and graph theory. The paper is structured to assess students' understanding of key concepts and algorithms related to data structures.

Uploaded by

Gaurav Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
8 views2 pages

Data Structure 1

This document outlines an examination paper for a Data Structures course, including instructions for answering questions and a breakdown of topics covered in each unit. It features a compulsory question and a variety of topics such as stacks, queues, linked lists, binary trees, sorting algorithms, and graph theory. The paper is structured to assess students' understanding of key concepts and algorithms related to data structures.

Uploaded by

Gaurav Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Roll No. Total Pages : 3 MCA-IM-16 10763 DATA STRUCTURES Paper : CS-DE-13 Time : Three Hours} {Maximum Marks : 80 Note : Attempt five questions in all, selecting one question from each unit. Question No. 1 is compulsory. Compulsory Question 1. Answer the following questions in brief : (@) Discuss few applications of Stack. 16 (b) Write the formula to calculate address of an element in two-dimensional Array. (©) Cana string be stored in an Array ? Discuss. (@_ Explain the applications of Linked List. (©) Discuss the limitations of Linear Queue. (What is a Full binary tree and Complete binary tree? (g) What are Directed Graphs? (h) Explain Heap Sort. UNIT-1 2. What do you understand by data structure? How can you classify data structures? Explain major operations that can be applied on data structures, 16 10763/1,100/KD/599 [P-T.0. (@) What is a String? Explain various operations that can be performed on strings. 8 (b) What is a Sparse matrix ? How can you store a sparse matrix using linear array ? Explain. 8 ‘UNIT=I (@ Write an algorithm to search an element from a given linked list. 8 ) Dies ee Ye ces deleting an element in a queue. equeue and Priority Queue. Discuss the of priority queue, 6 (b) What is a Stack? How stack can be represented in ‘computer? Explain various operations that can take place ee a algorithms. UNIT-I1 (@) Define Recursion. Write a recursive algorithm to find factorial of a number. 8 (b) Write the algorithm for Quick Sort and explain it with the help of an example. 8 1. (a) Explain various methods of representation of a binary tree along with their advantages and disadvantages. 8 (b) How do you create a Binary Search Tree? Also explain how to delete an element from a BST. 8 10763/1,100/KD/599 2 8. UNIT-IV Write Warshall's algorithm for finding the shortest path in ‘graph. Explain the algorithm with the help of suitable example. 16 ). (a) Explain selection sort and bubble sort using suitable examples. 10 (6) Explain Adjacency matrix and Path matrix. ~ 6 10763/1,100/KD/599 EB:

You might also like