Question : 1
Consider the following statements:
(a) The running time of dynamic programming algorithm is always 𝜃(𝜌) where 𝜌 is number of subproblems
(b) When a recurrence relation has a cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program.
(c) For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion and memorization
(d) If a problem 𝑋 can be reduced to a known NP-hard problem, then 𝑋 must be NP-hard
Which of the statement(s) is (are) true?
Only (b) and (a)
Only (b)
Only (b) and (c)
Only (b) and (d)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 2
Let \(𝐺=(𝑉,𝑇,𝑆,𝑃)\) be any context-free grammar without any \(𝜆-\) productions or unit productions. Let \(𝐾\) be the maximum number of symbols on the right of any production in \(𝑃\). The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by:
\((K-1) \mid P \mid + \mid T \mid -1\)
\((K-1) \mid P \mid + \mid T \mid\)
\(K \mid P \mid + \mid T \mid -1\)
\(K \mid P \mid + \mid T \mid\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 3
Which of the following is not needed by an encryption algorithm used in Cryptography?
KEY
Message
Ciphertext
User details
Correct Answer : C or D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 4
A non-pipelined system takes 30ns to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of 10ns. Determine the speed up of the pipeline for 100 tasks.
3
4
3.91
2.91
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 5
Which tag is used to enclose any number of javascript statements in HTML document?
<code>
<script>
<title>
<body>
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 6
Consider the following languages:
\(L_1 = \{ a^nb^nc^m \} \cup \{a^nb^mc^m\}, n, m \geq 0\)
\(L_2 =\{ww^R \mid w \in\{ a, b \}^*\}\) Where \(𝑅\) represents reversible operation.
Which one of the following is (are) inherently ambiguous languages(s)?
Only \(𝐿_1\)
Only \(𝐿_2\)
both \(𝐿_1\) and \(𝐿_2\)
neither \(𝐿_1\) nor \(𝐿_2\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 7
Match List – I with List-II:
\(\begin{array}{llll} &\textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Frame attribute} & \text{(i)} & \text{to create link in HTML} \\ \text{(b)}& \text{<tr> tag} & \text{(ii)} & \text{for vertical alignment of content in cell} \\ \text{(c)} & \text{Valign attribute} & \text{(iii)}& \text{to enclose each row in table} \\ \text{(d)} & \text{<a> tag} & \text{(iv)}& \text{to specify the side of the table} \\ &&& \text{frame that display border} \\ \end{array}\)
Choose the correct option from those given below:
\((a)-(i) , (b)-(ii), (c)-(iii), (d)-(iv) \)
\((a)-(ii) , (b)-(i), (c)-(iii), (d)-(iv) \)
\((a)-(iv) , (b)-(iii), (c)-(ii), (d)-(i) \)
\((a)-(iii) , (b)-(iv), (c)-(ii), (d)-(i)\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 8
A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network?
1,000,000 bps
2,000,000 bps
12,000,000 bps
1,200,00,000 bps
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 9
Consider \(∑=\{𝑤,𝑥\}\) and \(𝑇=\{𝑥,𝑦,𝑧\}\). Define homomorphism \(ℎ\) by:
\(ℎ(𝑥)=𝑥𝑧𝑦 \\ ℎ(𝑤)=𝑧𝑥𝑦𝑦\)
If \(𝐿\) is the regular language denoted by \(𝑟=(𝑤+𝑥^∗)(𝑤𝑤)^∗\), then the regular language \(ℎ(𝐿)\) is given by
\((𝑧𝑥𝑦𝑦+𝑥𝑧𝑦)(𝑧𝑥𝑦𝑦) \)
\((𝑧𝑥𝑦𝑦+(𝑥𝑧𝑦)^∗)(𝑧𝑥𝑦𝑦𝑧𝑥𝑦𝑦)^∗ \)
\((𝑧𝑥𝑦𝑦+𝑥𝑧𝑦)(𝑧𝑥𝑦𝑦)^∗ \)
\((𝑧𝑥𝑦𝑦+(𝑥𝑧𝑦)^∗)(𝑧𝑥𝑦𝑦𝑧𝑥𝑦𝑦)\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 10
A tree has \(2𝑛\) vertices of degree 1,\( 3𝑛\) vertices of degree 2, \(𝑛\) vertices of degree 3. Determine the number of vertices and edges in tree.
12,11
11,12
10,11
9,10
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 11
Given CPU time slice of \(2ms\) and following list of processes.
\(\begin{array}{ccc} \text{Process} & \text{Burst time} & \text{Arrival time} \\ & \text{(ms)} \\ p_1 & 3 & 0 \\ p_2 & 4 & 2 \\ p_3 & 5 & 5 \end{array}\)
Find average turnaround time and average waiting time using round robin CPU scheduling?
4,0
5.66,1.66
5.66,0
7,2
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 12
Consider the following statements:
\(𝑆_1\): If a group \((𝐺,∗)\) is of order \(𝑛\), and \(𝑎∈𝐺\) is such that \(𝑎^𝑚=𝑒\) for some integer \(𝑚≤𝑛\), then \(𝑚\) must divide \(𝑛\).
\(𝑆_2\): If a group \((𝐺,∗)\) is of even order, then there must be an element \(𝑎∈𝐺\) such that \(𝑎≠𝑒\) and \(𝑎∗𝑎=𝑒\).
Which of the statements is (are) correct?
Only \(𝑆_1\)
Only \(𝑆_2\)
Both \(𝑆_1\) and \(𝑆_2\)
Neither \(𝑆_1\) and \(𝑆_2\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 13
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated.
\(𝜃(1),𝜃(𝑛) \)
\(𝜃(𝑛),𝜃(1) \)
\(𝜃(1),𝜃(1) \)
\( 𝜃(𝑛),𝜃(𝑛)\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 14
Consider the following statements:
\(𝑆_1\): These exists no algorithm for deciding if any two Turing machines \(𝑀_1\) and \(𝑀_2\) accept the same language
\(𝑆_2\): Let \(𝑀_1\) and \(𝑀_2\) be arbitrary Turing machines. The problem to determine \(𝐿(𝑀_1)⊆𝐿(𝑀_2)\) is undecidable
Which of the statements is (are) correct?
Only \(𝑆_1\)
Only \(𝑆_2\)
Both \(𝑆_1\) and \(𝑆_2\)
Neither \(𝑆_1\) nor \(𝑆_2\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 15
Suppose a system has 12 magnetic tape drives and at time \(𝑡_0\), three processes are allotted tape drives out of their need as given below:
\(\begin{array}{ccc} & \text{Maximum Needs} & \text{Current Needs} \\ p_0 & 10 & 5 \\ p_1 & 4 & 2 \\ p_2 & 9 & 2 \end{array}\)
At time \(𝑡_0\), the system is in safe state. Which of the following is safe sequence so that deadlock is avoided?
\(⟨𝑝_0,𝑝_1,𝑝_2⟩ \)
\(⟨𝑝_1,𝑝_0,𝑝_2⟩ \)
\(⟨𝑝_2,𝑝_1,𝑝_0⟩ \)
\(⟨𝑝_0,𝑝_2,𝑝_1⟩\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 16
Let \(W_{𝑖𝑗}\) represents weight between node \(𝑖\) at layer \(𝑘\) and node \(𝑗\) at layer \((𝑘−1)\) of a given multilayer perceptron. The weight updation using gradient descent method is given by
\(\textbf{W}_{ij}(t+1) = \textbf{W}_{ij}(t)+ \alpha \dfrac{\partial \textbf{E}}{\partial \textbf{W}_{ij}}, 0 \leq \alpha \leq 1\)
\(\textbf{W}_{ij}(t+1) = \textbf{W}_{ij}(t)- \alpha \dfrac{\partial \textbf{E}}{\partial \textbf{W}_{ij}}, 0 \leq \alpha \leq 1\)
\(\textbf{W}_{ij}(t+1) = \alpha \dfrac{\partial \textbf{E}}{\partial \textbf{W}_{ij}}, 0 \leq \alpha \leq 1\)
\(\textbf{W}_{ij}(t+1) = – \alpha \dfrac{\partial \textbf{E}}{\partial \textbf{W}_{ij}}, 0 \leq \alpha \leq 1\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 17
The Reduced Instruction Set Computer (RISC) characteristics are:
(a) Single cycle instruction execution
(b) Variable length instruction formats
(c) Instructions that manipulates operands in memory
(d) Efficient instruction pipeline
Choose the correct characteristics from the options given below:
(a) and (b)
(b) and (c)
(a) and (d)
(c) and (d)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 18
A micro instruction format has microoperation field which is divided into 2 sunbfields 𝐹1 and 𝐹2 , each having 15 distinct microoperations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field AD. The address space is of 128 memory words. The size of micro instruction is:
19
18
17
20
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 19
In a B-Tree, each node represents a disk block. Suppose one block holds 8192 bytes. Each key uses 32 bytes. In a B-tree of order 𝑀 there are 𝑀−1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is
32𝑀−32
36𝑀–32
36𝑀–36
32𝑀–36
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 20
Which of the component module of DBMS does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query?
query compiler
query optimizer
Stored data manager
Database processor
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 21
Consider the following grammar:
\(𝑆→0𝐴∣0𝐵𝐵 \\ 𝐴→00𝐴∣𝜆 \\ 𝐵→1𝐵∣11𝐶 \\ 𝐶→𝐵 \)
Which language does this grammar generate?
\(L((00)^*0+(11)^*1)\)
\(L(0(11)^*+1(00)^*)\)
\(L((00)^*0)\)
\(L(0(11)^*1)\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 22
Consider the following Linear programming problem (LPP):
Maximize \(𝑧=𝑥_1+𝑥_2\)
Subject to the constraints:
\(𝑥_1+2𝑥_2≤2000 \\ 𝑥_1+𝑥_2≤1500 \\ 𝑥_2≤600 \\ and \ 𝑥_1,𝑥_2≥0\)
The solution of the above LPP is
\(x_1=750, x_2= 750, z=1500\)
\(x_1=500, x_2= 1000, z=1500\)
\(x_1=1000, x_2= 500, z=1500\)
\(x_1=900, x_2= 600, z=1500\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 23
Let 𝐴 be the base class in C++ and 𝐵 be the derived class from 𝐴 with protected inheritance. Which of the following statement is false for class 𝐵?
Member function of class 𝐵 can access protected data of class 𝐴
Member function of class 𝐵 can access public data of class 𝐴
Member function of class 𝐵 cannot access private data of class 𝐴
Object of derived class 𝐵 can access public base class data
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 24
Given two tables
EMPLOYEE (EID, ENAME, DEPTNO)
DEPARTMENT (DEPTNO, DEPTNAME)
Find the most appropriate statement of the given query:
Select count (*) ‘total’
from EMPLOYEE
where DEPTNO IN (D1,D2)
group by DEPTNO
having count (*) >5
Total number of employees in each department 𝐷1 and 𝐷2
Total number of employees of department 𝐷1 and 𝐷2 if their total is >5
Display total number of employees in both departments 𝐷1 and 𝐷2
The output of the query must have at least two rows
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 25
Which of the following are legal statements in 𝐶 programming language?
(a) int *P=&44;
(b) int *P=&r;
(c) int P=&a;
(d) int P=a;
Choose the correct option:
(a) and (b)
(b) and (c)
(b) and (d)
(a) and (d)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 26
Which of the following binary codes for decimal digits are self complementing?
(a) 8421 code
(b) 2421 code
(c) excess-3 code
(d) excess-3 gray code
Choose the correct option:
(a) and (b)
(b) and (c)
(c) and (d)
(d) and (a)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 27
Consider the following statements:
\(S_1 : \forall x P(x) \vee \forall x Q(x)\) and \(\forall x (P(x) \vee Q(x))\) are not logically equivalent.
\(S_2 : \exists x P(x) \wedge \exists x Q(x)\) and \(\exists x (P(x) \wedge Q(x))\) are not logically equivalent.
Which of the following statements is/are correct?
Only \(𝑆_1\)
Only \(𝑆_2\)
Both \(𝑆_1\) and \(𝑆_2\)
Neither \(𝑆_1\) nor \(𝑆_2\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 28
Consider a paging system where translation look aside buffer (TLB) a special type of associative memory is used with hit ratio of 80%.
Assume that memory reference takes 80 nanoseconds and reference time to TLB is 20 nanoseconds. What will be the effective memory access time given 80% hit ratio?
110 nanoseconds
116 nanoseconds
200 nanoseconds
100 nanoseconds
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 29
According to the ISO−9126 Standard Quality Model, match the attributes given in List-I with their definitions in List-II:
\(\begin{array}{llll} & \text{List I} & & \text{List II} \\ \text{(a)} & \text{Functionality} & \text{(i)} & \text{Relationship between level of} \\ &&& \text{performance and amount of resources} \\ \text{(b)} & \text{Reliability} & \text{(ii)} & \text{Characteristics related with} \\ &&& \text{achievement of purpose} \\ \text{(c)} & \text{Efficiency} & \text{(iii)}& \text{Effort needed to make for improvement} \\ \text{(d)} & \text{Maintainability} & \text{(iv)} & \text{Capability of software to maintain} \\ &&& \text{performance of software} \\ \end{array}\)
Choose the correct options from the ones given below:
\(\text{(a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)}\)
\(\text{(a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)}\)
\(\text{(a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)}\)
\(\text{(a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)}\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 30
Identify the circumstances under which pre-emptive CPU scheduling is used:
(a) A process switches from Running state to Ready state
(b) A process switches from Waiting state to Ready state
(c) A process completes its execution
(d) A process switches from Ready to Waiting state
Choose the correct option:
(a) and (b) only
(a) and (d) only
(c) and (d) only
(a), (b), (c) only
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 31
Which of the following interprocess communication model is used to exchange messages among co-operative processes?
Shared memory model
Message passing model
Shared memory and message passing model
Queues
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 32
Consider the following statements with respect to network security:
(a) Message confidentiality means that the sender and the receiver expect privacy
(b) Message integrity means that the data must arrive at the receiver exactly as they were sent.
(c) Message authentication means the receiver is ensured that the message is coming from the intended sender
Which of the statements is (are) correct?
Only (a) and (b)
Only (a) and (c)
Only (b) and (c)
(a), (b) and (c)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 33
If we want to resize a 1024×768 pixels image to one that is 640 pixels wide with the same aspect ratio, what would be the height of the resized image?
420 Pixels
460 Pixels
480 Pixels
540 Pixels
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 34
The time complexity to multiply two polynomials of degree 𝑛 using Fast Fourier transform method is:
\(𝜃(𝑛\lg𝑛) \)
\(𝜃(𝑛^2) \)
\(𝜃(𝑛) \)
\( 𝜃(lg \ 𝑛)\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 35
Consider the following learning algorithms:
(a) Logistic repression
(b) Back propogation
(c) Linear repression
Which of the following option represents classification algorithms?
(a) and (b) only
(a) and (c) only
(b) and (c) only
(a), (b) and (c)
Correct Answer : MTA
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 36
The following multithreaded algorithm computes transpose of a matrix in parallel:
p Trans \((𝑋,𝑌,𝑁)\)
if \(𝑁=1\)
then \(𝑌[1,1]←𝑋[1,1]\)
else partition \(𝑋\) into four \((𝑁/2)×(𝑁/2)\) submatrices \(X_{11}, X_{12}, X_{21}, X_{22}\)
partition 𝑌 into four \((𝑁/2)×(𝑁/2)\) submatrices \(Y_{11}, Y_{12}, Y_{21}, Y_{22}\)
spawn p Trans \((X_{11}, Y_{11}, N/2)\)
spawn p Trans \((X_{12}, Y_{12}, N/2)\)
spawn p Trans \((X_{21}, Y_{21}, N/2)\)
spawn p Trans \((X_{22}, Y_{22}, N/2)\)
What is the asymptotic parallelism of the algorithm?
\(T_1 / T_\infty\) or \(\theta(N^2/ \lg N)\)
\(T_1 / T_\infty\) or \(\theta(N/ \lg N)\)
\(T_1 / T_\infty\) or \(\theta(\lg N/N^2)\)
\(T_1 / T_\infty\) or \(\theta(\lg N / N)\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 37
Two concurrent executing transactions 𝑇1 and 𝑇2 are allowed to update same stock item say ′A′ in an uncontrolled manner. In such scenario, following problems may occur:
(a) Dirty read problem
(b) Lost update problem
(c) Transaction failure
(d) Inconsistent database state
Which of the following option is correct if database system has no concurrency module and allows concurrent execution of above two transactions?
(a), (b) and (c) only
(c) and (d) only
(a) and (b) only
(a), (b) and (d) only
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 38
Which of the following statements are true regarding C++?
(a) Overloading gives the capability to an existing operator to operate on other data types
(b) Inheritance in object oriented programming provides support to reusability
(c) When object of a derived class is defined, first the constructor of derived class is excecuted then constructor of a base class is executed
(d) Overloading is a type of polymorphism
Choose the correct option from those given below:
(a) and (b) only
(a), (b) and (c) only
(a), (b) and (d) only
(b), (c) and (d) only
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 39
Match the Agile Process models with the task performed during the model:
\(\begin{array}{llll} & \text{List I} && \text{List II} \\ \text{(a)} & \text{Scrum} & \text{(i)} & \text{CRC cards} \\ \text{(b)} & \text{Adaptive software development} & \text{(ii)} & \text{Sprint backlog} \\ \text{(c)}& \text{Extreme programming} & \text{(iii)} & \text{<action> the <result> <by/for/of/to>} \\ &&& \text{a(n) <object>} \\ \text{(d)} & \text{Feature-driven development} & \text{ (iv)} & \text{Time box release plan} \\ \end{array}\)
Choose the correct option from those given below:
\(\text{(a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)}\)
\(\text{(a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)}\)
\(\text{(a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)}\)
\(\text{(a)-(i), (b)-(iv), (c)-(ii), (d)-(iii)}\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 40
A counting semaphore is initialized to 8. 3 wait ( ) operations and 4 signal ( ) operations are applied. Find the current value of semaphore variable.
9
5
1
4
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 41
Consider the following statements with respect to approaches to fill area on raster systems:
𝑃: To determine the overlap intervals for scan lines that cross the area
𝑄: To start from a given interior position and pain outward from this point until we encounter the specified boundary conditions.
Select the correct answer from the options given below:
𝑃 only
𝑄 only
Both 𝑃 and 𝑄
Neither 𝑃 nor 𝑄
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 42
Piconet is a basic unit of a bluetooth system consisting of __________ master node and up to _________ active slave nodes.
one, five
one, seven
two, eight
one, eight
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 43
Consider the following:
(a) Trapping at local maxima
(b) Reaching a plateau
(c) Traversal along the ridge
Which of the following option represents shortcomings of the hill climbing algorithm?
(a) and (b) only
(a) and (c) only
(b) and (c) only
(a), (b) and (c)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 44
According to Dempster-Shafer theory for uncertainity management,
Where Bel(𝐴) denotes Belief of event 𝐴.
1
2
3
4
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 45
Find minimum number of tables required for converting the following entity relationship diagram into relational database?
2
4
3
5
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 46
Consider the following statements with respect to duality in LPP:
(a) The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself
(b) If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution
(c) If either problem has an unbounded optimum solution, then the other problem has no feasible solution at all
Which of the statements is (are) correct?
Only (a) and (b)
Only (a) and (c)
only (b) and (c)
(a), (b) and (c)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 47
The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of these four steps?
an expansion permutation, 𝑆-boxes, an XOR operation, a straight permutation
an expansion permutation, an XOR operation, 𝑆-boxes, a straight permutation
a straight permutation, 𝑆-boxes, an XOR operation, an expansion permutation
a straight permutation, an XOR operation, 𝑆-boxes, an expansion permutation
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 48
Give asymptotic upper and lower bound for \(𝑇(𝑛)\) given below. Assume \(𝑇(𝑛)\) is constant for \(𝑛≤2\). Assume \(𝑇(𝑛)\) is constant for \(𝑛≤2\). \(T(n) = 4T( \sqrt{n} ) + \lg^2n\)
\(T(n) = \theta (\lg ( \lg ^2 n) \lg n )\)
\(T(n) = \theta ( \lg ^2 n \lg n )\)
\(T(n) = \theta (\lg ^2 n \lg \lg n )\)
\(T(n) = \theta (\lg ( \lg n) \lg n )\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 49
The full form of ICANN is
Internet Corporation for Assigned Names and Numbers
Internet Corporation for Assigned Numbers and Names
Institute of Cooperation for Assigned Names and Numbers
Internet Connection for Assigned Names and Numbers
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 50
Consider a subnet with 720 routers. If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, then total number of entries in hierarchical table of each router is
25
27
53
72
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 51
In a system for a restaurant, the main scenario for placing order is given below:
(a) Customer reads menu
(b) Customer places order
(c) Order is sent to kitchen for preparation
(d) Ordered items are served
(e) Customer requests for a bill for the order
(f) Bill is prepared for this order
(g) Customer is given the bill
(h) Customer pays the bill
A sequence diagram for the scenario will have at least how many objects among whom the messages will be exchanged
3
4
5
6
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 52
Given two tables 𝑅1(𝑥,𝑦) and 𝑅2(𝑦,𝑧) with 50 and 30 number of tuples respectively. Find maximum number of tuples in the output of natural join between tables 𝑅1 and 𝑅2 i.e. 𝑅1∗𝑅2? (∗- Natural Join)
30
20
50
1500
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 53
Consider the following statements:
(a) Windows Azure is a cloud-based operating system.
(b) Google App Engine is an integrated set of online services for consumers to communicate and share with others.
(c) Amazon Cloud Front is a web service for content delivery.
Which of the following statements is (are) correct?
Only (a) and (b)
Only (a) and (c)
Only (b) and (c)
(a), (b) and (c)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 54
Let 𝐴 = {001,0011,11,101} and 𝐵 = {01,111,111,010}. Similarly, let 𝐶 = {00,001,1000} and 𝐷 = {0,11,011}.
Which of the following pairs have a post-correspondence solution?
Only pair (𝐴,𝐵)
Only pair (𝐶,𝐷)
Both (𝐴,𝐵) and (𝐶,𝐷)
Neither (𝐴,𝐵) nor
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 55
An _______ chart is a project schedule representation that presents project plan as a directed graph. The critical path is the __________ sequence of ________ tasks and it defines project ________.
Activity, Shortest, Independent, Cost
Activity, Longest, Dependent, Duration
Activity, Longest, Independent, Duration
Activity, Shortest, Dependent, Duration
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 56
Consider a weighted directed graph. The current shortest distance from source 𝑆 to node 𝑥 is represented by 𝑑[𝑥]. Let 𝑑[𝑣]=29, 𝑑[𝑢]=15, 𝑤[𝑢,𝑣]=12. What is the updated value of 𝑑[𝑣] based on current information?
29
27
25
17
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 57
Let \(a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n\) and \(a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n\). For \(𝑎=7, 𝑏=17 \ and \ 𝑛=561\), What is the value of \(a^b( \text{mod } n)\)?
160
166
157
67
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 58
Consider the following statements:
(a) Fiber optic cable is much lighter than copper cable
(b) Fiber optic cable is not affected by power surges or electromagnetic interference
(c) Optical transmission is inherently bidirectional
Which of the statements is (are) correct?
Only (a) and (b)
Only (a) and (c)
Only (b) and (c)
(a), (b) and (c)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 59
Which of the following class of IP address has the last address as 223.255.255.255?
Class A
Class B
Class C
Class D
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 60
A computer uses a memory unit of 512𝐾 words of 32 bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to specify one of the 256 registers and an address part. How many bits are there in addressing mode part, opcode part, register code part and the address part?
1,3,9,19
1,4,9,18
1,4,8,19
1,3,8,20
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 61
Consider the following grammars:
\(𝐺_1:𝑆→𝑎𝑆𝑏∣𝑏𝑆𝑎∣𝑎𝑎 \\ 𝐺_2:𝑆→𝑎𝑆𝑏∣𝑏𝑆𝑎∣𝑆𝑆∣𝜆 \\ 𝐺_3:𝑆→𝑎𝑆𝑏∣𝑏𝑆𝑎∣𝑆𝑆∣𝑎 \\ 𝐺_4:𝑆→𝑎𝑆𝑏∣𝑏𝑆𝑎∣𝑆𝑆∣𝑆𝑆𝑆∣𝜆\)
Which of the following is correct w.r.t. the above grammars?
\(𝐺_1\) and \(𝐺_3\) are equivalent
\(𝐺_2\) and \(𝐺_3\) are equivalent
\(𝐺_2\) and \(𝐺_4\) are equivalent
\(𝐺_3\) and \(𝐺_4\) are equivalent
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 62
The sequence diagram given in Figure 1 for the Weather Information System takes place when an external system requests the summarized data from the weather station. The increasing order of lifeline for the objects in the system are:
Sat comms → Weather station → Commslink → Weather data
Sat comms → Comms link → Weather station → Weather data
Weather data → Comms link → Weather station → Sat Comms
Weather data → Weather station → Comms link → Sat Comms
Correct Answer : MTA
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 63
Consider the following language families:
𝐿1≡ The context-free languages
𝐿2≡ The context-sensitive languages
𝐿3≡ The recursively enumerable languages
𝐿4≡ The recursive languages
Which one of the following options is correct?
\(𝐿_1⊆𝐿_2⊆𝐿_3⊆𝐿_4 \)
\(𝐿_2⊆𝐿_1⊆𝐿_3⊆𝐿_4 \)
\(𝐿_1⊆𝐿_2⊆𝐿_4⊆𝐿_3 \)
\(𝐿_2⊆𝐿_1⊆𝐿_4⊆𝐿_3\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 64
When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true?
It can find shortest path within the same graph data structure
Every time a new node is visited, we choose the node with smallest known distance/ cost (weight) to visit first
Shortest path always passes through least number of vertices
The graph needs to have a non-negative weight on every edge
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 65
Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitness of a chromosome in decimal form, \(𝑥\), is given by
\(S f(x) = \dfrac{f(x)}{\Sigma f(x)}\) where \(f(x) = x^2\)
The population is given by \(𝑃\) where:
\(P=\{(01101, (11000), (01000), (10011)\}\)
The strength of fitness of chromosome \((11000)\) is ________
24
576
14.4
49.2
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 66
Match List-I and List-II:
\(\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Isolated I/O} & \text{(i)} & \text{same set of control signal for I/O} \\ &&& \text{and memory communication} \\ \text{(b)} & \text{Memory mapped I/O} & \text{(ii)} & \text{separate instructions for I/O} \\ &&& \text{and memory communication} \\ \text{(c)} & \text{I/O interface} & \text{(iii)} & \text{requires control signals to be} \\ &&& \text{transmitted between the } \\ &&& \text{communicating units} \\ \text{(d)} & \text{Asynchronous data transfer} & \text{(iv)} & \text{resolve the differences in central} \\ &&& \text{computer and peripherals} \\ \end{array}\)
Choose the correct option from those given below:
\((a)-(ii), (b)-(iii), (c)-(iv), (d)-(i) \)
\((a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) \)
\((a)-(ii), (b)-(i), (c)-(iv), (d)-(iii) \)
\((a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 67
Consider the language \(L = \{ a^n b^{n-3} \mid n > 2 \}\) on \(Σ=\{𝑎,𝑏\}\). Which one of the following grammars generates the language \(𝐿\)?
\(𝑆→𝑎𝐴∣𝑎,𝐴→𝑎𝐴𝑏∣𝑏 \)
\(𝑆→𝑎𝑎𝐴∣𝜆,𝐴→𝑎𝐴𝑏∣𝜆 \)
\(𝑆→𝑎𝑎𝑎𝐴∣𝑎,𝐴→𝑎𝐴𝑏∣𝜆 \)
\(𝑆→𝑎𝑎𝑎𝐴,𝐴→𝑎𝐴𝑏∣𝜆\)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 68
Let 𝑃 be the set of all people. Let 𝑅 be a binary relation on 𝑃 such that (𝑎,𝑏) is in 𝑅 if 𝑎 is a brother of 𝑏. Is 𝑅 symmetric transitive, an equivalence relation, a partial order relation?
NO, NO, NO, NO
NO, NO, YES, NO
NO, YES, NO, NO
NO, YES, YES, NO
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 69
The order of schema ?10?101? and ???0??1 are _______ and _______ respectively.
5,3
5,2
7,5
8,7
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 70
Match List-I and List-II:
\(\begin{array}{llll} & \text{List I} && \text{List II} \\ \text{(a)} & \text{Physical layer} & \text{(i)} & \text{Provide token management service} \\ \text{(b)}& \text{Transport layer} & \text{(ii)}& \text{Concerned with transmitting raw bits} \\ &&& \text{over a communication channel} \\ \text{(c)} & \text{Session Layer} & \text{(iii)} & \text{Concerned with the syntax and} \\ &&& \text{semantics of the information transmitted} \\ \text{(d)}& \text{Presentation layer} & \text{(iv)} & \text{True end-to-end layer from source to} \\ &&& \text{destination} \\ \end{array}\)
Choose the correct option from those given below:
\((a)-(ii), (b)-(iv), (c) -(iii), (d)-(i) \)
\((a)-(iv), (b)-(iii), (c) -(ii), (d)-(i) \)
\((a)-(ii), (b)-(iv), (c) -(i), (d)-(iii) \)
\((a)-(iv), (b)-(ii), (c) -(i), (d)-(iii)\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 71
An instruction is stored at location 500 with its address field at location 501. The address field has the value 400. A processor register 𝑅1 contains the number 200. Match the addressing mode (List – I) given below with effective address (List-II) for the given instruction:
\(\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Direct} & \text{(i)} & 200 \\ \text{(b)} & \text{Register indirect} & \text{(ii)} & 902 \\ \text{(c)} & \text{Index with } R_1 \text{ as the index register} & \text{(iii)} & 400 \\ \text{(d)} & \text{Relative} & \text{(iv)} & 600 \\ \end{array}\)
Choose the correct option from those given below:
\((a)-(iii), (b)-(i), (c) -(iv), (d)-(ii) \)
\((a)-(i), (b)-(ii), (c) -(iii), (d)-(iv) \)
\((a)-(iv), (b)-(ii), (c) -(iii), (d)-(i) \)
\((a)-(iv), (b)-(iii), (c) -(ii), (d)-(i)\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 72
A rectangle is bound by the lines 𝑥 = 0;𝑦 = 0;𝑥 = 5 and 𝑦 = 3. The line segment joining (−1,0) and (4,5), if clipped against this window will connect the points __________.
(0,1) and (3,3)
(0,1) and (2,3)
(0,1) and (4,5)
(0,1) and (3, 5)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 73
Consider the following statements with respect to the language \(L = \{ a^n b^n \mid n \geq 0 \}\)
\(𝑆_1\): \(𝐿^2\) is a context free language
\(𝑆_2\):\(𝐿^𝑘\) is context free language for any given \(𝑘≥1\).
\(𝑆_3\): \( \overline{L}\) and \(𝐿^∗\) are context free languages
Which one of the following is correct?
only \(𝑆_1\) and \(𝑆_2\)
only 𝑆1 and \(𝑆_3\)
only \(𝑆_2\) and \(𝑆_3\)
\(𝑆_1\), \(𝑆_2\) and \(𝑆_3\)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 74
What are the greatest lower bound (GLB) and the least upper bound (\(LUB\)) of the sets \(𝐴=\{3,9,12\} \) and \(𝐵=\{1,2,4,5,10\}\) if they exist in poset \((z^+, / )\)?
\(A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20) \)
\(A(GLB – 3, LUB – 12); B(GLB – 1, LUB – 10) \)
\(A(GLB – 1, LUB – 36); B(GLB – 2, LUB – 20) \)
\(A(GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 75
Match List-I with List-II:
\(\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Micro operation} & \text{(i)} & \text{Specify micro operations} \\ \text{(b)} & \text{Micro programmed control unit} & \text{(ii)} & \text{Improve CPU utilization} \\\text{(c)}& \text{Interrupts} & \text{(iii)}& \text{Control Memory} \\ \text{(d)} & \text{Micro instruction} & \text{(iv)}& \text{Elementary operation performed} \\ &&& \text{on data stored in registers} \\ \end{array}\)
Choose the correct option from those given below:
\((a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) \)
\((a)-(iv), (b)-(iii), (c)-(i), (d)-(ii) \)
\((a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) \)
\((a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 76
A clique in an undirected graph \(𝐺=⟨𝑉,𝐸⟩\) is a subset \(𝑉′⊆𝑉\) of vertices, such that
If \((𝑢,𝑣)∈𝐸\) then \(𝑢∈𝑉′\) and \( 𝑣∈𝑉′\)
If \((𝑢,𝑣)∈𝐸\) then \(𝑢∈𝑉′\) or \(𝑣∈𝑉′\)
Each pair of vertices in \(𝑉′\) is connected by an edge
All pairs of vertices in \(𝑉′\) are not connected by an edge
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 77
The Boolean expression \(AB+A \overline{B}+\overline{A}C+AC\) is unaffected by the value of the Boolean variable _________.
\(A\)
\(B\)
\(C\)
\(A, B \ and \ C\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 78
The weight of minimum spanning tree in graph 𝐺, calculated using Kruskal’s algorithm is:
14
15
17
18
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 79
Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?
Non-preemptive priority scheduling
Preemptive priority scheduling and time sharing CPU scheduling
Time sharing scheduling only
Priority scheduling only
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 80
What is the output of the following 𝐶 program?
# include <stdio.h>
main ()
{
int i, j, x=0;
for (i=0; i<5; ++i)
for (j=0; j<i; ++j)
{
x+=(i+j-1);
break;
}
printf(“%d”, x);
}
6
5
4
3
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 81
Which of the following methods are used to pass any number of parameters to the operating system through system calls?
Registers
Block or table in main memory
Stack
Block in main memory and stack
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 82
The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program.
\(\begin{array}{|c|c|} \hline \textbf{Location} & \textbf{Instruction} \\ \hline 010 & \text{CLA} \\ \hline 011 & \text{ADD } 016 \\ \hline 012 & \text{BUN }014 \\ \hline 013 & \text{HLT} \\ \hline 014 & \text{AND } 017 \\ \hline 015 & \text{BUN } 013 \\ \hline 016 & \text{C} 1 \text{A}5 \\ \hline 017 & 93\text{C}6 \\ \hline \end{array}\)
\(A1B4\)
\(81B4\)
\(A184\)
\(8184\)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 83
Java Virtual Machine (JVM) is used to execute architectural neutral byte code. Which of the following is needed by the JVM for execution of Java Code?
Class loader only
Class loader and Java Interpreter
Class loader, Java Interpreter and API
Java Interpreter only
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 84
Consider the game tree given below:
Here ◯ and ◻ represents MIN and MAX nodes respectively. The value of the root node of the game tree is
4
7
11
12
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 85
A basic feasible solution of an 𝑚×𝑛 transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions.
.𝑚+𝑛+1, independent
𝑚+𝑛−1, independent
𝑚+𝑛−1, appropriate
𝑚−𝑛+1, independent
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 86
Given following equation:
\((142)_𝑏+(112)_{𝑏−2}=(75)_8\), find base \( 𝑏\).
3
6
7
5
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 87
Consider the following models:
\(𝑀_1\): Mamdani model
\(𝑀_2\): Takagi – Sugeno – Kang model
\(𝑀_3\): Kosko’s additive model \((𝑆𝐴𝑀)\)
Which of the following option contains examples of additive rule model?
Only \( 𝑀_1\) and \(𝑀_2\)
Only \(𝑀_2\) and \(𝑀_3\)
Only \( 𝑀_1\) and \(𝑀_3\)
\( 𝑀_1\), \(𝑀_2\) and \(𝑀_3\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 88
A fuzzy conjuction operators \(t(x, y)\)and a fuzzy disjunction operator, \(s(x, y)\), form a pair if they satisfy:
\(f(x, y) = 1 - s(1 - x, 1 - y)\)
if \(f(x , y) = {xy \over (x + y -xy)}\), then \(s(x, y)\) is given by
\(x + y \over 1 - xy\)
\(x + y - 2xy \over 1 - xy\)
\(x + y - xy \over 1 - xy\)
\(x + y - xy \over 1 + xy\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 89
How many reflexive relations are there on a set with 4 elements?
24
212
42
2
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 90
Which of the following algorithms is not used for line clipping?
Cohen-Sutherland algorithm
Southerland-Hodgeman algorithm
Liang-Barsky algorithm
Nicholl-Lee-Nicholl algorithm
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 91
A flow graph 𝐹 with entry node (1) and exit node (11) is shown below:
How many predicate nodes are there and what are their names?
Three: (1,(2,3),6)
Three: (1,4,6)
Four: ((2,3),6,10,11)
Four: ((2,3), 6,9,10)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 92
A flow graph 𝐹 with entry node (1) and exit node (11) is shown below:
How many regions are there in flowgraph 𝐹?
2
3
4
5
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 93
A flow graph 𝐹 with entry node (1) and exit node (11) is shown below:
What is the cyclomatic complexity of flowgraph 𝐹?
2
3
4
5
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 94
A flow graph 𝐹 with entry node (1) and exit node (11) is shown below:
How many nodes are there in the longest independent path?
6
7
8
9
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 95
A flow graph 𝐹 with entry node (1) and exit node (11) is shown below:
How many nodes are there in flowgraph 𝐹?
9
10
11
12
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 96
An organization needs to maintain database having five attributes \(A, B, C, D, E\). These attributes are functionally dependent on each other for which functionality dependency set \(𝐹\) is given as: \(F:\{A→BC,D→E,BC→D,A→D\}\). Consider a universal relation \(R(A, B, C, D, E)\) with functional dependency set \(𝐹\). Also all attributes are simple and take atomic values only.
MInimal cover \(F′\) of functional dependency set \(𝐹\) is
\(F′={A→B,A→C,BC→D,D→E} \)
\(F′={A→BC,B→D,D→E} \)
\(F′={A→B,A→C,A→D,D→E} \)
\(F′={A→B,A→C,B→D,C→D,D→E}\)
Correct Answer : A
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 97
An organization needs to maintain database having five attributes \(A, B, C, D, E\). These attributes are functionally dependent on each other for which functionality dependency set \(𝐹\) is given as: \(F:\{A→BC,D→E,BC→D,A→D\}\). Consider a universal relation \(R(A, B, C, D, E)\) with functional dependency set \(𝐹\). Also all attributes are simple and take atomic values only.
Assume that given table R is decomposed in two tables
\(R_1(A, B, C)\) with functional dependency set \(f_1=\{A→B,A→C\}\) and
\(R_2(A, D, E)\) with FD set \(F_2=\{A→D,D→E\}\)
Which of the following option is true w.r.t. given decomposition?
Dependency preservation property is followed
\(𝑅_1\) and \(𝑅_2\) are both in \(2 𝑁𝐹\)
\(𝑅_2\) is in \(2 NF\) and \(𝑅_3\) is in \(3 𝑁𝐹\)
\(𝑅_1\) is in \(3 𝑁𝐹\) and \(𝑅_2\) is in \(2 NF\)
Correct Answer : D
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 98
An organization needs to maintain database having five attributes \(A, B, C, D, E\). These attributes are functionally dependent on each other for which functionality dependency set \(𝐹\) is given as: \(F:\{A→BC,D→E,BC→D,A→D\}\). Consider a universal relation \(R(A, B, C, D, E)\) with functional dependency set \(𝐹\). Also all attributes are simple and take atomic values only.
Identify the redundant functional dependency in \(F\)
\(BC→D \)
\(D→E \)
\(A→D \)
\(A→BC\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 99
An organization needs to maintain database having five attributes \(A, B, C, D, E\). These attributes are functionally dependent on each other for which functionality dependency set \(𝐹\) is given as: \(F:\{A→BC,D→E,BC→D,A→D\}\). Consider a universal relation \(R(A, B, C, D, E)\) with functional dependency set \(𝐹\). Also all attributes are simple and take atomic values only.
Identify primary key of table 𝑅 with functional dependency set 𝐹
\(BC \)
\(AD \)
\(A \)
\(AB\)
Correct Answer : C
Question Type : MCQ
Max Marks : 2
Negative Marks : 0
Question : 100
An organization needs to maintain database having five attributes \(A, B, C, D, E\). These attributes are functionally dependent on each other for which functionality dependency set \(𝐹\) is given as: \(F:\{A→BC,D→E,BC→D,A→D\}\). Consider a universal relation \(R(A, B, C, D, E)\) with functional dependency set \(𝐹\). Also all attributes are simple and take atomic values only.
Identify the normal form in which relation \(𝑅\) belong to
\(1 NF \)
\(2 NF \)
\(3 NF \)
\(BCNF\)
Correct Answer : B
Question Type : MCQ
Max Marks : 2
Negative Marks : 0