DEPARTMENT COMPUTER SCIENCE ENGINEERING

UNIVERSITY INSTITUTE OF ENGINEERING AND TECHNOLOGY CSIM UNIVERSITY.KANR

Discrete Mathematics (MTHS301) (GO,CSE2)

Semester:2022-2023( Even Semester) Year:2nd Year
(2K21)
End Semester Examination
Time:3hrs Maximum Marks:50
All questions are compulsory.

Section A

10 marks (Each question is of 1 mark)

1. (a) Draw a graph which is Hamiltonian but not Eulerian.
(b) Draw switching circuit of boolean expression rey + ry + )
(c) If (~ p Vg) V(p^ ~ ) = A, then what is A?
(d) Give an example of set H which is a subset of group G but is not its
-subgroup.
(e) Simplify (A n B)U (B - A).
(t) Is R= {(a,b) : la- b| =1 } where a. b e Z, antisy1nmetric ? Justifv.
(g) Write a cyclic group of order 7.
(h) Find truth value of ~P(%)P(%)] where P(*): '+1=0 and univers-N
(1) Draw a graph with 5 vertices of degree 1.1,2,3.
G) Does ({1,2,3.4,5),X6) form a group where X, is multiplicativ1
modulo 6?
(k) "Lattice is always a POSET ".Justify your answer.
Section B
20 marks (Each question is of 4 marks)
2. Let f: RR be defined by f(x) =x*. Find f(4)and f(4).
3. Let G={0,1,2,3,4,5}, Shów that (G,t6) is a cyclic group. Find all generators
of G.

1
4. Draw Hasse diagram of ({1, 2, 3,4, 5, 6, 9},/). Find greatest element and
maximal elements.
5. Using Warshall's algorithm fnd transitive closure of R ={(1,1).(2.1).(3 2). (3 1).
(4,1),(4,4),(1,4)}.
6. Show that RA (PVQ) is a valid conclusion from premises PvQ. QR.
P M and ~ M.
-Section G

20 marks (Each question is of 10 marks)

7. Draw the graphs of G and compliment ofG where Incidence matrix of G is
given below:
fo 1 1 1 0]
1 01 0 0
X(G)=|1 1 0 0 1
0000 1
0 0 01 0
(6) Are the graphs in (a) part self-complimentary'? Justify
8. (a) Express the Boolean expression (ry +rz)' + in conjunctive nornal
form.(DO NOT use truth table).
(b) Using Dijkstra's algorithm find shortest path from vertex a to vertex f for
graph below:

Z 5

36

2'5
 Department of CSE

University Institute of Engineering and Technology, CSJM University, Kanpur

Engineering Economics (HSS-S401)-CSE2
Semester: 2022-23 (Even Semester)
End-Semester Examination

(2K21 Batch)
Time: 3h

Maximum Marks: 50

All questions are compulsory

Section A
10 marks (Each question carries one mark)
Correct the following:
11. Intermediary goods are included in the calculation of GDP of a country
12. In the long run total cost is a combination of fixed cost and variable cost.
13. A surplus budget causes an increase in money supply in the economy
14. High inflation along with high rate of unemployment is known as stagflation.
15. Non pricing strategy is important in perfectly competitive market.
Fill in the blanks:
16. A low cost firm can be a leader in market
17. Consumer's utility is measured by Curve

18. The price at which quantity demanded fall to zero is called

19. In India-- has the power to control money supply in the economy
proportionate
20. In decreasing returns to scale, the proportionate change is output is
change in input.
Section -B

20 marks (Each question carries 4 marks)

Explain the following with suitable diagrams

5. Price rigidity in oligopoly market

6. Super normal profit earned by a monopolist in the short-run
7. Three sector model in the context of circular flow of income
8. Consumers equilibrium in ordinal utility analysis
Section-C

20 marks (Each question carries 10marks)

