UPPCL AE 2019

Question 1
Consider the binary relation R=(x,y),(x,z),(z,x),(z,y)on the set x,y,z. Which of the following is TRUE?
A
R is neither symmetric nor antisymmetric
B
R is both symmetric and anti-symmetric
C
R is symmetric but not antisymmetric
D
R is not symmetric but anti-symmetric
Question 1 Explanation: 
Let A be a set in which the relation R is defined. Then R is said to be a symmetric relation, if (a, b) ∈ R ⇒ (b, a) ∈ R, that is, aRb ⇒ bRa for all (a, b) ∈ R. The relation R is antisymmetric, specifically for all a and b in A; if R(x, y) with x ≠ y, then R(y, x) must not hold. Or similarly, if R(x, y) and R(y, x), then x = y. Therefore, when (x,y) is in relation to R, then (y, x) is not. Here, x and y are nothing but the elements of set A.
Question 2
Which type of address is 255.255.255.255 according to IPv4 addressing?
A
Limited broadcast address
B
Multicast address
C
Direct broadcast address
D
Loopback address
Question 2 Explanation: 
A broadcast address is a network address used to transmit to all devices connected to a multiple-access communications network. A message sent to a broadcast address may be received by all network-attached hosts. A multicast address is used to address a specific group of devices, and a unicast address is used to address a single device. IPv4 address 255.255.255.255 is used as a limited broadcast address. Limited broadcast address 255.255.255.255 can appear as the only destination address in the IPv4 header. Limited broadcast is a type of broadcast which is limited to the Local Area Network (LAN). Routers will not forward limited broadcast IPv4 datagram packets because these broadcasts are not relevant to other networks and cause flooding everywhere in the Internet. So, the scope of limited broadcasts is limited to the Local Area Network (LAN).
Question 3
Which of the following memory types is volatile in nature?
A
Compact disk
B
Magnetic disk
C
ROM
D
RAM
Question 3 Explanation: 
Volatile memory, in contrast to non-volatile memory, is computer memory that requires power to maintain the stored information; it retains its contents while powered on but when the power is interrupted, the stored data is quickly lost. Volatile memory has several uses including as primary storage. In addition to usually being faster than forms of mass storage such as a hard disk drive, volatility can protect sensitive information, as it becomes unavailable on power-down. Most general-purpose random-access memory (RAM) is volatile
Question 4
In Two-phase locking protocol, each transaction issues lock and unlock requests in ______ phases.
A
Four
B
Five
C
Three
D
Two
Question 4 Explanation: 
In databases and transaction processing, two-phase locking (2PL) is a concurrency control method that guarantees serializability. It is also the name of the resulting set of database transaction schedules (histories). The protocol uses locks, applied by a transaction to data, which may block (interpreted as signals to stop) other transactions from accessing the same data during the transaction's life. By the 2PL protocol, locks are applied and removed in two phases: Expanding phase: locks are acquired and no locks are released. Shrinking phase: locks are released and no locks are acquired.
Question 5
Which of the following can be considered as a weak entity?
A
Edition
B
Book
C
Publisher
D
Author
Question 5 Explanation: 
In a relational database, a weak entity is an entity that cannot be uniquely identified by its attributes alone; therefore, it must use a foreign key in conjunction with its attributes to create a primary key.
Question 6
Consider the following relation schema: Product (id, name, price) What will be the output of the following SQL code? SELECT max(price) FROM Product WHERE price < (SELECT max(price) FROM Product);
A
Highest price of a product
B
Lowest price of a product
C
Second highest price of a product
D
Second lowest price of a product
Question 6 Explanation: 
Second highest price of a product
Question 7
Which of the following represents the language corresponding to the regular expression r = (aa) * (bb) * b?
A
L(r)=a2nb2m:n0,m0
B
L(r)=a2nb2m:n1,m1
C
L(r)=a2nb2m+1:n0,m0
D
L(r)=a2nb2m+1:n1,m1
Question 8
In Classful addressing for class A, how many valid maximum possible network ids can exist?
A
129
B
127
C
128
D
126
Question 9
Match the following:
A. SLR(1) 1. Medium powerful & medium cost
B. LALR(1) 2. Less powerful and less cost
C. CLR(1) 3. More powerful and more costly
A
A-1, B-3, C-2
B
A-2, B-1, C-3
C
A-1, B-2, C-3
D
A-3, B-2, C-1
Question 10
Which of the following statements is/are FALSE?
(i) By definition a relation schema is in first normal form.
(ii) A relation schema which is in third normal form is definitely in BCNF.
A
Only (ii)
B
Neither (i) nor (ii)
C
Both (i) and (ii)
D
Only (i)
Question 11
Which of the following statements are FALSE?
(i) The total length of the UDP header is 8 bytes.
(ii) DNS makes use of UDP.
(iii) The checksum field in UDP is assigned 8 bits.
(iv) UDP requires connection establishment and connection termination between sender and receiver
A
Only (i) and (iii)
B
Only (i) and (ii)
C
Only (iii) and (iv)
D
Only (ii) and (iv)
Question 12
Let R(A,B,C,D) be a relation schema and F=ABC,ABD,BCbe the set of functional dependencies defined over R. Which of the following represents the closure of the attribute set B?
A
{A, C, D}
B
{B, C}
C
{B}
D
{A, B, C}
Question 13
What is the sum of the Hexadecimal numbers (FF)16 and (BA)16?
A
(B9)16
B
(139)16
C
(1B9)16
D
(2B9)16
Question 14
Which of the following represents (-0.75)10 in IEEE 754 Single Precision (Binary32) Format?
A
1 1000 0000 1000 0000 0000 0000 0000 0000
B
1 0111 1110 1000 0000 0000 0000 0000 0000
C
1 0111 1111 1000 0000 0000 0000 0000 0000
D
1 1000 0000 1100 0000 0000 0000 0000 0000
Question 15
All register reference instructions that use an accumulator are _____ instructions.
A
Direct address mode
B
Implied-mode
C
Register-mode
D
Immediate-mode
Question 16
Which of the following is the postfix equivalent of (9-5)+2?
A
-95+2
B
95+2-
C
95-2+
D
+-952
Question 17
The following algorithm gets the number of digits in factorial of a positive integer n. Which of the following is NOT a time complexity of this algorithm?
Algorithm getNoOfDigitsInFactorialOf(n) { nd = 0
for i = 1 to n do {nd = nd + log10(i) }
nd = ceil(nd) + 1 return nd}
A
BigOmega(log n)
B
BigOh(n)
C
BigOmega(log n)
D
BigTheta(n)
Question 18
Three boxes contain 6 red, 4 black; 4 red, 6 black; and 5 red, 5 black balls respectively. One of the boxes is selected at random and a ball is drawn from it. If the ball drawn is red, then what will be the probability that it is drawn from the first box?
A
3/5
B
1/3
C
1/2
D
2/5
Question 19
Consider the height of a tree as the number of edges in the longest path between the root node and leaf nodes. If T is a min heap of height 3, then what is the smallest number of nodes that T can have?
A
8
B
4
C
15
D
7
Question 20
Which of the following is FALSE?
A
2’s complement of a 2’s complement of a number is the number itself.
B
In the 7-bit Hamming code of BCD, the parity bits are placed at 1, 2 and 4 locations.
C
Excess-3 code for 369 is 011110011100.
D
A 1-bit gray code has two code words 0 and 1 representing decimal numbers 0 and 1, respectively.
Question 21
In a file system, a(n) _______ defined a path from the current directory.
A
Virtual path name
B
Relative path name
C
Root directory
D
Absolute path name
Question 22
Which of the following is not a valid storage class in ‘C’?
A
static
B
auto
C
register
D
dynamic
Question 23
In IPv6 datagram header, which field signifies the number of hops allowed before a packet reaches the destination?
A
Time to live
B
Identification
C
Fragmentation offset
D
Hop limit
Question 24
Which of the following is a technique of gradually increasing the priority of processes that wait in the system for a long time?
A
Dispatch latency
B
Scheduling
C
Aging
D
Starvation
Question 25
A satellite link with bandwidth 20 kbps has a propagation time of 300 ms. The transmitter employs Go-back-3 ARQ scheme and each frame is assumed to be of 500 bytes. What is the possible throughput?
A
5 kbps
B
6 kbps
C
15 kbps
D
7.5 kbps
Question 26
If r is a regular expression, then which of the following is FALSE?
A
(r*)* = r+
B
∊r = r
C
r* = (r|∊)*
D
r** = r*
Question 27
Which of the following statements is FALSE?
A
A primary index is specified on the ordering key field of an ordered file of records.
B
A secondary index is an ordered file.
C
A primary index is an unordered file.
D
A clustering index is an ordered file.
Question 28
Which of the following is the longest common subsequence of the sequences &lt h, i, n, d, u, i, s, t, a, n &gt and &lt i, n, d, i, a, n &gt ?
A
&lt i, n, d, i, a, n &gt
B
&lt i, n, d, i, a &gt
C
&lt i, n, d, i &gt
D
&lt i, n, d &gt
Question 29
Which one of the following problems is undecidable?
A
Memberships problem for CFGs
B
Equivalence problem for FSAs
C
Finiteness problem for FSAs
D
Ambiguity problem for CFGs
Question 30
Which of the following statements is FALSE?
A
If G1 is unrestricted grammar and G2 is regular grammar then the problem L(G1)L(G2)=is undecidable.
B
If M1and M2are two Turing machines, then the problem L(M1)L(M2) is decidable
C
If a language is non-recursive, then there is no membership algorithm for it.
D
If G1is unrestricted grammar, then the problem L(G1)=L(G2)* is undecidable
Question 31
A 0-1 knapsack problem has four items and knapsack capacity 11. The weight and profit of each item is given in the table below.

