Gtu 4th It Question Paper

Seat No.: ________ Enrolment No.
___________
GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV(NEW) EXAMINATION – WINTER 2022
Subject Code:3140707 Date:15-12-2022
Subject Name:Computer Organization & Architecture
Time:10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Draw the block diagram of 4-bit combinational circuit shifter. 03
(b) Construct diagram of common bus system of four 4-bits registers with 04
diagram.
(c) What is the role of sequence counter(SC) in control unit? Interpret its 07
concept with the help of its three inputs using diagram.
Q.2 (a) List out names of eight main registers of basic computer with their 03
symbolic name and purpose.
(b) Summarize following addressing modes with example. 04
1) Implied mode 2) Register mode
(c) Which are the different phases of Instruction Cycle? Describe Register 07
transfer for fetch phase with its diagram.
OR
(c) Define: microinstruction; Identify different types of 16 bits instruction 07
formats for basic computer using figure.
Q.3 (a) Use BSA and BUN instruction with example and diagram. 03
(b) Criticize Three-Address Instructions and Zero address instruction with 04
common example.
(c) Describe how control unit determine instruction type after the 07
decoding using flowchart for instruction cycle.
OR
Q.3 (a) Prepare flowchart of CPU-IOP communication. 03
(b) Differentiate RISC and CISC architecture. 04
(c) What is cache memory? Interpret direct addressing mapping with 07
diagram.
Q.4 (a) Draw and criticize memory hierarchy in a computer system. 03

(b) Write an Assembly level program for addition of 50 numbers. 04
(c) Draw the flowchart of first pass of the assembler and explain working 07
of the same.
OR
Q.4 (a) Interpret the following instructions: INP, ISZ and LDA 03
(b) Write an Assembly level program to move one block of data to another 04
location.
(c) List out modes of transfer. Formulate direct memory access technique 07
in detail.
Q.5 (a) Summarize major hazards in pipelined execution. 03
1
(b) What is a data dependency conflict in instruction pipeline? 04
Recommend solutions for data dependency conflicts.
(c) Demonstrate four-segment instruction pipeline in detail 07
OR
Q.5 (a) Sketch Microinstruction code format. Quote BR and CD field in brief. 03
(b) Compare following terms: 04
1. Write through-cache and Write back cache.
2. Spatial locality and Temporal locality
(c) Elaborate flynn’s classification scheme with proper diagram. 07
*************
2
Seat No.: ________ Enrolment No.___________

BE - SEMESTER–IV (NEW) EXAMINATION – WINTER 2021
Subject Code:3140707 Date:03/01/2022
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
Marks
Q.1 (a) Explain three state buffers. 03

(b) Describe BUN and BSA memory reference instructions in detail. 04
(c) What is interrupt? Describe interrupt cycle with neat diagram. 07
Q.2 (a) Differentiate assembly language and machine language. 03

(b) What is the need of common bus? Draw common bus cycle. 04
(c) Write an assembly language program to find whether the given number 07
is prime or not.
OR
(c) Write an assembly language program to find factorial of the given
number.
Q.3 (a) Define followings: 03

1. Control Memory
2. Control Word
3. Control Address Register
(b) Draw the flowchart of first pass of the assembler and explain working 04
of the same.
(c) What is the significance of pipelining in computer architecture? Write 07
a note on instruction pipeline.
OR
Q.3 (a) What is address sequencing? Explain. 03
(b) Construct a 4-bit adder-subtractor circuit. 04
(c) What addressing mode means? Explain any three addressing modes in 07
detail with example.
Q.4 (a) Enlist the characteristics of RISC. 03

(b) Write a program to evaluate X = (a*b)/c+d in two address and three 04
address instruction formats.
(c) Draw neat and clean flowchart for divide operation. Explain with 07
example.
OR
Q.4 (a) Differentiate isolated I/O and memory mapped I/O. 03
(b) Describe pipeline conflicts. 04
(c) What is cache memory address mapping? Compare and contrast direct 07
address mapping and set-associative address mapping.
Q.5 (a) What is the importance of virtual memory? 03

(b) Explain multiport memory and crossbar switch with reference to 04
interconnection structures in multiprocessors.
1
(c) Assume a computer system uses 5 bit (1 sign + 4 Magnitude) registers 07
and 2’s complement representation. Perform multiplication of number
10 with the smallest number in this system using booth algorithm.
Show step-by-step multiplication process.
OR
Q.5 (a) What is cache coherence? Describe. 03
(b) A 4-way set-associative cache memory unit with a capacity of 16 KB 04
is built using a block size of 8 words. The word length is 32 bits. The
size of the physical address space is 4 GB. How many bits for the will
be required for TAG field?
(c) Which are the different ways to transfer data to and from peripheral 07
devices? Explain any one of them in detail.
2

BE - SEMESTER–IV (NEW) EXAMINATION – SUMMER 2021
Time:02:30 PM TO 05:00 PM Total Marks:70
Instructions:
Marks
Q.1 (a) State differences between hardwired control unit and 03
microprogrammed control unit.
(b) Explain register stack and memory stack. 04
(c) Show the contents of registers E, AC, BR, QR and SC during the 07
process of multiplying 11111 with 10101.
Q.2 (a) Write down RTL statements for the fetch and decode operation 03
of basic computer.
(b) Define pipelining. For arithmetic operation (Ai *Bi + Ci) with a 04
stream of seven numbers (i=1 to 7). Specify a pipeline
configuration to carry out this task.
(c) Write a program to evaluate the arithmetic statement: 07
A*B+C*D+E
i. Using an accumulator type computer.
ii. Using a stack organized computer.
OR
(c) A non-pipeline system takes to process a task. The same task 07
can be processed in a six segment pipeline with a clock cycle of
10ns. Determine the speedup ratio of the pipeline for 100 tasks.
What is the maximum speed up that can be achieved?
Q.3 (a) List down six major characteristics of RISC processors. 03
(b) Explain how (r-1)’s complement is calculated. Calculate 9’s 04
complement of 546700.
(c) Elaborate CPU-IOP communication. 07
OR
Q.3 (a) List and explain major instruction pipeline conflicts. 03
(b) Define RTL. Give block diagram and timing diagram of transfer 04
of R1 to R2 when P=1.
(c) Elaborate content addressable memory (CAM). 07
Q.4 (a) Explain memory hierarchy in brief. 03
(b) Draw and explain flowchart for first pass of assembler. 04
(c) Explain using a flowchart how address of control memory is 07
selected in microprogrammed control unit.
OR
Q.4 (a) Briefly explain DMA. 03
(b) Write assembly level program to subtract two given numbers. 04
(c) Write the symbolic microprogram routine for the BSA 07
instruction. Use the microinstruction format of basic
microprogrammed control unit.
1
Q.5 (a) How many AND gates and Adders will be required to multiply a 03
5 bit number with a 3 bit number? Also say size of adder (bits).
How many bits will be there in the result?
(b) What do you mean by cache memory? Justify the need of cache 04
memory in computer systems.
(c) Discuss multistage switching network with neat diagrams. 07
OR
Q.5 (a) Explain the non-restoring methods for dividing two numbers. 03
(b) Discuss source-initiated transfer using handshaking in 04
asynchronous data transfer.
(c) Elaborate cache coherence problem with its solutions. 07
*******************
2

Instructions:
MARKS
Q.1 (a) What is binary and decimal equivalent of F8 hexadecimal value? 03

