Scribd
Upload
10 views2 pages

CSE2001 B

Uploaded by

dbossabhi7
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
10 views2 pages

CSE2001 B

Uploaded by

dbossabhi7
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

Roll No

PRESIDENCY UNIVERSITY
BENGALURU

SCHOOL OF CSE & IS


END TERM EXAMINATION – SET B
Even Semester: 2023 - 24 Date: 06-08-2024
Course Code: CSE2001 Time: 09:30AM – 12:30PM
Course Name: Data Structures and Algorithms Max Marks: 100
Program & Sem: B.Tech IV Sem, 4EEE2 Weightage: 50%

Note: 1. Answer ALL 5 FULL Questions.


2. Each Full Question carries 20 Marks
3. Scientific and non-programmable calculator are permitted.
4. Do not write any information on the question paper other than Roll Number

1.a. Write the correct syntax of creating an array. (CO1) (04 Marks)
1.b. Write the insert and delete methods for Doubly Linked List. (CO1) (06 Marks)
1.c. Write the following methods dequeue(), queueSize(), display() for Queue using LinkedList.
(CO1) (10 Marks)
OR
2.a. Write isEmpty() function for Stack. (CO1) (04 Marks)
2.b. Explain the 5 operations in the Stack Abstract Data type. (CO1) (06 Marks)
2.c. Write the following methods isempty(), enqueue(), display() for Queue using LinkedList.
(CO1) (10 Marks)
3.a. Evaluate the following postfix expression 4 5 + 3 * 7 –. (CO2) (04 Marks)

3.b. Explain the different types of queues (CO2) (06 Marks)


3.c. Write the algorithm for the deletion at specific position in the circular singly linked list.
(CO2) (10 Marks)
OR
4.a. What is an Abstract Data Type. (CO2) (04 Marks)

4.b. Write the algorithm for converting infix expression to postfix expression. (CO2) (06 Marks)
4.c. Write the algorithm for the insertion at specific position in the circular singly linked list.
(CO2) (10 Marks)

Page 1 of 2
5.a. List two applications of Queue. (CO3) (04 Marks)
5.b. Explain with the help of an example insertion and deletion in a Binary Search Tree.
(CO3) (06 Marks)
5.c Write the following functions deleteFirst(), deleteLast() and display for Circular Singly Linked List.
(CO3) (10 Marks)
OR
6.a. List two applications of Stack. (CO3) (04 Marks)
6.b. Write methods for preorder, postorder and inorder traversal in a binary tree.
(CO3) (06 Marks)
6.c. Write the following functions insertAtFirst(), insertAtLast(), and display for Circular Singly Linked
List. (CO3) (10 Marks)

7.a. Write isEmpty() function for Queue. (CO4) (04 Marks)


7.b. Analyze the time complexity of Sequential Search. (CO4) (06 Marks)
7.c. Write the following functions isempty(), push(), and display() for Stack using LinkedList.
(CO4) (010 Marks)
OR
8.a. Evaluate the following postfix expression 4 5 + 9 * 3 + 3 /. (CO4) (04 Marks)
8.b. Analyze the time complexity of Binary Search algorithm. (CO4) (06 Marks)
8.c. Write the following functions pop(), peek(), and display() for Stack using LinkedList.
(CO4) (10 Marks)
9.a. What is a local variable and instance variable. (CO3) (04 Marks)
9.b. Write methods for insertion and deletion in a Binary Search Tree. (CO3) (06 Marks)
9.c. Explain Directed Graph and Undirected Graph with the help of examples. (CO3) (10 Marks)
OR
10.a. Write isFull() function for stack. (CO4) (04 Marks)
10.b. Explain the Theta, Big-Oh and Omega asymptotic notations (CO4) (06 Marks)
10.c. Analyze the time complexity of the Insertion Sort and Selection Sort. (CO4) (10 Marks)

Page 2 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy