Scribd
Upload
3 views

DSA_Assignment Questions

The document outlines assignment questions for the B.Tech in Computer Science & Business Systems program for the academic year 2024-2025, specifically for the Data Structures and Algorithms course. It includes unit-wise questions covering topics such as algorithms, asymptotic notations, stacks, queues, linked lists, and expression evaluations. Each question is associated with a specific course outcome and cognitive level, indicating the expected learning objectives.

Uploaded by

Santhosh Kumar S
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

DSA_Assignment Questions

The document outlines assignment questions for the B.Tech in Computer Science & Business Systems program for the academic year 2024-2025, specifically for the Data Structures and Algorithms course. It includes unit-wise questions covering topics such as algorithms, asymptotic notations, stacks, queues, linked lists, and expression evaluations. Each question is associated with a specific course outcome and cognitive level, indicating the expected learning objectives.

Uploaded by

Santhosh Kumar S
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SCHOOL OF COMPUTER SCIENCE AND ENGINEERING

B.Tech in COMPUTER SCIENCE & BUSINESS SYSTEMS (CSBS)


(Academic Year 2024-2025)
ASSIGNMENT QUESTIONS UNIT WISE
II Semester
Subject: Data Structures and Algorithms Code: 23CSBS201
SI. No Questions CO RBTL
UNIT-1
1 Define an Algorithm? Explain the specification of an algorithm. CO1 L2
2 Explain in detail the performance of the algorithm with an example. CO1 L2
3 Explain different types of Asymptotic notations. CO1 L2
4 Outline an algorithm to find the maximum element in a given array and
CO1 L2
find its complexity.
5 Write a program to find the factorial of n using recursion. CO1 L1
6 Write a pseudo code for summing of N natural numbers. CO1 L1
7 Briefly explain the followings:
CO1 L2
i) Data Abstraction ii) Refinement of coding
8 Determine Big-O notation for the following problems.
CO1 L3
i) Linear Search ii) Binary Search iii) Bubble sort
9 Determine Omega notation for the following problems.
CO1 L3
i) Linear Search ii) Binary Search iii) Bubble sort
10 Write a program to find the Fibonacci series of n number using recursion. CO1 L1
UNIT-2
1 Infer the postfix form for the expression A+B*C-D CO2 L2
2 Illustrate the application of stack with an example. CO2 L3
3 Demonstrate Push and Pop operation of Stack using array. CO2 L3
4 Illustrate the conversion of the following infix expression into postfix
CO2 L3
form: (a*b) +(c*d)/e-f
5 Outline the algorithm for converting infix expression to postfix
CO2 L2
expression? Explain with an example.
6 Illustrate evaluation of the following expression using:
CO2 L3
12 +3 *14 – (5*16) +7
7 Define array. Classify the different types of data structure. CO2 L1
8 Evaluate the expression (a+b)*c to postfix expression. CO2 L3
9 Write the code for the stack function isfull() and isempty() using array. CO2 L1
10 Explain the types of linked list with its representation CO2 L2
11 Explain the operation of queue with example CO2 L2

12 Explain Double ended queue (DEQUE) with example. CO2 L2


13 Write a C program to implement singly linked list CO2 L1
14 Write a C program to implement Queue using Array. CO2 L1
15 Evaluate the expression K+L-M*N+(O^P)*W/U to postfix. CO2 L3
16 Evaluate the expression K+L-M*N+(O^P)*W/U to prefix. CO2 L3
17 Outline the algorithm for the evaluation of a prefix expression. CO2 L2
18 Evaluate the prefix expression A+B*C-D/E^F using a stack with a=2,
CO2 L3
b=3, c=4, d=16, e=2 and f=3.
19 Evaluate the postfix expression A+B*C-D/E^F using a stack with a=2,
CO2 L3
b=3, c=4, d=16, e=2 and f=3.

Faculty In-charge
[Dr Santhosh Kumar S]

You might also like