(b) Write Steps for two n digit numbers subtraction in base r. 04
(c) List and explain Memory reference instructions in detail. 07
Q.2 (a) What is arithmetic micro operation? 03

(b) What is RAM and ROM? 04
(c) Draw and explain working of 4 bit binary adder. 07
OR
(c) State and Explain any seven logic micro operation. 07
Q.3 (a) List out Register for basic computer. 03

(b) Explain register reference instruction format. 04
(c) Explain register transfer using block diagram and timing diagram. 07
OR
Q.3 (a) Draw and explain control unit diagram for basic computer. 03
(b) State various phases of instruction cycle. 04
(c) Explain any four input output reference instruction. 07
Q.4 (a) Draw flowchart of first pass assembler. 03

(b) Write assembly language program to add two numbers. 04
(c) Write assembly language program to multiply two numbers. 07
OR
Q.4 (a) What is address sequencing? 03
(b) Write assembly language program to subtract one number from other 04
number.
(c) Explain booth’s multiplication algorithm with example. 07
Q.5 (a) Explain register stack. 03

(b) What is difference between two address and three address instructions? 04
(c) Write a note on asynchronous data transfer. 07
OR
Q.5 (a) What is difference between direct and indirect addressing mode? 03
(b) Explain arithmetic pipeline. 04
(c) Write a short note on virtual memory. 07
*************
1

Subject Name:Discrete Mathematics
Instructions:
Marks
Q.1 (a) A committee 5 persons, is to be formed from 6 men and 4 women. In how 03
many ways this can be done when (i) at least 2 women are included, (ii) at
most 2 women are included.
(b) If A  4,5, 7,8,10 , B  4,5,9 and C  1, 4, 6,9 , then verify that 04
A   B  C    A  B   A  C  .
(c) Define Functionally complete set of connectives, Principal Disjunctive 07
Normal Form (PDNF). Obtain PDNF for the expression
   p  q    p  q    q  r  
Q.2 (a) Define Partial Order Relation. Illustrate with an example. 03

(b) Define one – one function. Show that the function f : R  R , 04
f  x   3x  7 is one – one and onto both. Also find its inverse.
(c) Solve the recurrence relation an2  5an1  6an  2 with initial condition 07
a0  1 and a1  1 using method of undetermined coefficients.
OR
(c) Use generating function to solve a recurrence relation an  3an1  2 with 07
a0  1 .
Q.3 (a) Define Partition of a Set. Let A  1, 2,3, 4,5 and 03
R  1, 2  , 1,1 ,  2,1 ,  2, 2  ,  3,3 ,  4, 4  ,  5,5  be an equivalence
relation on A . Determine the partition for R 1 , if it an equivalence
relation.
(b) Draw Hasse Diagram for the lattice  S30 , D  where S30 is the set of 04
divisors of 30 and D is the relation divides.
(c)  a b 07
Show that the set S of all matrices of the form   where a, b  R is
 b a 
a field with respect to matrix addition and matrix multiplication.
OR
Q.3 (a) Define Semi Group, Monoid. Give an example of an algebraic structure 03
which is semi group but not monoid.
1
(b) Consider the a relation R defined on A  1, 2,3 whose matrix 04
representation is given below. Determine its inverse R 1 and complement
R' .
1 0 0 
M R  1 1 1 
0 0 1 
(c) Define free variable and bound variable. 07
Rewrite the following argument using quantifiers, variables and predicate
symbols. Prove the validity of the argument.
“All healthy people eat an apple a day.

Ram does not eat apple a day.
Ram is not a healthy person.”
Q.4 (a) Define Abelian group and prove that the set 0,1, 2,3, 4 is a finite abelian 03
group under addition modulo 5 as binary operation.
(b) Define even permutation. Show that the permutation 04
1 2 3 4 5 6 1 2 3 4 5 6
  is odd and   is even.
5 6 2 4 1 3 6 3 4 5 2 1
(c) Define Principal Ideal. Find all the principal Ideal of the ring 07
0,1, 2,3, 4,5 , 6 , 6  .
OR
Q.4 (a) Define cut vertex. List out all the cut vertices of the graph given in Figure 03
1.
(b) Define adjacency matrix and path matrix of a graph. Find out adjacency 04
matrix for the graph given in Figure 1.
(c) Define the terms: Simple Graph, Multi – Graph, Weighted Graph, Degree 07
of a vertex, in degree and out degree of a vertex. Illustrate each with an
example.
Q.5 (a) State Lagrange’s theorem and find out all possible subgroups of group 03
1, 1, i, i ,  .
(b) Define Eulerian graph, Planar Graph. 04
Justify whether the graph given in Figure 1 is Planer or not using Euler’s
formula.
(c) Define Binary tree, Spanning tree, Minimal Spanning tree, Find the 07
minimal spanning tree for the weighted graph given in Figure 2.
OR
Q.5 (a) Define Cyclic group, Normal subgroup. Illustrate with an example. 03
(b) Form a binary search tree for the data 16,24,7,5,8,20,40,3. 04
(c) Explain Post order traversal. Given the postorder and inorder traversal of 07
a binary tree, draw the unique binary tree.
Postorder: d e c f b h i g a
Inorder: d c e b f a h g i.
2
Figure 1 Figure 2
***************
3

Instructions:
Q.1 (a) Show that for any two sets 𝐴 and 𝐵, 𝐴 − (𝐴 ∩ 𝐵) = 𝐴 − 𝐵. 03