approached used to
3. What do you understand by GDP of a country? Explain the three different
measure NY of a country.
twO
4. What is the difference between demand -pull inflation and cost push inflation? Discuss
important measures to correct demand-pull inflation ina country.
 Department of Computer Science and Engineering
University Institute of Engineering and Technology, CSJM University, Kanpur
Computer Organization (CSE-S205) - CSE 1
Semester: Ivth Year: nd
End Semester Examination
Time: 3 Hour M.M.:50
All Questions are compulsory
Section A

Note: In this section, each question carries 1 mark.

1. Why low level programmings are more difficult compare to high level programming?
2.. What is the main advantage of virtual memory?
3. How many flip flops are required to construct RAM of size 4Mx16?
4. How many address,data and control lines are required to access RAM of previous
question?
5. What are locality reference phenomena?
6. What is the need of cache memory in digital computers?
7. Write Boolean expression for match logic of associative memory.
8. Explain writing mechanism of magnetic memory. How it is different from optical
memory?
9. How many pins are needed for the IC package of 1024x8 ROM that has four chip
selection inputs and operates from a 5,volt power supply?
10. Draw circuit of 4 bit bi directional shift register.
Section B

Note: In this section, each question carries 4 marks.

11. What do you mean by ALU? Implement ALU circuit of Computer1.

12. Find control logic of BUS selections (S;S;So) of Computer 1.
13. An instruction at address 021 in computer 1 has I=0, an operation code of AND
instruction,and an address part equal to 083 (all numbers in hexadecimal). The memory
word at address 083 contains the operand B8F2 and the content of AC is A937. Go over
the instruction cycle and determine the content of PC, AR, DR, AC and IR at the end of
execute phase. Repeat the problem six more times starting with an operation code of
another memory referenced instructions.
14. Draw set/ reset logic of all seven flip flops in Computer1.
15. What do you mean by interrupt? Write micro-operations of interrupt cycle in
computer1.
 SectionC
Note: In this section, each question carries 10 marks.
16a. Write micro subroutines for instructions used in computer 2.
16b. Design circuit of control unit to initiate different micro-operations of Computer 2.
17a. Implement circuit of micro-program sequencer for control memory of Computer2.
17b. Suppose that we change ADD subroutine of Computer 2, new microinstructions for ADD
instruction is as follows.

ADD:

ReadI Call INDR2

Add U Jmp Fetch

What should be subroutine INDR2?

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
University Institute of Engineering and Technology, CSJ.M. University Kanpur

Operating System (CSE-S206)

Even Semester- 2023
(CSE-2) Year: 2year (2K21)

End semester Examination

Time: 3hr
Maximum Marks: 50
Note: AlIl questions are compulsory.
SECTIONA
Each question carries 1 mark

1. Time duration required for scheduling dispatcher to stop one process and start another is known as
a) process latency c) execution latency
b) dispatch latency d) interrupt latency

2. What is a Process Control Block?

a) Process type variable c) A secondary storage section
b) Data Structure d) A Block in memory

3. Asituation where several processes access and manipulate the same data concurrently and the outcome of
the execution depends on the particular order in which access takes place is called
a) data consistency c) aging
b) race condition d) starvation

4. When the valid - invalid bit is set to valid, it means that the associated page
a) is in the TLB c) is in the process's logical address space
b) has data in it d) is the system's physical address space

5. The is used as an index into the page table.

a) frame bit c) page offset
b) page number d) frame offset

6. Swapping be done when a process has pending /0, or has to execute /0 operations only into
operating system buffers.
a) must never c) can
b) maybe d) must

7. A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait
condition can never exist.
a) operating system c) system storage state
b) resources d) resource allocation state

8. In a timeshare operating system, when the time slot assigned to a process is completed, the process
switches from the current state to?
a) Suspended state c) Ready state
b) Terminated state d) Blocked state
 9. Whenever a process needs (/0 to or from a disk it issues a
a) system call to the operating system c) system call to the CPU
b) a special procedure d) all of the mentioned