Which of the following greedy strategies gives the maximum profit?
A
Lightest item first
B
Largest profit first
C
Heaviest item first
D
Largest profit per unit weight first
Question 32
With respect to RDBMS, a ______ is the unit of data transfer between disk and memory.
A
Block
B
Bit
C
Byte
D
Record
Question 33
schedule in which each transaction is executed atomically is called a ______.
A
Serial schedule
B
Non-parallel schedule
C
Non-serial schedule
D
Parallel schedule
Question 34
Which of the following forms the complete set of Relational Algebra operations?
A
Projection, Union, Set difference, and Cross product
B
Selection, Union, Set difference, and Cross product
C
Selection, Projection, Intersection, Set difference, and Cross product
D
Selection, Projection, Union, Set difference, and Cross product
Question 35
Which of the following code is employed by K-map for simplification of Boolean expression?
A
NBCD
B
Gray code
C
Excess-3 code
D
BCD
Question 36
Which of the following statements is FALSE?
A
The language L={an: n>=4} is NOT regular.
B
A language L is regular if and only if there exists a corresponding DFA to accept it.
C
If L is regular, then L-{λ} is also regular.
D
If L is a regular language, then L2 is also a regular language.
Question 37
What is the port number for SMTP protocol?
A
80
B
22
C
110
D
25
Question 38
Which of the following is not a subsequence of the sequence &lt h, i, n, d, i, s, t, a, n &gt ?
A
&lt i, n, d, i, a &gt
B
&lt h, i, n, d &gt
C
&lt s, t, a, n &gt
D
&lt d, i, s, h &gt
Question 39
______ is a memory-management scheme that supports the user view of RAM.
A
Hit-ratio
B
Fragmentation
C
Segmentation
D
Paging
Question 40
_____ is a program in execution.
A
Program counter
B
Process
C
Stack
D
Heap
Question 41
______ is a memory-management scheme that permits the physical address space of a process to be ______.
A
Thrashing, non-contiguous
B
Thrashing, contiguous
C
Paging, contiguous
D
Paging, non-contiguous
Question 42
A grammar that produces more than one parse tree of a sentence is known as:
A
Non ambiguous
B
Context sensitive
C
Ambiguous
D
Regular
Question 43
Consider the “Supply” relationship relating the entities “Supplier” and “Product”. Under default assumption, what will be the cardinality of the “Supply” relationship?
A
1:N
B
1:1
C
M:N
D
N:1
Question 44
In RDBMS, domain constraint is also called:
A
Tuple constraint
B
Table constraint
C
Database constraint
D
Attribute constraint
Question 45
Consider the following set of processes, and the length of the CPU burst given in ms. What is the average waiting time using priority scheduling?
A
10 ms
B
7.2 ms
C
8.2 ms
D
5.2 ms
Question 46
Which of the following is regular grammar?
A
SabA, AbaB, BaA, Bbb
B
SaSa, SbSb, S
C
SabB, AaaBb, BbbAa, A
D
SaSb, SSS, S
Question 47
Encrypt plain text: THIS IS PLAIN TEXT; given key: SACRED. Use a transposition cipher. Assume padding, if required.
A
STW INV SIU IAT HLX TPE
B
TPE STW SIU HLX INV IAT
C
HLX IAT STW INV SIU TPE
D
IAT HLX STW INV SIU TPE
Question 48
What is the range of the exponent E in IEEE 754 Double Precision (Binary64) format?
A
-1022 <= E <= 1022
B
-1023 <= E <= 1023
C
-1022 <= E <= 1023
D
-1023 <= E <= 1022
Question 49
The number of processes that are completed by a system per time unit, is called ______.
A
Response time
B
Turnaround time
C
Throughput
D
Process output
Question 50
Which of the following is a data structure that is used to hold information about source code during the compilation process?
A
Context free grammar
B
Intermediate code
C
Lexical analyzer
D
Process output
There are 50 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

Register Now

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access