(b) If 𝑆 = {𝑎, 𝑏, 𝑐}, find nonempty disjoint sets 𝐴1 and 𝐴2 such that 𝐴1 ∪ 𝐴2 = 𝑆. 04
Find the other solutions to this problem.
(c) Using truth table state whether each of the following implication is tautology. 07
a) (𝑝⋀𝑟) → 𝑝
b) (𝑝⋀𝑞) → (𝑝 → 𝑞)
c) 𝑝 → (𝑝⋁𝑞)
Q-2 (a) Given 𝑆 = {1, 2, 3, − − − − ,10} and a relation 𝑅 on 𝑆. Where, 03
𝑅 = {〈𝑥, 𝑦〉|𝑥 + 𝑦 = 10} . What are the properties of relation 𝑅?
(b) Let 𝐿 denotes the relation “less than or equal to” and 𝐷 denotes the relation 04
“divides”. Where 𝑥𝐷𝑦 means “x divides y”. Both 𝐿 and 𝐷 are defined on the set
{1, 2, 3, 6}. Write 𝐿 and 𝐷 as sets, find 𝐿 ∩ 𝐷.
(c) Let 𝑋 = {1, 2, 3, 4, 5, 6, 7} and 𝑅 = {〈𝑥, 𝑦〉|𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3}. Show that 𝑅 07
is an equivalence relation on. Draw the graph of 𝑅.
OR
(b) Define equivalence class generated by an element 𝑥 ∈ 𝑋. Let Z be the set of 07
integers and let 𝑅 be the relation called “congruence modulo 3” defined by
𝑅 = {〈𝑥, 𝑦〉|𝑥 ∈ 𝑍⋀𝑦 ∈ 𝑍⋀(𝑥 − 𝑦) 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3}
Determine the equivalences classes generated by the element of 𝑍.
Q.3 (a) Let 𝑓(𝑥) be any real valued function. Show that 𝑔(𝑥) = 𝑓(𝑥)+𝑓(−𝑥) is always an 03
2
𝑓(𝑥)−𝑓(−𝑥)
even function where as ℎ(𝑥) = is always an odd function.
2
(b) The Indian cricket team consist of 16 players. It includes 2 wicket keepers and 5 04
bowlers. In how many ways can cricket eleven be selected if we have select 1
wicket keeper and at least 4 bowlers?
(c) Let 𝐴 be the set of factors of particular positive integer 𝑚 and ≤ be the relation 07
divides, that is
≤= {〈𝑥, 𝑦〉|𝑥 ∈ 𝐴⋀𝑦 ∈𝐴⋀(𝑥 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦)} Draw the Hasse diagrams for
a) 𝑚 = 45
b) 𝑚 = 210.
OR
Q-3 (a) Find the composition of two functions 𝑓(𝑥) = 𝑒 𝑥 and 𝑔(𝑥) = 𝑥 3 , (𝑓 ∘ 𝑔)(𝑥) and 07
(𝑔 ∘ 𝑓)(𝑥). Hence, show that (𝑓 ∘ 𝑔)(𝑥) ≠ (𝑔 ∘ 𝑓)(𝑥).
(b) In a box, there are 5 black pens, 3 white pens and 4 red pens. In how many ways 04
can 2 black pens, 2 white pens and 2 red pens can be chosen?
(c) Let 𝐴 be a given finite set and 𝜌(𝐴) its power set. Let ⊆ be the inclusion relation 07
on the elements of 𝜌(𝐴). Draw Hass diagram for 〈𝜌(𝐴), ⊆〉 for
a) 𝐴 = {𝑎, 𝑏, 𝑐}
b) 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑}
1
Q.4 (a) Let 〈𝐿, ≤〉 be a lattice. Show that for 𝑎, 𝑏, 𝑐 ∈ 𝐿, following inequalities holds. 07
𝑎 ⊕ (𝑏 ⋆ 𝑐) = (𝑎⨁𝑏) ⋆ (𝑎⨁𝑐)
𝑎 ∗ (𝑏⨁𝑐) = (𝑎 ∗ 𝑏)⨁(𝑎 ∗ 𝑐)
(b) Let 𝐺 = {(𝑎, 𝑏)|𝑎, 𝑏 ∈ 𝑅}. Define binary operation (∗) on 𝐺 as 07
(𝑎, 𝑏), (𝑐, 𝑑) ∈ 𝐺, (𝑎, 𝑏) ∗ (𝑐, 𝑑) = (𝑎𝑐, 𝑏𝑐 + 𝑑). Show that an algebraic structure
(𝐺,∗) is a group.
OR
Q-4 (a) Let 𝐺 be the set of non-zero real numbers. Define binary operation (∗) on 𝐺 as 07
𝑎𝑏
𝑎 ∗ 𝑏 = 2 . Show that an algebraic structure (𝐺,∗) is an abelian group.
(b) Explain the following terms with proper illustrations. 07
a) Directed graphs
b) Simple and elementary path
c) Reachability of a vertex
d) Connected graph.
Q-5 (a) Show that sum of in-degrees of all the nodes of simple digraph is equal to the sum 07
of out-degrees of all the nodes and this sum equal to the number of edges in it.
(b) Let = {1, 2, 3, 4} . For the relation 𝑅 whose matrix is given, find the matrix of the 07
transitive closure by using Warshall’s algorithm.
1 0 0 1
1 1 0 0
𝑀𝑅 = [ ]
0 0 1 0
0 0 0 1
OR
Q-5 (a) Define tree and root. Also prove that tree with 𝑛 vertices has 𝑛 − 1 edges. 07
(b) Define in-degree and out-degree of a vertex and matrix of a relation. Let 𝐴 = 07
{𝑎, 𝑏, 𝑐, 𝑑} and let 𝑅 be the relation on 𝐴 that has the matrix
1 0 0 0
0 1 0 0
𝑀𝑅 = [ ]
1 1 1 0
0 1 0 1
*************
2

Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
MARKS
Q.1 (a) Among 100 people at least how many of them were born in the same 03
month?
(b) Prove that: (𝐴 ∪ 𝐵)′ ≡ 𝐴′ ∩ 𝐵 ′ . 04
(c) Define the following: 07
1) Composition of functions
2) Monoid
3) Existential Quantifier
4) Partially Ordered Set
5) Boolean Algebra
6) Tree
7) Complete Graph
Q.2 (a) Explain types of a Relation with a suitable example. 03

(b) Rewrite the following statements using quantifier variables and 04
predicate symbols:
1) All birds can fly.
2) Some women are genius.
3) There is a student who likes Discrete Mathematics but not Probability
and Statistics.
4) Each integer is either even or odd.
(c) Determine the validity of the argument given: 07
If I study, then I will not fail in Discrete Mathematics.
If I do not play cricket, then I will study.
But I failed in Discrete Mathematics.
----------------------------------------------------------
Therefore I must have played cricket.
OR
(c) Find if the following is a tautology, contradiction or contingency. 07
(𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟))
Q.3 (a) Define: Bounded, Distributive and Complemented Lattices. 03
(b) Find the transitive closure of 04
𝑅 = {(1,2), (3,4), (4,5), (4,1), (1,1)}. Where, 𝐴 = {1,2,3,4,5}.
(c) Let 𝐴 be a set of factors of positive integer 𝑚 and relation is divisibility 07
on 𝐴.
For 𝑚 = 45, show that POSET (𝐴, ≤) is a Lattice.
OR
Q.3 (a) Draw the Hasse diagram of the set {1,3,9,18} under partial order relation 03
‘divides’ and indicate those which are chains.
(b) Let 𝑋 = {1,2,3, … ,7} and 𝑅 = {(𝑥, 𝑦): 𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑏𝑙𝑒 𝑏𝑦 3}. Show 04
that 𝑅 is an equivalence relation. Draw the graph of 𝑅.
1
(c) Solve the recurrence relation: 07
𝑎𝑛+2 − 5𝑎𝑛+1 + 6𝑎𝑛 = 2.
Q.4 (a) Define group with example. Give an example of a non-abelian group. 03
(b) Let 𝐻 = {[0], [3]} in 𝑍6 under addition. Find left and right cosets in < 04
𝑍6 , +6 >.
(c) Prove that 𝐺 = {1,2,3,4,5,6} is a finite abelian group of order 6 with 07
respect to multiplication modulo 7.
OR
Q.4 (a) Define subgroup and group Homomorphism. 03
(b) Is addition a binary operation on {-1,0,1}? Justify. 04
(c) Explain Cosets and Lagrange’s theorem. 07
Q.5 (a) How many nodes are necessary to construct a graph with exactly 8 edges 03
in which each node is of degree 2.
(b) Find the shortest path between each pair of vertices for a simple digraph 04
using Warshall’s Algorithm.
(c) Define Isomorphic Graphs. Verify the following graphs are Isomorphic 07
or not (Justify).
OR
Q.5 (a) Define Cyclic graph, Null graph and Strongly connected graph. 03
(b) Draw a graph which is regular but not bipartite. 04
(c) For the following set of weights construct an optimal binary prefix code. 07
For each weight in the set, give corresponding code word.
5, 7, 8, 15, 35, 40
*************
2

