Printed Pages : UID No.

……………………………

Mid Semester Test 2

Sample Paper
Program Name/Code : Bachelor of Engineering
Semester : 3rd
Subject : Data Structures
Time : 1 hour Maximum marks : 20
Instructions : Attempt all questions

Q.No. Statement CO mapping

Section A
5 x 2 = 10 marks
1 Differentiate between sequential and linked CO2
representation.
2 Explain why stack is recursive data structure. CO2
3 What is a linear linked list, and how does it store data in CO3
memory?
4 Given a circular queue with a size of 5 and the elements CO1
[1, 2, 3], what will be the state of the queue after two more
enqueues and one dequeue?
5 Write a recursive function to evaluate a postfix expression CO1
like "2354+".
Section B
2 x 5 = 10 marks
6 Write a C function to traverse and print all elements of a CO3
singly linked list. Explain the logic behind how traversal
works in a linked list.
7 What are the operations and applications of stack? CO4
Describe.
Printed Pages : UID No. ……………………………

Mid Semester Test 2

Sample Paper
Program Name/Code : Bachelor of Engineering
Semester : 3rd
Subject : Operating Systems
Time : 1 hour Maximum marks : 20
Instructions : Attempt all questions

Q.No. Statement CO mapping

Section A
5 x 2 = 10 marks
1 Explain briefly the concept of contiguous memory CO1
allocation.
2 Name to file management methods and briefly explain CO4
how they work.
3 Distinguish between paging and segmentation. CO2
4 What are page faults? How do they lead to page CO1
replacement?
5 What do you mean by context switching? State its CO2
importance.
Section B
2 x 5 = 10 marks
6 Explain the FIFO page replacement algorithm and use the CO3
following page reference string to explain the same :
5, 0, 1, 0, 2, 3, 0, 2, 4, 3, 3, 2, 0, 2, 1, 2, 7, 0, 1, 1, 0
7 Consider a reference string :5,8,6,1,7,9,8,6,3,10,9. CO2
The number of frames in the memory is 3. Find the page
faults w.r.t. Optimal Page Replacement Algorithm and
Least Recently Used(LRU) Page replacement algorithm.
Printed Pages : UID No. ……………………………

Mid Semester Test 2

Sample Paper
Program Name/Code : Bachelor of Engineering
Semester : 3rd
Subject : Statistics for Data Science
Time : 1 hour Maximum marks : 20
Instructions : Attempt all questions

Q.No. Statement CO mapping

Section A
5 x 2 = 10 marks
1 Differentiate between Binomial distribution and Bernoulli CO1
distribution.
2 Given the ranks of 6 students in two subjects as follows: CO3
Mathematics: 1, 2, 3, 4, 5, 6 and
Physics: 2, 3, 1, 5, 4, 6, calculate Spearman's rank
correlation coefficient.
3 Suppose on average 1 house in 1000 houses in a certain CO2
district has a fire during a year. If there are 2000 houses in
that district, what is the probability that exactly 5 houses
will have a fire during the year? (given that e-2 = 0.13534)
4 Explain what a regression line represents. CO1
5 On average, every one out of 10 telephones is found busy. CO3
Six telephone numbers are selected at random. Find the
probability that four of them will be busy.
Section B
2 x 5 = 10 marks
6 If in an industry there is a chance that 5% of the employees CO4
will suffer by corona. What is the probability that in a
group of 20 employees, more than 3 employees will suffer
from the corona?
7 Find Karl Pearson's coefficient of correlation between the CO5
values of X and Y for below given data:
Printed Pages : UID No. ……………………………

Mid Semester Test 2

Sample Paper
Program Name/Code : Bachelor of Engineering
Semester : 3rd
Subject : Discrete Mathematics
Time : 1 hour Maximum marks : 20
Instructions : Attempt all questions

Q.No. Statement CO
mapping
Section A
5 x 2 = 10 marks
1 CO1

2 Find the order and degree of the following recurrence relation CO3

3 CO2

What do you mean by cycles? For the above graph, find all
possible cycles.
4 How many different ways can you choose 3 flavors of ice CO3
cream from a menu of 8 flavors, assuming that the order of
selection does not matter?
5 Discuss with examples: Euler path and graph CO2
Section B
2 x 5 = 10 marks
6 Solve the following recurrence relation : CO2

7 Consider the undirected graph G where V(G) = {P, Q, R, S, T} CO5

and E(G) = {(P, Q), (P, R), (Q, R), (Q, S), (Q, T), (R, S), (R,
T), (T, S)}. Draw the Graph. Express above graph G by
adjacency matrix. Does G have any parallel edges. Find all
simple paths from P to T and all cycles in G. Find diameter of
G
Printed Pages : UID No. ……………………………

Mid Semester Test 2

Sample Paper
Program Name/Code : Bachelor of Engineering
Semester : 3rd
Subject : Database Management System
Time : 1 hour Maximum marks : 20
Instructions : Attempt all questions

Q.No. Statement CO mapping

Section A
5 x 2 = 10 marks
1 List out the drawback and limitations of using views. CO1
2 Explain the concept of normalization with its advantages CO3
and disadvantages.
3 Explain common security threats to a database system. CO2
4 Define BCNF and its significance. CO3
5 Explain with example the iterative statements, looping CO2
statements and sequential statements.
Section B
2 x 5 = 10 marks
6 Explain various types of dependencies such as functional, CO2
multi-valued, transitive dependency and how they can be
reduced.
7 Describe the concept of cursor. Differentiate between CO3
static and dynamic cursor.
Printed Pages : UID No. ……………………………

Mid Semester Test 2

Sample Paper
Program Name/Code : Bachelor of Engineering
Semester : 3rd
Subject : Agile Development Methodologies
Time : 1 hour Maximum marks : 20
Instructions : Attempt all questions

Q.No. Statement CO mapping

Section A
5 x 2 = 10 marks
1 List any two advantages of the Waterfall Model. CO1
2 What is Feature-Driven Development (FDD)? CO2
3 Explain the core principles of the Agile Manifesto and CO1
how they guide Agile development.
4 What is a "Sprint" in Agile Development? CO1
5 What are the roles in a Scrum Team and their CO3
responsibilities?
Section B
2 x 5 = 10 marks
6 What are the key differences between the V-Model and CO2
the Waterfall Model? Compare and contrast.
7 Describe the Agile framework and how it is different from CO3
traditional project management approaches