the way a card game player arranges his cards as he picks them up one by one, is an example of 1. bubble sort 2. selection sort 3. insertion sort 4. merge sort
which of the following is not primitive recursive but computable ? 1. Carnot function 2. Riemann function 3. Bounded function 4. Ackermann function
the process of transforming one bit pattern into another by bit-wise operations is called 1. masking 2. pruning 3. biting 4. chopping
Latest Answer: 1. masking is AND operation to convert a preknown number of digits to 0 if these are the bits 101100110 and if 4 LSBs are to masked AND it with 1111100002. pruning to delete cetain bits.3. ...
what is the total number of equivalent relations that can be defined on the set (1,2,3)? 1. 8 2. 64 3. 5 4. 3
Latest Answer: equivalent relation = {(x,y)/x,y belong to the set and,x=y}The ans is 3,i.e,three equivalent sets ...
The function f(x) is continuous in [0,1], such that f(0)=-1, f(1/2)=1 and f(1)=-1, We can conclude that 1. f attains the value zero at least twice in [0,1] 2. f attains the value zero
Latest Answer: Another way to look at the solution would be to just draw a mental plot of the given values on x and y axis and it would be easy to see that the graph would cut the x axis twice hence two zero's ...
The boolean expression X + XY equals 1. X + Y2. Y + YX3. XY + YX4. None of these
Latest Answer: X+XY=X(1+Y)from boolean properties we know that 1+Y=Yso X+XY=Xnone of these is answer. ...
The number of swappings needed to short the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order using bubble sort is 1. 11 2. 12 3. 13 4. 14
Which of the following symbol table implementation is based on the property of locality of reference ?
1. Linear list 2. search tree 3. Hash table 4. self-organization list
Ln E-R diagram 'the customer is paying his payment' The relationship is 1. one the many 2. many to one 3. one to one 4. none ofthese
View page << Previous 1 2 3 4 [5] 6 7 8 9 10 Next >>
Go Top