Instructions:
Marks
Q.1 (a) Determine whether each of these statements is true or false. 03
1)0 ∈ ∅ 2)∅ ⊂ {0} 3){0} ∈ {0}
4) ∅ ∈ {∅} 5){∅} ∈ {{∅}} 6) {{∅}} ⊂ {∅, {∅}}
(b) Determine whether f is a function from the set of all bit strings to the set 04
of integers if
1) 𝑓(𝑠) is the position of a 0 bit in S.
2) 𝑓(𝑠) is the number of a 1 bits in S.
Find the range of each of the following functions that assigns:
3) to a bit string the number of one bits in the string
4) to each bit string twice the number of zeros in that string.
(c) 1) Find the bitwise OR, and bitwise XOR of the bit string 1111 0000, 07
1010 1010
2) Show that the function 𝑓: 𝑅 → 𝑅 + ∪ {0} defined by 𝑓(𝑥) = |𝑥| is
not invertible. Modify the domain or codomain of 𝑓 so that it
becomes invertible.
3) Let 𝑆 be subset of a universal set ∪. The characteristic function 𝑓𝑆
: ∪→ {0,1} , 𝑓𝑆 (𝑥) = 1, 𝑖𝑓 𝑥 ∈ 𝑆 𝑎𝑛𝑑 0 𝑖𝑠 𝑥 ∉ 𝑆.
Let A and B be sets. Then show that 𝑓𝐴∩𝐵 (𝑥) = 𝑓𝐴 (𝑥). 𝑓𝐵 (𝑥)
Q.2 (a) Let P(x) be the statement “x = x2 “. If the domain consists of the integers, 03
what are the truth values of the following?
1) ∃𝑥 𝑃(𝑥) 2) ∀𝑥 ¬𝑃(𝑥) 3) ∃𝑥 ¬𝑃(𝑥)
(b) Identify the error or errors in this argument that supposedly shows that if 04
∃x P(x) ∧ ∃x Q(x) is true then ∃x (P(x) ∧ Q(x)) is true.
1. ∃x P(x) ∧ ∃x Q(x) Premise
2. ∃x P(x) Simplification from (1)
3. P(c) Existential instantiation from (2)
4. ∃x Q(x) Simplification from (1)
5. Q(c) Existential instantiation from (2)
6. 𝑃(c) ∧ 𝑄(𝑐) Conjunction from (3) and (5)
7. ∃𝑥 (𝑃(𝑥) ∧ 𝑄(𝑥)) Existential generalization
(c) 1) Use a truth table to verify the De Morgan’s law 07

¬(𝑝 ∨ 𝑞) ≡ ¬𝑝 ∧ ¬𝑞
2) Show that (𝑝 → 𝑞) ∧ (𝑞 → 𝑟) → (𝑝 → 𝑟) is a tautology.
OR
1
(c) 1) Suppose that the domain of Q(x, y, z) consists of triples x, y, z, 07
where x = 0, 1, or 2, y = 0 or 1, and z = 0 or 1. Write out following
propositions using disjunctions and conjunctions.
i) ∃𝑧¬𝑄(0,0, 𝑧) ii). ∀𝑦𝑄(0, 𝑦, 0)
2)
i) Show that ∃𝑥 𝑃(𝑥) ∧ ∃𝑥 𝑄(𝑥) and ∃𝑥(𝑃(𝑥) ∧ 𝑄(𝑥)) are
not logically equivalent.
ii) Show that ∃𝑥(𝑃(𝑥) ∨ 𝑄(𝑥)) and ∃𝑥 𝑃(𝑥) ∨ ∃𝑥 𝑄(𝑥) are
logically equivalent.
Q.3 (a) For the relation {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)} on the set 03
{1,2,3,4}, decide whether it is reflexive, whether it is symmetric, whether
it is antisymmetric, and whether it is transitive..(Justify your answer if the
property is not satisfied)
(b) For the following relations on the set of real numbers, 04

𝑅1 = {(𝑎, 𝑏) ∈ 𝑅 2 |𝑎 ≥ 𝑏}, 𝑅2 = {(𝑎, 𝑏) ∈ 𝑅 2 |𝑎 ≤ 𝑏}
2
𝑅3 = {(𝑎, 𝑏) ∈ 𝑅 |𝑎 ≠ 𝑏} find
1) 𝑅1 ⨁𝑅3 2) 𝑅2 𝑜 𝑅3
(c) 1) Draw the Hasse diagram for the poset ({2, 4, 6, 9, 12, 18, 27, 36, 48, 07
60, 72}, |). Hence find 𝑔𝑙𝑏({60,72}) and all maximal elements.
2) Determine whether the relation with the directed graph shown is
an equivalence relation.
OR
Q.3 (a) Suppose that the relations 𝑅1 and 𝑅2 on a set A are represented by the 03
matrices
1 0 1 1 0 1
M𝑅1 = [1 0 0] and M𝑅2 = [0 1 1]
0 1 0 1 0 0
What are the matrices representing 𝑅1 ∪ 𝑅2 and 𝑅1 ∩ 𝑅2 ?
(b) Use Warshall’s algorithm to find the transitive closures of the relation 04
𝑅 = {(1,4), (2, 1), (2,3), (3,1), (3,4), (4,3)} on {1, 2, 3, 4}
(c) 1) Draw the Hasse diagram for the poset({2, 4, 5, 10, 12, 20, 25}, |). 07
Hence, find the are maximal and minimal elements.
2) Which of these collections of subsets are partitions of
{1, 2, 3, 4, 5, 6}? Justify your answer if it is not a partition.
i) {1, 2}, {2, 3, 4}, {4, 5, 6}
ii) {1, 4, 5}, {2, 6}
Q.4 (a) Explain Path and Circuit of a graph. 03
2
(b) 1) Define Isomorphic Graphs 04
2) Verify the following graphs are Isomorphic or not (Justify).
Graph -1 Graph-2
(c) 1) Define Subtree and Degree of a Node 07

2) Determine degree of the each node for the following tree.
OR
Q.4 (a) 1) Define: i) Isolated vertex ii) Null graph 03
2) Identify Isolated vertex/vertices from the following graph
(b) 1) Define incidence Matrix of a Graph 04

2) Find incidence matrix for the following graph
(c) 1) Define: M-ary Tree and Binary Tree. 07

2) Represent the following directed tree as Binary tree
3
Q.5 (a) 1) Define: SemiGroups. 03
2) Let S = {a, b, c, d}. The following multiplication table, define
operations ∙ on S. Is 〈S, ∙〉semigroup? Justify
(b) Let 𝐻 = {1, – 1} and 𝐺 = {1, – 1, 𝑖, – 𝑖} . (𝐻,×) is a sub-group (𝐺,×). 04

Then find all left cosets and right cosets of 𝐻 in 𝐺.
(c) 1) Define:Ring. 07
2) Write elements of the ring 〈𝑧10 , +10 , ×10 〉. And find −3, −8 , 3−1 , 4−1
OR
Q.5 (a) Consider the set Q of a rational numbers. Let ∗ be the operation on Q 03
defined by a∗ 𝑏 = 𝑎 + 𝑏 − 𝑎𝑏. Find
1) 3 ∗ 4 2) the identity element for ∗.
(b) Write the equivalence classes for congruence modulo 4 i.e.. z4 04

Let the subset H={[0],[2]} is a subgroup of 𝐺 = 〈𝑧4 , +4 〉. Then determine
all left cosets of H in G.
(c) We are given the ring 〈{𝑎, 𝑏, 𝑐, 𝑑}, +,∙〉 the operations + and ∙ on 𝑅 are as 07
shown in the following table.
+ a b c d ∙ a b c d
a a b c d a a a a a
b b c d a b a c a c
c c d a b c a a a a
d d a b c d a c a a
1) Does it have an identity?
2) What is the zero of this ring?
3) Find the additive inverse of each of its elements
********
4

