RAMRAO ADIK INSTITUTE OF TECHNOLOGY, NERUL

(D Y Patil Deemed to be University)

Program: FE (CSBS)
End Semester Examination: FY BTech Semester: II
Course Code: CSC203_Course Name: Datastructures & Algorithms
Time: 2 HOURS___
Max. Marks: 50 Marks

Instructions: 1. All three questions are compulsory

Note: Draw a Neat diagram wherever necessary

Que Question Max. CO BT

. Mark
No. s
Q1 Solve any Four
i) Define Time and Space Complexity. Describe various 5 CO1 BT2
notations used for Asymptotic Analysis with an appropriate
example?
ii) What are various techniques to represent array in the Memory 5 CO3 BT1
show with suitable example
iii) Write an algorithm and Apply Depth First Search (DFS) on a 5 CO5 BT3
graph shown below (show step by step). Consider starting
vertex as ‘A’

iv) Write an Algorithm and C program for searching an element 5 CO6 BT5
using Sequential (linear) Search
v) Explain Various types of file Organization. 5 CO2 BT1
vi) Apply Huffman Coding for the given sequence 5 CO4 BT3
“AABCCCDEEE” and show the Huffman code for each
symbol

Que Question Max. CO BT

. Mark
No. s
Q2 Solve any Four
i) Write a short note on B+ tree 5 CO4 BT2
ii) What is a Recursion? Explain Recursion function with an 5 CO1 BT1
suitable C program Example.
iii) Apply Linked list to evaluate Addition of following two 5 CO3 BT5
polynomials (Show with diagrammatic representation). Write
an algorithm for the same.
 RAMRAO ADIK INSTITUTE OF TECHNOLOGY, NERUL
(D Y Patil Deemed to be University)
Expression1: 5x4 + 8x3 + 3x2 + 5x1
Expression 2: -3x3 + 2x2 + 5x0
iv) Describe Various Queue Data Structures 5 CO3 BT2
v) Analyze the given orders and Construct a Binary Tree from 5 CO5 BT4
Post order and Inorder traversals
Post-Order: 9, 1 ,2, 12, 7, 5, 3, 11, 4, 8
In-Order: 9, 5, 1, 7, 2, 12, 8, 4, 3, 11
vi) Convert the given infix expression to postfix Expression 5 CO6 BT5
using stack and show the details of stack at each step of
conversion for the following Expression.
(V+W/X*(Y+X)–Z)

Que Question Max. CO BT

. Mark
No. s
Q3 Solve any One
i) Construct AVL tree by inserting the following data 10 CO4 BT6
50, 25, 10, 5, 7, 3, 30, 20, 8, 15
ii) What is Binary search method to search for specific element 10 CO6 BT5
in the given array. Search element 46 from the given array
using Binary search algorithm.
4, 10, 16, 24, 32, 46, 76,112, 114, 182.

======================================================================
=========
Course Outcomes (CO) -Learner will be able to:
CO1: Students will be able to understand and analyze the efficiency of algorithms and using
complexity theory.
CO2: Students will be able to apply and implement algorithms to create and manipulate records
using different file organizations
CO3: Students will be able to handle operations like insertion, deletion, searching and traversing
on linear data structures.
CO4: Students will be able to handle operations like insertion, deletion, searching and traversing
on non-linear data structures.
CO5: Students will be able to demonstrate the ability to analyze, design, apply and use data
structures to solve engineering problems and evaluate their solutions.
CO6: Students will be able to analyze and implement appropriate searching and sorting
techniques for a given problem.
--------------------------------------------------------------------------------------------------------------
BT1- Remembering, BT2- Understanding, BT3- Applying, BT4- Analyzing, BT5- Evaluating, BT6- Creating
RAMRAO ADIK INSTITUTE OF TECHNOLOGY, NERUL
(D Y Patil Deemed to be University)