1
_______ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation.
Answer: Option [A]
Questions
2
The SQL expression Select distinct T, branch_name from branch T, branch S where T.assets>S.assets and S.branch_city=”Mumbai” finds the names of
Answer: Option [B]
3
Support of a fuzzy set A = ⎩ ⎨ ⎧
⎭ ⎬ ⎫x 1 0.2 , x2 0.15 , x3 0.9 , x4 0.95 , x5 0.15 within a universal set X is given as In a single perceptron, the updation rule of weight vector is given by (A) w(n + 1)=w(n)+η[d(n)-y(n)] (B) w(n + 1)=w(n)–η[d(n)-y(n)] (C) w(n + 1)=w(n)+η[d(n)-y(n)]* x (n) (D) w(n + 1)=w(n)–η[d(n)-y(n)]* x (n)
Answer: Option [D]
4
______ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values.
Answer: Option [A]
6
Which of the following electronic component is not found in IC’s ?
Answer: Option [B]
7
A given memory chip has 14 address pins and 8 data pins. It has the following number of locations.
Answer: Option [B]
8
The instruction: MOV CL, [BX] [DI] + 8 represents the _____ addressing mode.
Answer: Option [B]
9
The power dissipation of a flip-flop is 3 mW. The power dissipation of a digital system with 4 flip-flops is given by
Answer: Option [B]
10
An astable multivibrator using the 555 timer to generate a square wave of 5 KHz with 70% duty cycle will have
Answer: Option [B]
11
A binary ripple counter is required to count up to 16383. How many flipflops are required ?
Answer: Option [A]
12
The time complexity of recurrence relation T(n) = T(n/3) + T(2n/3) + O(n) is
Answer: Option [B]
13
How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year ?
Answer: Option [D]
14
The number of possible parenthesizations of a sequence of n matrices is
Answer: Option [A]
15
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
Answer: Option [B]
16
Given 0-1 knapsack problem and fractional knapsack problem and the following statements : S 1 : 0-1 knapsack is efficiently solved using Greedy algorithm. S 2 : Fractional knapsack is efficiently solved using Dynamic programming. Which of the following is true ?
Answer: Option [B]
17
Equivalence class partitioning approach is used to divide the input domain into a set of equivalence classes, so that if a program works correctly for a value, then it will work correctly for all the other values in that class. This is used _____.
Answer: Option [B]
18
The failure intensity for a basic model as a function of failures experienced is given as λ(μ)-λ0[1 – (μ)/(V0)] where λ0 is the initial failure intensity at the start of the execution, μ is the average or expected number of failures at a given point in time, the quantity V0 is the total number of failures that would occur in infinite time. Assume that a program will experience 100 failures in infinite time, the initial failure intensity was 10 failures/CPU hr. Then the decrement of failures intensity per failure will be
Answer: Option [B]
19
Improving processing efficiency or performance or restructuring of software to improve changeability is known as
Answer: Option [B]
20
In ____,modules A and B make use of a common data type, but perhaps perform different operations on it.
Answer: Option [B]