Subject Name:Object Oriented Programming -I
Instructions:
MARKS
Q.1 (a) Discuss significance of byte code. 03
(b) Explain Java garbage collection mechanism. 04
(c) List OOP characteristics and describe inheritance with examples. 07
Q.2 (a) Explain constructor with the help of an example. 03

(b) List out different methods available for String class in java and explain 04
any two with proper example.
(c) Explain all access modifiers and their visibility as class members. 07
OR
(c) Compare String with StringBuffer. Also, write a program to count the 07
occurrence of a character in a string.
Q.3 (a) What is the final class? Why they are used? 03
(b) Write exception handling mechanisms in JAVA. 04
(c) Explain Overloading and Overriding with example. 07
OR
Q.3 (a) How can you create packages in Java? 03
(b) What is Inheritance? List out the different forms of Inheritance and 04
explain any one with example.
(c) Explain the words super, static, final and this with the help of an 07
example.
Q.4 (a) List out various layout panes in JavaFX. 03

(b) Explain the architecture of JavaFX. 04
(c) Discuss BufferedInputStream and BufferedOutputStream classes with 07
an example.
OR
Q.4 (a) List out JavaFX UI controls and explain any one in detail. 03
(b) Demonstrate animation effect in JavaFX. 04
(c) Create a class called Student. Write a student manager program to 07
manipulate the student information from files by using FileInputStream
and FileOutputStream.
Q.5 (a) What is Java Collection? 03

(b) List out methods of Iterator and explain it. 04
(c) Explain Set and Map in Java with example. 07
OR
Q.5 (a) What is Vector class? 03
(b) Describe with diagram the life cycle of Thread. 04
(c) Explain synchronization in Thread with suitable example. 07
***********
1

Instructions:
MARKS
Q.1 (a) What are syntax errors (compile errors), runtime errors, and logic 03
errors?
(b) What is Type Casting? Explain widening and narrowing type 04
casting.
(c) Explain Data Types in detail with example. 07
Q.2 (a) What is an interface? Explain with example. 03

(b) Explain “Passing argument by values” with example. 04
(c) Explain File class with its methods. 07
OR
(c) What is polymorphism? Explain dynamic binding with example. 07
Q.3 (a) Explain abstract class with example. 03
(b) Explain Method Overloading and Overriding. 04
(c) Write a program that counts the number of words in a text file. 07
The file name is passed as a command line argument. The words
in the file are separated by white space characters.
OR
Q.3 (a) Differentiate String class and StringBuffer class. 03
(b) Explain following keywords 04
(1) super (2) this
(c) Write a program that illustrates interface inheritance. Interface P 07
is extended by P1 and P2. Interface P12 inherits from both P1 and
P2. Each interface declares one constant and one method. class Q
implements P12. Instantiate Q and invoke each of its methods.
Each method displays one of the constants.
Q.4 (a) Explain visibility modifiers. 03
(b) Explain following controls 04
(1) Checkbox (2) Radio Button (3) Textfield (4) Label
(c) What is an Exception? Explain try, catch and finally with 07
example.
OR
Q.4 (a) What is the keyword “throw” used for? What is the keyword 03
“throws” used for?
(b) What is constructor? Explain constructor overloading. 04
(c) Explain different layout panes used in JavaFX. 07
Q.5 (a) Differentiate Text I/O and Binary I/O 03
(b) Explain Inner class with example. 04
(c) What is thread? Describe the complete life cycle of thread. 07
OR
1
Q.5 (a) Compare List and Set. 03
(b) Explain static variable and static method with example. 04
(c) Explain Thread Synchronization with example. 07
*************
2

Time:02:30 PM TO 05:00 PM Total Marks:70
Instructions:
MARKS
Q.1 (a) Define object oriented concepts. 03
(b) What is the difference between the StringBuffer and StringBuilder 04
classes?
(c) Define constructor. How objects are constructed? Explain constructor 07
overloading with an example.
Q.2 (a) Explain about arrays, Type of arrays and arrays methods. 03
(b) Explain about Encapsulation, Abstraction. 04
(c) State the design hints for class and inheritance. 07
Also discuss the working and meaning of the “static” modifier with
suitable examples.
OR
(c) Explain in detail how inheritance and polymorphism are supported in 07
java with necessary examples.
Q.3 (a) Explain about different types of string methods. 03
(b) Write short notes on access specifiers and modifiers in java. 04
(c) What is an Exception? Explain the exception hierarchy. Explain how 07
to throw, catch and handle Exceptions.
OR
Q.3 (a) Explain about Final class, Fields, Methods. 03
(b) What is a Package? What are the benefits of using packages? Write 04
down the steps in creating a package and using it in a java program
with an example.
(c) Explain the concept of inner classes and explain the types of inner 07
classes with an example program.
Q.4 (a) What is Dynamic binding? Show with an example how dynamic 03
binding works.
(b) Write short notes about I/O stream classes. 04
(c) Explain the thread state, thread properties and thread synchronization. 07
OR
Q.4 (a) Explain the concept of finalization. 03
(b) What is reflection and how does it help to manipulate java code. 04
(c) Write a java program to implement the multiple inheritance concepts 07
for calculating area of circle and square.
Q.5 (a) Explain about callback 03
(b) Explain the interface with an example program. 04
(c) What is Generic programming and why is it needed? Explain with 07
example. List the limitations and restrictions of generic programming
1
OR
Q.5 (a) Explain about Proxy class, Interface and Methods. 03
(b) Explain about adapter classes and mouse events with an example. 04
(c) With a neat diagram explain the Model view controller design pattern 07
and list out the advantages and disadvantages of using it in designing
an application.
*************
2

Instructions:
Marks
Q.1 (a) List out features of Java. Explain any two features. 3
(b) Write a single program which demonstrates the usage of following 4
keywords:
i) import, ii) new, iii) this, iv) break, v) continue
Show how to compile and run the program in java.
(c) Demonstrate use of try-catch construct in case of hierarchical 7
Exception Handling. (i.e handling various exception belongs to the
exception hierarchy)
Q.2 (a) Explain following Java keywords using appropriate examples: 3

i) static, ii) final, iii) super
(b) Consider class A as the parent of class B. Explain among the 4
following which statement will show the compilation error.
i) A a = new A();
ii) A a = new B();
iii) B b = new A();
iv) B b = new B();
(c) Write a java program to take infix expressions and convert it into 7
prefix expressions.
OR
(c) Write a java program that evaluates a math expression given in string 7
form from command line arguments.
Q.3 (a) Defines types of inheritance. 3

(b) Explain the following constructors using appropriate example: 4
i) Default constructor and Parameterised constructor
ii) Shallow copy and Deep copy constructor
(c) Explain file io using byte stream with appropriate example. 7
hint: use FileInputStream, FileOutputStream
OR
Q.3 (a) Define types of polymorphism 3
(b) Explain the following: 4
i) Arguments and Parameters of a function
ii) Pass by Value and Pass by reference
1
(c) Explain file io using character stream with appropriate example. 7
hint: use FileReader, FileWriter
Q.4 (a) Define Encapsulation and access specifier 3

(b) Explain multithreading using Thread class 4
(c) Write a short note on Java Collections. 7
OR
Q.4 (a) Differentiate between Abstract class and Interfaces 3
(b) Explain multithreading using Runnable interface 4
(c) Write a program to add input elements in ArrayList collection class, 7
then sort the inserted elements in descending order and display the
sorted output.
hint: use Collections.reverseOrder()
Q.5 (a) Explain following Java keywords using appropriate examples: 3

