Register
Filter

Questions by omveer

0 votes
1 answer
1
two 's complement
Using binary arithmetic, a number c is computed by taking the n-bit two’s complement of ‘a – b’. If n is eleven, a = 10100001001 and b = 10101 then c = ? (A) 011000011112 (B) 011000011002 (C) 011000111002 (D) 010001111002 explain?
Using binary arithmetic, a number c is computed by taking the n-bit two’s complement of ‘a – b’. If n is eleven, a = 10100001001 and b = 10101 then c = ?(A) 01100...
0 votes
1 answer
2
palindrome TOC
0 votes
2 answers
3
find time complexity of given code
While(n>1) { n=n/20; n=n/10; } Find time complexity.
While(n>1){n=n/20;n=n/10;}Find time complexity.
0 votes
2 answers
4
how many solutions
How many solutions do the following equation have x1+x2+x3=11 where x1≥1, x2≥2, x3≥3 (A) C(7, 11) (B) C(11, 3) (C) C(14, 11) (D) C(7, 5)
How many solutions do the following equation havex1+x2+x3=11where x1≥1, x2≥2, x3≥3(A) C(7, 11) (B) C(11, 3)(C) C(14, 11) (D) C(7, 5)
1 votes
3 answers
5
Buffer cache
Block or Buffer caches are used to (A) improve disk performance (B) handle interrupts (C) increase the capacity of main memory (D) speed up main memory Read operations
Block or Buffer caches are used to(A) improve disk performance(B) handle interrupts(C) increase the capacity of main memory(D) speed up main memory Read operations
2 votes
1 answer
6
hash table
A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table ? (A) 100 (B) 200 (C) 10000 (D) There is no upper limit
A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table ?(A) 100 (B) 200(C) 10000 (D) ...
1 votes
1 answer
7
ugcnet_june_2008_II
5. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by: .(A) 7 (B) 11 (C) 13 (D) 15
5. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by:.(A) 7 (B) 11 (C) 13 ...
2 votes
2 answers
8
compiler
In a two pass compiler, during the first pass: (A) user defined address symbols are correlated with their binary equivalent (B) the syntax of the statement is checked and mistakes, if any, are listed (C) object program is generated (D) semantic of the source program is elucidated.
In a two pass compiler, during the first pass:(A) user defined address symbols are correlated with their binary equivalent(B) the syntax of the statement is checked and m...
1 votes
2 answers
9
wff
A WFF that is equivalent to the WFF x=>y is: (A) y=>x (B) ~y=>x (C) ~y=>~x (D) y=>~x
A WFF that is equivalent to the WFF x=>y is:(A) y=>x (B) ~y=>x(C) ~y=>~x (D) y=>~x
1 votes
2 answers
10
December_2007_II
Let e: B˄m→B˄n be a group code. The minimum distance of ‘e’ is equal to: (A) the maximum weight of a non zero code word (B) the minimum weight of a non zero code word (C) m (D) n
Let e: B˄m→B˄n be a group code. The minimum distance of ‘e’ is equal to:(A) the maximum weight of a non zero code word(B) the minimum weight of a non zero code wo...
1 votes
0 answers
11
Time Division Multiplexing
TDM is ................ (A) A primary/secondary type protocol (B) A peer/peer protocol (C) A Non-priority peer/peer protocol (D) A priority type protocol
TDM is ................(A) A primary/secondary type protocol(B) A peer/peer protocol(C) A Non-priority peer/peer protocol(D) A priority type protocol
1 votes
1 answer
12
UGC_NET_JUNE_2006_2
.................. synchronize critical resources to prevent deadlock. (A) P-operator (B) V-operator (C) Semaphores (D) Hard disk
.................. synchronize critical resources to prevent deadlock.(A) P-operator (B) V-operator(C) Semaphores (D) Hard disk