Scribd
Upload
2 views

Data Structure Algorithms pdf-BTETOE704C

The document outlines the details for the Winter Examination-2023 for the B. Tech course at Dr. Babasaheb Ambedkar Technological University, focusing on Data Structures & Algorithms using Java Programming. It includes instructions for students, the exam date, duration, and a breakdown of questions with their respective marks and course outcomes. Students are required to solve various questions related to data types, algorithms, and data structures.

Uploaded by

omkar kashid
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Data Structure Algorithms pdf-BTETOE704C

The document outlines the details for the Winter Examination-2023 for the B. Tech course at Dr. Babasaheb Ambedkar Technological University, focusing on Data Structures & Algorithms using Java Programming. It includes instructions for students, the exam date, duration, and a breakdown of questions with their respective marks and course outcomes. Students are required to solve various questions related to data types, algorithms, and data structures.

Uploaded by

omkar kashid
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE


Regular & Supplementary Winter Examination-2023
Course: B. Tech. Semester : VII
Branch : Electronics Engg. / E & TC Engg. / Electronics and Communication Engg.
Subject Code & Name: (BTEXOE704C/BTETOE704C) Data Structure & Algorithms
using Java Programming
Max Marks: 60 Date:09-01-24 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. 12
A) Differentiate between primitive and non-primitive data types, providing CO1 6
examples of each.
B) Write a Java function to delete the last element from an array. CO3 6
C) Compare Big-O, Big-Theta, and Big-Omega notations. Provide examples to CO1 6
illustrate each.

Q.2 Solve Any Two of the following. 12


A) Explain the linear search technique. What are its advantages and CO2 6
disadvantages?
B) Explain the algorithm for pushing an element onto a stack and analyze its time CO4 6
complexity.
C) Describe the algorithm for enqueueing an element in a simple queue and CO4 6
analyze its time complexity.

Q. 3 Solve Any Two of the following. 12


A) Discuss the advantages and disadvantages of using a singly linked list over CO3 6
other data structures.
B) Provide algorithms for inserting a new node at the beginning and end of a CO3 6
circular linked list.
C) Write a Java program to reverse a singly linked list. CO3 6

Q.4 Solve Any Two of the following. 12


A) With suitable example explain the concepts of edges, root, parent, child, leaf, CO4 6
and depth in a tree.
B) Differentiate between a full binary tree and a complete binary tree. CO4 6
C) Define a B Tree and explain its properties. CO4 6
Q. 5 Solve Any Two of the following. 12
A) With suitable example explain the working principle of the Selection Sort CO5 6
algorithm.
B) What is hashing? Provide comprehensive explanation of its role in data storage CO5 6
and retrieval.
C) With suitable examples explain following graph terminologies. CO4 6
Vertices, Edges, and Degree.
*** End ***

You might also like