i) throw, ii) throws, iii) finally
(b) In multi-threading using Thread class, explain with an example how 4
a start() method call invokes the run method of the class extending
Thread class.
(c) Write a short note on JAVAFX controls. 7
OR
Q.5 (a) Explain thread life cycle 3
(b) In multi-threads using the Runnable interface, explain with an 4
example how a start() method calls the run() method of a class
implementing a runnable interface.
(c) Develop a GUI based application using JAVAFX controls. 7
*************
2

Subject Name:Operating System and Virtualization
Instructions:
MARKS
Q.1 (a) Describe the four conditions that create deadlock. 03

(b) Differentiate between single threaded and multithreaded process models. 04
(c) Consider the following scenario of processes for Round Robin 07
Scheduling with time quantum 2.
Process Arrival Time Execution Time
P1 0 9
P2 1 5
P3 2 3
P4 3 4
Draw the Gantt chart for the execution of processes, showing their start
time and end time. Calculate average turnaround time and average
waiting time of the processes.
Examine the effect if time quantum is too large and too small.
Q.2 (a) Describe the two strategies for providing processor resources in a virtual 03
environment.
(b) Describe hardware approaches to mutual exclusion. 04
(c) Consider a disk queue with I/O requests of the following cylinders in 07
their arriving order 6,10,12,54,97,73,128,15,44,110,34,45
The disk head is assumed to be at Cylinder 23 and moving in the direction
of decreasing number of cylinders. The disk consists of total 150
cylinders. Calculate the disk head movement using SCAN and C -SCAN
scheduling algorithm.
OR
(c) Calculate the number of page faults for the following reference string 07
using LRU(Least recently used) page replacement algorithm with frame
size as 3.
5 0 2 1 0 3 0 2 4 3 0 3 2 1 3 0 1 5
Q.3 (a) Describe characteristics of monitor. 03

(b) Write Peterson’s solution for achieving mutual exclusion. 04
(c) Write the different states a process can hold. Explain the types of events 07
that lead to each state transition for a process.
OR
Q.3 (a) Segmentation suffers from internal fragmentation or external 03
fragmentation? Justify.
(b) In a paging scheme,16 bit addresses are used with a page size of 512 bytes. 04
If the logical address is 0000010001111101, how many bits are used for
the page number and offset? What will be the physical address, if the
frame address corresponding to the computed page number is 15.
1
(c) Describe the elements which uniquely characterize a process while 07
program is executing.
Q.4 (a) Explain how resource allocation graph can depict the deadlock situation? 03
(b) Explain the handling of multiple non interactive and multiple interactive 04
jobs in case of multiprogramming.
(c) Distinguish between 07
(i) Static and dynamic allocation of memory
(ii) Swapping and paging
(iii) Page, frame and segment
OR
Q.4 (a) Describe the two difficulties with the use of equal size fixed partitions. 03
(b) Explain how input output is managed in virtual environment. 04
(c) Consider the following scenario of processes with priority. If the 07
scheduling of processes is priority based, Draw the Gantt chart. Calculate
turnaround time and waiting time for each process. Also compute
average turnaround time and average waiting time for the system.
Process Arrival Time Execution Time Priority

P1 0 9 2
P2 1 5 1
P3 2 3 3
P4 3 4 4
Q.5 (a) Describe the function of kernel in operating system. 03

(b) Give example of Best fit and worst fit memory allocation strategy. 04
(c) Consider a system with the following information. Determine whether 07
the system is in safe state. If not in safe state, give reasons. If the system
is in safe state, find the safe sequence of processes. Consider Need
assuming Maximum Allocation.
Total Resources(31)
Total Resources of R1 type – 15
Processes Max Alloc
R1 R2 R3 R1 R2 R3
1 5 6 3 2 1 0
2 8 5 6 3 2 3
3 4 9 2 3 0 2
4 7 4 3 3 2 0
5 4 3 3 1 0 1
OR
Q.5 (a) Differentiate the preemptive and nonpreemptive scheduling. 03
(b) Describe Linux VServer architecture. 04
(c) Discuss the race condition in producer- consumer problem. Discuss the 07
use of semaphore to solve producer-consumer problem. Also Discuss the
solution of producer consumer problem with message passing.
*************
2

Instructions:
Q.1 (a) Differentiate between Multi-Programming and Multi-Processing System. 03

(b) Write different types of system calls? 04
(c) What is scheduler? Explain queuing diagram representation of process 07
scheduler.
Q.2 (a) Explain Fragmentation. 03

(b) Define the following terms. 04
1. Throughput
2. Waiting Time
3. Turnaround Time
4. Response Time
(c) Consider the following set of processes, with the length of the CPU-burst 07
time given in milliseconds:
Process burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF,
nonpreemptive), Priority (smaller priority number implies higher
scheduling priority), and RR (quantum = 1) do the following:
a. Draw a Gantt chart to show how these processes would be

scheduled.
b. Give the turnaround time (total time from first arrival into
ready state until cpu-burst is completed) of each process.
c. Give the waiting time (total time spent in the Ready state)
of each process.
d. Give the average waiting time of all the processes.
Which of these scheduling algorithm gives the smallest average waiting
Time?
OR
(c) What is Process? Draw Five State Process Model and Explain it. 07
Page 1 of 2
Q.3 (a) Give the functions of following UNIX commands: 03
1. grep
2. cat
3. cmp
(b) Explain concept of Demand Paging in memory management. 04
(c) What is Critical Section Problem and list the requirements to solve it. 07
Write Peterson’s Solution for the same.
OR
Q.3 (a) What is deadlock? List the conditions that lead to deadlock. 03
(b) Explain Hypervisor. 04
(c) Explain Dining-philosophers Solution Using Monitors. 07
Q.4 (a) What is interrupt? How it is handle by operating system. 03

(b) What is device driver? Explain its function in brief. 04
(c) Explain VMware ESXi architecture. 07
OR
Q.4 (a) What is called TLB? 03
(b) Describe RAID level 4. 04
(c) Explain the events that cause processes to be created. 07
Q.5 (a) Write about Resource Allocation Graph algorithm. 03

(b) Write benefits of Virtual Machines. 04
(c) Write Banker’s Algorithm. 07
OR
Q.5 (a) Define following Terms: 03
1. Mutual Exclusion
2. Thrashing
3. Thread
(b) List Deadlock Recovery Techniques and explain one of them. 04
(c) What is Semaphore? Give the implementation of Bounded Buffer. 07
*************
Page 2 of 2

Time:02:30 PM TO 05:00 PM Total Marks:
Instructions:
MARKS
Q.1 (a) Define following Terms: 03
Mutual Exclusion ,Thrashing , Thread

(b) Explain the features of Time sharing system. 04
(c) What is operating system? Give the view of OS as a resource manager. 07
Q.2 (a) Explain the following UNIX Commands 03

(a) grep (b) chmod (c) finger
(b) Draw process state diagram. Explain each transition among them in 04
detail.
(c) What is thread? Explain thread Structure? And explain any one type of 07
thread in details.
OR
(c) What is PCB? Discuss its major fields. 07
Q.3 (a) List the four events that cause processes to be created. Explain each in 03
brief.
(b) What is interrupt? How it is handle by operating system. 04
(c) Explain producer consumer problem and its solution using monitor. 07
OR
Q.3 (a) Write a short note on semaphores. 03
(b) Discuss Demand paging in detail. 04
(c) Explain producer-consumer problem and solve it using semaphore. 07

