Scribd
Upload
3 views

Data Structure and Algorithms using Java

The document outlines the supplementary examination details for the B. Tech. course in Electronics & Telecommunication at Dr. Babasaheb Ambedkar Technological University. It includes instructions for students, a breakdown of questions related to data structures and algorithms using Java, and the marking scheme for each question. The exam consists of various topics including data structures, asymptotic notations, stacks, queues, linked lists, and complexity analysis.

Uploaded by

omkar kashid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Data Structure and Algorithms using Java

The document outlines the supplementary examination details for the B. Tech. course in Electronics & Telecommunication at Dr. Babasaheb Ambedkar Technological University. It includes instructions for students, a breakdown of questions related to data structures and algorithms using Java, and the marking scheme for each question. The exam consists of various topics including data structures, asymptotic notations, stacks, queues, linked lists, and complexity analysis.

Uploaded by

omkar kashid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE


Supplementary Examination – Summer 2022
Course: B. Tech.

Branch: Electronics & Telecommunication Semester: V

Subject Code & Name: Data structure & algorithms using java
Programming (BTEXPE506C)
Max Marks: 60 Date: Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following.
A) Define data structure. Discuss the basic elementary operations on data 6
structure
B) Discuss asymptotic notations 6
C) Discuss basic terminologies of tree 6

Q.2 Solve Any Two of the following.


A) Discuss ADT as an stack 6
B) Discuss time space trade off 6
C) What is queue? State & explain types of queue 6

Q. 3 Solve Any One of the following.


A) Discuss linked list in detail 12
B) Compare & contrast stack & queue 12

Q.4 Solve following.


A) Compare complexity analysis of queue & linked lists 6
B) Discuss binary tree 6

Q. 5 Write a short note on


A) Searching 4
B) Sorting 4
C) hashing 4
*** End ***
The grid and the borders of the table will be hidden before final printing.

You might also like