Scribd
Upload
19 views

Internal End Sem Exam

This document is an exam paper for a Data Structures and Algorithms course. It contains instructions and 10 questions testing knowledge of topics like asymptotic notation, data types, linked lists, stacks, queues, trees, graphs and sorting algorithms.

Uploaded by

BCA SY 63 Aaditi Ranaware
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

Internal End Sem Exam

This document is an exam paper for a Data Structures and Algorithms course. It contains instructions and 10 questions testing knowledge of topics like asymptotic notation, data types, linked lists, stacks, queues, trees, graphs and sorting algorithms.

Uploaded by

BCA SY 63 Aaditi Ranaware
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

GENBA SOPANRAO MOZE COLLEGE OF ENGINEERING,

Balewadi-Baner, Pune- 411 045


Savitribai Phule Pune University Maharashtra, India
(UNDER FACULTY OF SCIENCE AND TECHNOLOGY)

Internal End Sem Examination – Oct/Nov 2023


MCA-FY (SEM-I)
Subject: Data Structures and Algorithms
MAX.Marks: 70 Date: 28/02/2023
Paper Code: [310902] Time: 10:00 am – 01:00pm
_________________________________________________________________________________________________

Instructions to the candidates:


1) Please check whether you have got right question paper.
2) Q. 1 and Q. 3 carry equal marks.
3) Q.2 and Q. 5 carry equal marks.
4) Figures to the right indicate full marks.

Section A

Q1) Solve the following. [06]

a) Define asymptotic notation- Big-O, Theta and Omega.


OR
What is data and explain basic data types?

b) What is the Concept of linked organization?

c) Explain in short Circular Queue, Deque, and Priority Queue.

Q2 )Attempt the following questions.

I] a) Define data structure. Explain Linear data structures using sequential organization. [05]

b) What is transpose of matrix ? Explain with example.


OR
What is Sparce matrix ? Explain with example. [04]

II] a) Differentiate between singly and doubly linked lists? Explain circular linked list with
it’s operations.

OR

Write a program to perform following operations on singly linked list: Create, reverse,
search, count and Display . [05]
b) Explain Application of linked list for representation and manipulations of polynomials.

OR

Write a program to add 1 to a given number represented as linked list. [05]

III] a) Write in brief Implementation of stacks using sequential and linked organization.

OR

Write in brief operations of stack with the help of example. [05]

b) What is queue? Write implementation of queue using Array. [05]

Section B
Q3) Solve the following. [06]

a) What is AVL tree.

b) What is Adjacency matrix and Adjacency list?

c) Differentiate between searching and sorting.

Q4)Attempt the following questions.

I] a) What is the Concept of nonlinear data structure? Explain BST in brief. [04]

b) Define tree and it’s basic terminologies. Explain algorithm for tree traversals. [05]

II] a) Write a note on Graph traversals - depth first and breadth first in brief with the help of suitable
example. [05]

b) What is Spanning tree? Write a note on Kruskal Algorithms.


OR
Implement minimum cost spanning tree algorithm. [05]
III] a) Explain with example types of sorting - Bubble sort, Insertion sort, Selection sort, Quick sort,
Heap sort, Radix sort.
OR
Write a program to implement Merge sort method. [05]

b) Explain terms Internal and external sorting. [05]

____________________________________________________________________

*************** ALL THE BEST ***************

You might also like