Write pseudo code for the same
Q.4 (a) List Deadlock recovery techniques and explain any one of them. 03
(b) Write a short note on Critical Section. 04
(c) Differentiate between preemptive and non-preemptive scheduling. Solve 07

following by SJF preemptive and non-preemptive. Draw Gantt Chart,
Average Waiting Time and Average Turnaround Time. Which one is
better as per average turnaround time?
1
Process Burst Time Arrival Time
P1 6 2
P2 2 5
P3 8 1
P4 3 0
P5 4 4
OR
Q.4 (a) Explain context switching. 03
(b) Explain Bankers’ algorithm to avoid deadlock. 04
(c) Consider the reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the number of 07
frames in the memory is 3. Find out the number of page faults respective
to:
1. Optimal Page Replacement Algorithm
2. FIFO Page Replacement Algorithm
LRU Page Replacement Algorithm
Q.5 (a) What is called segmentation? How it differs from paging? 03
(b) What are the inherent benefits of the Virtualization? 04
(c) Consider the following disk request sequence for a disk with 100 tracks 07
45, 21, 67, 90, 4, 50, 89, 52, 61, 87, 25. Head pointer starting at 50 and
moving in left direction. Calculate head movement for the following
algorithms.
1. FCFS 2. SSTF
OR
Q.5 (a) Explain Linux kernel and its functions. 03
(b) Write a shell script which displays the content of all files given as 04
command line arguments with appropriate heading. It should also give
the name of file which are not readable.
(c) Explain ESX server and also write the differences between ESX server 07
and VMware server.
*************
2

Instructions:
MARKS
Q.1 (a) Define (i) Operating systems (ii) Tightly coupled Systems (iii) Loosely 03
Coupled Systems.
(b) Define Process. And Write various states of process with diagram. 04
(c) Describe the services an Operating System provides to users, processors 07
and other systems.
Q.2 (a) Define Thread. And write usage of threads. 03

(b) Write about Process Control block. 04
(c) Define Scheduler. Discuss Types of Schedulers. 07
OR
(c) Write about Multithreading models. 07
Q.3 (a) What is buffering? Write various types of buffers. 03

(b) Write about various Scheduling criteria. 04
(c) Consider the following set of processes with the length of the CPU burst 07
given in milliseconds:
Process Arrival Time Burst Time Priority
P1 0 7 3
P2 2 4 1
P3 4 2 2
P4 8 1 4
a.) Draw Gantt charts that illustrate the execution of these processes
using the following scheduling algorithms: FCFS, Non
Preemptive SJF, Preemptive priority(a smaller number implies a
higher priority)
b.) What is the turnaround time and Waiting time of each process
for each of the scheduling algorithms in part a?
c.) What is the average turnaround time and waiting time of each
process for each of the scheduling algorithms in part a?
OR
Q.3 (a) Define Mutual Exclusion, Critical Section and Race Condition. 03
(b) Write Peterson’s Solution for avoiding race condition. 04
(c) Explain how Dining philosopher problem can be solved using monitor. 07
Q.4 (a) Discuss priority Inversion problem. 03

(b) Define Deadlock. And also write condition responsible for deadlock. 04
(c) Write Banker’s Algorithm for avoiding Deadlock for allocation of 07
multiple instances of resource type.
OR
Q.4 (a) Define Internal and External Fragmentation. 03
1
(b) Write about Resource allocation graph algorithm. 04
(c) Explain second chance LRU approximation algorithm with proper 07
example. Also write about enhanced LRU approximation algorithm.
Q.5 (a) Explain Usages of following Linux Commands with proper example. 03
( i) grep (ii) wc (iii) diff
(b) Discuss paging in Detail. 04
(c) Write a Linux Shell Script to find out all prime numbers between given 07
range.
OR
Q.5 (a) Define Virtualization and explain it with diagram. 03
(b) Discuss TLB. 04
(c) Suppose that a disk drive has 200 cylinders. Numbered 0 to 199. The 07
drive is currently serving at cylinder 60 and previous request was at
cylinder 35. The queue of pending requests in FIFO order is
70, 140, 50, 125, 30, 25, 160
Starting from the current head position what is the total distance (in
cylinders) that the disk arm moves to satisfy all the pending requests for
each of following disk scheduling algorithms.
a) FCFS
b) SSTF
c) SCAN
d) LOOK
*************
2

Subject Name:Principles of Economics and Management
Instructions:
Marks
Q.1 (a) Define economics and explain the scope of economics. 03

(b) Differentiate between Microeconomics and Macroeconomics. 04
(c) Explain elasticity of demand in detail. 07
Q.2 (a) What are the different concepts of Marketing? 03

(b) Discuss the types of cost. Explain any two with examples. 04
(c) Explain break even analysis in detail. 07
OR
(c) Explain fiscal policy, its objectives and tools. 07
Q.3 (a) Define the following terms: reverse repo rate, repo rate, bank rate 03
(b) What should be the preparation to reduce inflation? 04
(c) Discuss the meaning and functions of money in detail. 07
OR
Q.3 (a) Explain perfect competition with suitable example. 03
(b) What is the difference between line and staff organization structures? 04
(c) Explain in detail about various methods of computing national income. 07
Q.4 (a) Differentiate between Management and Administration. 03

(b) Explain the causes of poverty in brief. 04
(c) Explain the term Unemployment, its types, causes and remedies. 07
OR
Q.4 (a) What is difference between absolute and relative poverty? 03
(b) List the function of RBI in governing the banking system in India. 04
(c) What are the principles of organizational structures? Elaborate in details. 07
Q.5 (a) How does culture affects managers and employees? 03

(b) Write a short note on hybrid organization. 04
(c) Corporate Social Responsibility must be made compulsory for all 07
organizations. Give your comments for the same, and also give good
examples of it.
OR
Q.5 (a) Discuss role and skills of a Manager. 03
(b) Many organizations do not have business ethics give your comments for 04
the same.
(c) Explain the theory of Maslow’s hierarchy of needs. 07
**********
1

Instructions:
MARKS
Q.1 (a) Define the following terms: Management, Marketing, and Money. 03
(b) Enlist determinants of Demand and Supply. 04
(c) Explain the break even analysis with the help of suitable Curves and 07
Assumptions. Also derive the formula for Break Even Quantity.
Q.2 (a) Explain the relationship between Total, Fixed and Variable costs. 03
(b) Explain the importance of the subject Principles of Economics and 04
Management as part of B. E. study.
(c) Explain Elasticity of Demand in detail. 07
OR
(c) GDP, GNP, NNP and NDP. Explain these concepts in detail. 07
Q.3 (a) Explain about different types of money. 03
(b) Explain Monopolistic Market with its characteristics. 04
(c) Explain monetary policy, its objectives and tools. 07
OR
Q.3 (a) List out the principles of scientific management. 03
(b) Explain the types of managers with examples. 04
(c) Explain in detail about various functions of banking. 07
Q.4 (a) List out various economic problems. 03
(b) Differentiate the perfect competition and monopolistic competition. 04
(c) Explain in brief Poverty (causes, types, and measure to eradicate). 07
OR
Q.4 (a) Management is an art. Justify the statement. 03
(b) Explain Needs Maslow’s theory of management. 04
(c) Explain Corporate Social Responsibility of a Multinational 07
organization.
Q.5 (a) Define the following terms: bank rate, repo rate,& reverse repo rate 03
(b) What are the causes and remedies of unemployment? 04
(c) List the type of Organization. Explain any one type in detail. 07
OR
Q.5 (a) Discuss the stock and flow concept of national income? 03
(b) Ethical Behavior is doing what is morally right. Justify it. 04
(c) Discuss the internal and external sources of recruitment in detail. 07
1

Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
Marks
Q.1 (a) Define Terms: 03
1. Economics 2.Personal Income 3. Interest Rate
(b) Differentiate Microeconomics & Macroeconomics with their significance in 04
assessing Economies.
(c) How the prices of goods are determined by market? Discuss significance of 07
demand and supply of goods in price determination.
Q.2 (a) List the factors that influence elasticity. 03

