| Post Name | ASST. PROFESSOR COMPUTER SCIENCE AND ENGINEERING - TECH. EDUCATION (ENGG. COLLEGES) |
|---|---|
| Question Paper Code | 088/2023 |
| Category Code | 723/2021 |
| Date of Test | 23 June 2023 |
| Medium of Question | ENGLISH |
| Exam Type | OMR Examination |
| Total Questions | 100 |
1
Which of the following function is not a mathematical function?
Answer
B. one-to -many
2
Which of the following is a binary operation on ?
Answer
B. Multiplication
3
If the set A = {1, 3} and set B =
Answer
C. { (3,
4
If p * q = (p³ + q³)^(1/3) on the real numbers, then * is:
Answer
C. both commutative and associative
5
The mapping φ from ℝ* to ℝ* defined by φ(x) = |x| is a homomorphism with ker(φ) = ?
Answer
C. {1, −1}
6
The matrix A = [[−3, −1], [2, 0]] satisfies which relation?
Answer
C. (A + I)(A + 2I) = 0
7
For a matrix A , the row space of AT is same as :
Answer
B. Column space of A
8
If the matrix B is diagonalizable, then:
Answer
C. Bᴺ = PDᴺP⁻¹
9
Find the eigen vector for the value of λ = −2 for the given matrix A = :
3 1
0 1
Answer
B.
− 1 − 1
− 1 1
10
What is the determinant of the matrix whose eigen values are 4, 3, 5 ?
Answer
D. 60
11
What is the chromatic polynomial for a complete graph k3 ?
Answer
C. t (t − 1) (t − 2)
12
What is the number of spanning trees in a complete graph k5 ?
Answer
B. 53
13
If G is a connected plane graph of order u, size e, and with faces f, then :
Answer
A. u−e+f =2
14
For propositions r and s, which is incorrect?
Answer
C. ¬(r ∨ s) ≡ ¬r ¬s
15
p ∨ q is logically equivalent to :
Answer
C. ~ p→ q
16
In how many ways can we rearrange the letters in ‘‘MATHS IS FUN’’ with the first and last
letter must be vowels?
Answer
A. 3 × 8!
17
Which of the following is a tautology?
Answer
B. (( p ∨ q )∧ ~ p) → q
18
How many numbers are there between 99 and 1000 having at least one of their digits 3?
Answer
B. 252
19
What is the chromatic number of a complete graph k15 ?
Answer
B. 15
20
You are a start-up incubator and you have $10 million to invest in 4 companies (in $1 million
increments). How many ways can you allocate this money?
Answer
B. 286
21
Transmission capacity of a bus consisting of 32 lines is :
Answer
B. 32-bit unit of data (in parallel at a time)
22
Suppose the size of the Main Memory is 32 K * 16 bits. What are the sizes of address bus and
data bus?
Answer
D. Address bus = 15 bits, Data bus = 16 bits
23
How many memory chips of configuration 2K × 16 Bits are required to implement an 8K × 32
Bits memory?
Answer
B. 8
24
In 2’s complement arithmetic overflow can be detected using the logic expression :
Answer
Question Cancelled
25
The DMA module force the processor to suspend operations temporarily to take control over
system bus, this technique is called :
Answer
B. Cycle stealing
26
The TRAP flag is used for :
Answer
A. Debugging
27
The micro code stored in read only memory is :
Answer
B. Firmware
28
A memory assignment system where lower byte addresses are used for less significant bytes
of the word is :
Answer
A. Little endian
29
What is the hexadecimal equivalent of a binary number 11001110?
Answer
D. CE
30
When 1101 is used to divide 100010010 the remainder is :
Answer
D. 1
31
Multiplexing of address bits is done by :
Answer
D. Memory controller
32
The expression
Answer
B. B′
33
The logical X-OR operation of 1110100 and 0110001 is :
Answer
C. 1000101
34
The minimum no of 2 input NAND gates required to realize the function F = AB + C' D' is :
Answer
D. 5
35
In addition to the parallel adders in the last stage, what will be the min. no of carry save
adders required to add 10 numbers?
Answer
B. 8
36
#include
int main() { int i=4,n=2; while (i++<=15) { n++; } printf("n = %d, i = %d", n, i); return 0; }
Answer
C. n=14, i=17
37
If int a [3] [3] [3] = {
{{1,2,3}, {4,5,6}, {7,8,9}},
{{10,11,12}, {13,14,15}, {16,17,18}},
{{19,20,21}, {22,23,24}, {25,26,27}}
};
Which statement will print the value of ‘24’?
Answer
D. printf(“%d”,*(*(*
38
#include
int main() { int a=5,b=10; b=a*(a=11); printf("%d",b); }
Answer
C. 121
39
The return type of sizeof() operator is:
Answer
A. unsigned int
40
––––––––––– function allocates multiple blocks of memory with each block of the same size. :
Answer
A. calloc
41
#include
int main() { { int number=2; number=5; } printf("%d", number); return 0; }
Answer
D. Compile-time error
42
What will be the output of the following code?
#include
int main()
{
int i = 0, j = 0;
for (i = 0; i < 20; i++)
{
for (j=0; j<5; j++)
{
if (i > 2)
continue;
printf(“Kerala \n”);
}
}
return 0;
}
Answer
B. Kerala will be printed 15 times
43
Which all statements are true in C++?:
(i) It is possible to declare functions inside structure in C++
(ii) const qualifier can be applied to functions inside class
(iii) In a class, the default access modifier for class member and member functions is private
(iv) Dynamic polymorphism is another name for compile time polymorphism
Answer
B. (i), (ii) and (iii) only
44
Which all statements are true about operator overloading in C++?
(i) Associativity and precedence of operators does not change
(ii) Ternary or conditional operator (?:) cannot be overloaded
(iii) Only arithmetic operators can be overloaded
Answer
A. (i) and (ii) only
45
Which among the following can be passed by non-type template parameters during compile
time in C++?
Answer
D. constant expression
46
How many constructors can be present inside a class?
Answer
D. Multiple
47
What is the use of this pointer?
Answer
D. All of the above
088/2023 10 A
48
Which of the following statements is true in C++?
(i) A constructor can be virtual
(ii) A destructor can be virtual
(iii) If a class has a pure virtual function, then the class becomes abstract class and an
instance of this class cannot be created
(iv) Virtual functions are functions that can be overridden in derived class with the same
signature
Answer
C. (ii), (iii) and (iv) only
49
#include
using namespace std;
class A { int a; A(){a=2;} };
int main(){ A* obj=new A; cout << obj->a; }
Answer
A. Compilation error
50
Passing the address of a variable is known as:
Answer
Question Cancelled
51
––––––––––– programming paradigm is in which the desired result is declared as the answer
to a question about a system of facts and rules :
Answer
C. Logic
52
––––––––––– binding is used to define the scope in terms of the lexical structure of a
program :
Answer
A. Static scope
53
Program Pro() { a=5; b=2; c=10; fun(b,a,c); print a; print b; print c; } fun(a,b,c) { b=b−2; c=a+b; }
Answer
B. 3, 2, 5
54
Consider the following relational schemes for a database:
R(A, B, C, D, E, F)
S(A, B,
Answer
A. ,
55
A relation schema R is in BCNF if whenever a nontrivial functional dependency X → A
holds in R, then which all statements are true?:
(i) X can be a superkey of R
(ii) X can be a primary key of R
(iii) X can be secondary of R
(iv) X can be any candidate key of R
Answer
C. (i), (ii) and (iv) only
56
A file has 10,000 fixed-length employee records with fields of 30, 12, 40, 10, 8, 1, 4, 8 and 10 bytes plus one deletion-marker byte. For 512-byte blocks and unspanned organization, how many blocks are required?
Answer
B. 2500
57
Consider the three transactions T1 ,T2 and T3 , and the schedule S1 given below:
T1 : r1 ( X ); r1 ( Z ); w1 ( X );
T2 : r2 ( Z ); r2 (Y ); w2 ( Z ); w2 (Y );
T3 : r3 ( X ); r3 (Y ); w3 (Y );
S1 : r1 ( X ); r2 ( Z ); r3 ( X ); r1 ( Z ); r2 (Y )r3 (Y ); w1 ( X ); w2 ( z );
w3 (Y ); w2 (Y )
Which of the following is true?
Answer
A. The Schedule cannot be made serializable
58
Consider a relation, R(A,B,C,D,E,F,G,H,I,J,K) with the following functional dependencies
A → CDE
ABGH → FIJK
GHIJ → ABF
Which attribute or sets of attributes form the candidate keys of the relation R?
Answer
C. ABGH and GHIJ
59
In Entity – Relationship (ER) diagrams, identifying relationship is represented using :
Answer
B. Double diamond
60
Consider a relation, R( A , B ,C , D, E , F ,G ) with the following functional dependencies.
AB → CD, AF → D, DE → F ,C → G , F → E ,G → A
What is the closure of CF?
Answer
A. { ACDEFG }
61
In C language if an array is declared as double arr[50]; how many bytes will be allocated to
it?
Answer
D. 400
62
The postfix expression for the infix expression:
X + Y * ( Z + W ) / I + W * J is
Answer
Question Cancelled
63
Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What
is the worst-case time complexity of the best known algorithm to delete the node x from the
list?
Answer
A. O(n)
64
In the balanced binary tree in the figure given below, how many nodes will become
unbalanced when a node is inserted as a child of the node “g”? :
Answer
B. 3
65
The preorder traversal and inorder traversal sequence of a binary search tree are A, B, D, G,
H, L, E, C, F, I, J, K and G, D, H, L , B, E, A, C, I, F, K, J respectively. Which one of the
following is the postorder traversal sequence of the same tree?
Answer
D. G, L, H, D, E, B, I, K, J, F, C, A
66
A list of n strings, each of length n, is sorted into lexicographic order using the merge sort
algorithm. The worst-case running time of this computation is:
Answer
B. O(n2 log n)
67
Match the algorithms with their time complexities::
List-I
Answer
C. P – (iii), Q – (iv), R – (ii), S – (i)
68
A sorting technique is called stable if:
Answer
B. It maintains the relative order of occurrence of non-distinct elements
69
Which of the following is an application of dynamic programming?:
Answer
D. Both
70
Which of the following branch and bound strategy leads to DFS?
Answer
A. LIFO branch and bound
71
A discovery of a polynomial-time algorithm for any of the known NP-complete problems
would imply that :
Answer
A. P = NP
72
The smallest FA which accepts the language {x/length length of x is divisible by 3} has:
Answer
B. 3 states
73
Which of the following regular expressions over
Answer
C. 0*1*01
74
Choose the correct statements for regular languages:
Answer
Question Cancelled
75
What language is generated by the CFG S→aSb, S→aAb, S→aBb, A→aA/a, B→Bb/b, with V={S,A,B}, T={a,b}?
Answer
Question Cancelled
76
Context free languages are closed under:
Answer
B. Union, Kleene closure
77
The stack in PDA has:
Answer
A. unlimited memory
78
Which of the following conversion is not possible
Answer
C. Non-deterministic PDA to deterministic PDA
79
If a Context Free Grammar is generating finite number of strings, then it is a ________
grammar.:
Answer
B. Non-recursive
80
In some programming languages, an identifier is permitted to be a letter followed by any
number of letters or digits. If L and D denotes the sets of letter and digits respectively. Which
of the following expression defines an identifier?
Answer
B. L(L+
81
Among simple LR(SLR), canonical LR and look-ahead LR (LALR), which of the following
pairs identify the method that is very to implement and the method that is most powerful in
that order?
Answer
Question Cancelled
82
Consider the following C code segment:
for (i=0, i
Answer
D. There is scope of dead code elimination in this code
83
Which type of values should be held in registers:
Answer
D. All of the above
84
Loading process can be divided into two separate programs, to solve some problems. If the
first is binder, then the other is:
Answer
B. Module Loader
85
If a linker is given object modules for a set of programs that were compiled separately then
what information need not be included in an object module?
Answer
D. Absolute addresses of internal symbols
86
Round-robin scheduling :
Answer
C. gives each task the same chance at the processor
87
Which of the following statements is false?
Answer
B. internal fragmentation is increased with small pages
88
The Banker’s algorithm is used:
Answer
C. to prevent deadlock
89
Information about a process is maintained in :
Answer
B. Process Control Block
90
Consider the statements about process state transitions for a system using pre-emptive
scheduling.
(i) A running process can move to ready state
(ii) A ready process can move to running state
(iii) A blocked process can move to running state
(iv) A blocked process can move to ready state
Which of the above statements are TRUE?
Answer
C. (i), (ii) and (iv) only
91
Which of the statements are true about the short term scheduler:
(i) Select from among the processors that are ready to execute and allocates the
CPU to one of them
(ii) Select processes from mass-storage device and loads them into memory for execution
(iii) The short term scheduler must select a new process for the CPU frequently
(iv) The short term scheduler executes much less frequently
Answer
D. (i) and (iii) only
92
A system using inverted page table where logical address space is 16MB and physical
address space is 8GB and page size is 4KB. Memory is byte addressable and page entry size
is 8 bytes. What is the page table size?
Answer
C. 16 MB
93
Which of the below statement is incorrect?
Answer
B. Demand paging can bring entire process into memory at load time
94
Consider 3 CPU intensive processes, which require 10,20,30 time unit and arrive at times
0,2 and 6 respectively. How many context switches are needed if the OS implements a
shortest remaining first scheduling algorithm?
Answer
B. 2
95
A process has been allocated 3 page frames. Assume that none of the pages of the process are
available in the memory initially. The process makes the following sequence of page
references (reference string): 1, 2, 1, 3, 7, 4, 5, 6, 3, 1.
If optimal page replacement policy is used, how many page faults occur for the above
reference string?
Answer
A. 7
96
A Page replacement algorithm is to:
Answer
C. Minimize the page fault rate
97
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual
memory system running on a computer system that has main memory size of 3 page frames
which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults
under the corresponding page replacement policy. Then:
Answer
B. OPTIMAL< FIFO
98
Which page replacement policy sometimes leads to more page faults when size of memory is
increased:
Answer
B. FIFO
99
The operating system keeps the table containing information about all open files in :
(i) Per-process table
(ii) Open-file table
(iii) Look ahead table
(iv) Look aside table
Answer
C. (i) and (ii) both
100
Consider three concurrent processes and binary semaphores S0=1, S1=0, S2=0. P0 repeatedly executes wait(S0); print("0"); release(S1); release(S2). P1 executes wait(S1); release(S0), and P2 executes wait(S2); release(S0). How many times will P0 print "0"?
Answer
A. At least twice
Discussion
Ask a doubt or share a tip.
No comments yet — start the discussion.