10. The address loaded into the memory address register of the memory is referred to as
a) Physical address c) Neither physical nor logical
b) Logical address d) None of the mentioned

SECTION- B
Each question carries 4marks
11. Give the structure of Process Control Block and discuss the various informations of PCB which is associated
with a specific process.
12. Consider the following snapshot ofa system
Allocation Max Available
ABCD ABCD ABCD
Po 0012 0012 1520
P: 1000 1750 2356
P: 1354 2356
P: 0632 0652
Pa 0014 0656

a) What is the content of matrix Need?

b) Is the system in a safe state?
c If the request from process P1 arrives for (0,4,2,0) can the request be granted immediately?
13. Discuss the differences in the degree to which the following scheduling algorithms discriminate in favor of
short pro cesses. Explain your answer. a) FCFS b) RR c) Multilevel feedback queues.
14. Explain the term (race condition' associated with cooperative processes. Discuss Peterson's algorithm to
solve the critical section problems.
15. Consider the reference string 2,3, 2 ,1, 5, 2,4, 5, 3, 2, 5, 2. How many page faults occur for Second Chance
page replacement algorithm? Assume there, are three available frames. Show each stepS
properly.,L
Selal uexarnpe
SECTION-C
Each question carries 10 marks

16. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a
request at cylinder 143 &previous request was at clinder 125. The queue of pending requests, in FIFO order
is: 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance that the disk arm moves to satisfy all the
pending requests for each of the following disk scheduling algorithms?
a) FCFS b) SSTF c) SCAN d) LOOK e) C-SCAN
17.
a) Ashared variable x, initialized to zero, is operated by four processes A, B, C, D. Process A& Bincrement x
by one while C&D decrement x by two. Each process performs wait and signal operation. If semaphore
'S' is initialized to two, find what is the minimum possible value of x after all
processes complete
execution. Explain your answer.
b) Explain the term race condition' associated with cooperative processes. Discuss Peterson's
algorithm to
solve the critical section problems.
 DEPARTMENT OF COMPUTERSCIENCE & ENGINEERING
UNIVERSITY INSTITUTE OF ENGINEERINGAND TECHNOLOGY, CSJM UNIVERSITY, KANPUR

OBJECT ORIENTED PROGRAMMING USING JAVA (CSE-S-204) CSE2

Semester: 2022-23 (Even Semester) Year: 2nd Year (2K21)
End Semnester Examination
Time: 3h Maximum marks: 50
PLEASE NOTE:Alquestions are compulsory
Section A
(10 questions of Imark each) [10X1=10]
Q1.Mention any two differences between abstract Class and Interface.
Q2.Write any two applications of static keyword.
Q3.Give an example of overriding in java.
Q4.Write name of any two functions of String class
Q5.Explain Syntax of interface in java
Q6.Explain any two applications of inheritance in java
Q7.Write any two properties of abstract class
Q8.Write any two built-in class also explain two functions
Q9.Explain any two applications of while loop
Q10.Write any two differences between public class and final class
Section B

(5 questions of 4 marks each) [5X4-20]

Q11. Explain Strings in java. Write a program to read a string and print it in reverse order.
Q12.Explain method overloading , also write a program for it.
Q13.Explain any three keywords used in Exception Handling
Q14.Explain any three conditional statements used in java
Q15.Explain application of super keyword by using program.
Section C(2 questions of 10 marks each) [2X10]
16.(a)Differentiate abstract class and interface ,Also explain syntax and application of each
16.(b)Explain different types of inheritance .Write a program for any one type of inheritance.
17.(a) Explain in brief
) Differentiate static and final keyword (ii)Access specifiers
17.(b)Create a class stock which contain two member variables [stockl d(String),quantity (int)] ,
.Write aprogram to generate an Exception if quantity i_ less than 5000.Also handle the Exception.