(b) An Automobile company wants to setup a new vehicle manufacturing plant 04
in a particular region. List and Explain the various parameters which can
influence unit cost of a car.
(c) What is Break-Even Analysis? Mr. ABC is the managerial accountant in 07
charge of soft-drink Company XYZ. According to him, fixed costs of
company XYZ consist of property taxes, a lease, and salaries of staff, which
add up to Rs. 1,00,000. The variable cost associated with producing one soft-
drink bottle is Rs. 2 per unit which is sold at a premium price of Rs. 12 per
unit. Determine the Break-Even Quantity. What would be Break Even
Quantity if production cost becomes Rs. 4 per bottle?
OR
(c) List and Explain various type costs in production with suitable example. 07
Q.3 (a) List and Explain Characteristics of “Perfect Competition” type markets. 03
(b) Compare and Contrast Monopoly and Perfect Competition markets. 04
(c) How the size of economy of a nation/region can be measured? Which are the 07
various factors which can be helpful to attract foreign investments?
OR
Q.3 (a) “Inflation is an unaccounted Tax on citizens”, is it True? Justify your answer 03
with suitable arguments.
(b) “World is a global village”, is it true? Justify in terms of economic activities. 04
(c) Unemployment, Poverty, Poor Education, and Poor Public Health 07
Infrastructure, How these social problems are interlinked? Discuss with
reasonable arguments.
Q.4 (a) What is role of Central Bank in economy of a nation? 03
(b) What is money? List and Explain various characteristics of money. 04
(c) Compare and Contrast Monetary Policy and Fiscal Policy. 07
OR
Q.4 (a) Differentiate Management and Administration. 03
(b) Discuss 4 P’s of Marketing. 04
(c) “Management is combination of a Science and Art.” Justify the statement. 07
1
Q.5 (a) What is the importance of Human Resource Management? 03
(b) Compare role of Leader, Administrator, and Manager in organization. 04
(c) List and Explain Various Functions of Management. 07
OR
Q.5 (a) How CSR can provide benefits to society? 03
(b) How Ethical Processes are useful in establishing Brand? 04
(c) Discuss the external and internal sources of recruitment in detail. 07
***********
2

Instructions:
MARKS
Q.1 (a) Explain macroeconomics and microeconomics 03
(b) Explain the theory of demand and supply 04
(c) Explain elasticity of demand and its types in detail 07
Q.2 (a) Define : (1) Fixed Cost (2) Sunk Cost (3) Opportunity Cost 03
(b) Explain factors of production in detail 04
(c) Explain break even analysis with suitable curve 07
OR
(c) Explain Perfect Competition and Monopoly markets. 07
Q.3 (a) Define : (1) GDP (2) GNP (3) National Income 03
(b) Explain different types of Unemployment 04
(c) What is Fiscal Policy? Explain its objectives in detail 07
OR
Q.3 (a) Define : (1) Money (2) CRR (3) Repo Rate 03
(b) Explain measures to control Inflation. 04
(c) What is RBI? Explain functions of RBI 07
Q.4 (a) Explain centralization and decentralization 03

(b) Difference between management and administration 04
(c) Which are the main functions of management? Explain importance of 07
organizing in detail.
OR
Q.4 (a) Difference between formal and informal organization 03
(b) Explain Maslow’s theory of human needs 04
(c) List various types of organization. Explain any one type in details 07
Q.5 (a) Explain internal and external environment of organization 03

(b) Explain various management skills 04
(c) What is CSR? Explain its importance. 07
OR
Q.5 (a) Explain organizational culture and its importance 03
(b) Explain role of Managers 04
(c) What is business ethics? Explain importance of business ethics. 07
*************

Gtu 4th It Question Paper

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Gtu 4th It Question Paper

Uploaded by

Copyright:

Available Formats

Seat No.: ________ Enrolment No.

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.4 (a) Draw and criticize memory hierarchy in a computer system. 03

Q.5 (a) Summarize major hazards in pipelined execution. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.1 (a) Explain three state buffers. 03

Q.2 (a) Differentiate assembly language and machine language. 03

Q.3 (a) Define followings: 03

Q.4 (a) Enlist the characteristics of RISC. 03

Q.5 (a) What is the importance of virtual memory? 03

GUJARAT TECHNOLOGICAL UNIVERSITY

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.1 (a) What is binary and decimal equivalent of F8 hexadecimal value? 03

Q.2 (a) What is arithmetic micro operation? 03

Q.3 (a) List out Register for basic computer. 03

Q.4 (a) Draw flowchart of first pass assembler. 03

Q.5 (a) Explain register stack. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.2 (a) Define Partial Order Relation. Illustrate with an example. 03

“All healthy people eat an apple a day.

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.1 (a) Show that for any two sets 𝐴 and 𝐵, 𝐴 − (𝐴 ∩ 𝐵) = 𝐴 − 𝐵. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.2 (a) Explain types of a Relation with a suitable example. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

(c) 1) Use a truth table to verify the De Morgan’s law 07

(b) For the following relations on the set of real numbers, 04

Q.4 (a) Explain Path and Circuit of a graph. 03

(c) 1) Define Subtree and Degree of a Node 07

(b) 1) Define incidence Matrix of a Graph 04

(c) 1) Define: M-ary Tree and Binary Tree. 07

(b) Let 𝐻 = {1, – 1} and 𝐺 = {1, – 1, 𝑖, – 𝑖} . (𝐻,×) is a sub-group (𝐺,×). 04

(b) Write the equivalence classes for congruence modulo 4 i.e.. z4 04

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.2 (a) Explain constructor with the help of an example. 03

Q.4 (a) List out various layout panes in JavaFX. 03

Q.5 (a) What is Java Collection? 03

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.2 (a) What is an interface? Explain with example. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.2 (a) Explain following Java keywords using appropriate examples: 3

Q.3 (a) Defines types of inheritance. 3

Q.4 (a) Define Encapsulation and access specifier 3

Q.5 (a) Explain following Java keywords using appropriate examples: 3

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.1 (a) Describe the four conditions that create deadlock. 03

Q.3 (a) Describe characteristics of monitor. 03

Process Arrival Time Execution Time Priority

Q.5 (a) Describe the function of kernel in operating system. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

Q.1 (a) Differentiate between Multi-Programming and Multi-Processing System. 03

Q.2 (a) Explain Fragmentation. 03

a. Draw a Gantt chart to show how these processes would be

Q.4 (a) What is interrupt? How it is handle by operating system. 03

Q.5 (a) Write about Resource Allocation Graph algorithm. 03

GUJARAT TECHNOLOGICAL UNIVERSITY

Mutual Exclusion ,Thrashing , Thread

(c) What is operating system? Give the view of OS as a resource manager. 07

Q.2 (a) Explain the following UNIX Commands 03

(b) Discuss Demand paging in detail. 04

(c) Explain producer-consumer problem and solve it using semaphore. 07

(b) Write a short note on Critical Section. 04