search
Log In

Recent activity by target2017

4 answers
1
3 answers
2
In a company 45 people earn Rs. 20,000 per month, 25 people earn Rs. 30,000 per month, 20 people earn Rs. 40,000, 8 people earns Rs. 60,000 per month and 2 people earn Rs. 150,000 per month. Find median ?
commented Feb 6, 2017 in Quantitative Aptitude 1k views
1 answer
3
Consider a disk with blocksize 1024B . A block pointer 6B and recird pointer 8B . The file has 10000 employee records . Every record is fixed length of 100B . Its key is SSN which is of 2B. the file is not ordered by thr keyfield and want to construct a secondary index on ... For the above file if we make it into multilevel index find out thr no of total blocks required A)102 B) 100 C)119 D) 118
commented Feb 6, 2017 in Databases 94 views
0 answers
4
A) 3 B) 2 C) 1 D) 0
commented Feb 6, 2017 in Databases 308 views
1 answer
5
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
answered Feb 6, 2017 in Quantitative Aptitude 4k views
2 answers
6
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
answered Feb 4, 2017 in Mathematical Logic 926 views
1 answer
10
commented Jan 25, 2017 in Databases 59 views
1 answer
11
Determine the highest normal for relation R(A,B,C,D) AB →C BC→D
commented Jan 25, 2017 in Databases 374 views
0 answers
12
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
asked Jan 21, 2017 in DS 384 views
5 answers
13
Consider the following relations $A, B$ and $C:$ ... of $A\cup B$ is the same as that of $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$
commented Jan 21, 2017 in Databases 13.1k views
1 answer
14
commented Jan 18, 2017 in Probability 346 views
2 answers
15
0 answers
16
commented Jan 17, 2017 in Compiler Design 82 views
2 answers
17
Find the 2's complement pattern for – 113? (1) 0001111 (2) 00001111 (3) 10001111 (4) 1110001 Correct Answer: 3 Status: unattempted
answered Jan 17, 2017 in Digital Logic 316 views
2 answers
18
What is the time complexity of Huffman coding using heap tree data structure ? a) O(n) b) O(n log n) c) O(log n) d) O(n2)
commented Jan 16, 2017 in Algorithms 1.8k views
1 answer
20
commented Jan 15, 2017 in Theory of Computation 65 views
2 answers
21
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB
answered Jan 15, 2017 in Operating System 367 views
2 answers
22
answered Jan 15, 2017 in Programming 75 views
0 answers
23
if dijkstra's shortest path algorithm takes 8 seconds for a graph of 1000 nodes then approx. how much time would it take for a graph of 1000000 nodes?
commented Jan 14, 2017 in Algorithms 92 views
0 answers
24
Suppose both mouse and keyboard issues interrupt t same time. Which source of interrupt will have more priority- Mouse or keyboard? Why?
commented Jan 13, 2017 in CO and Architecture 248 views
3 answers
25
i know time complexity is O(nlogn) but can upper bound given in question consider as TRUE..
commented Jan 12, 2017 in Algorithms 6.1k views
0 answers
26
Finally what we have to do? Number of subnets? 2^n -2 or 2^n, where n is the number of borrowed bits ?
commented Jan 12, 2017 in Computer Networks 239 views
1 answer
27
Qus 12. A magnitude comparator consists of inputs A[A3 A2 A1 A0] and B[B3 B2 B1 B0]. The total number of comparisons performed for A>B is ______________
commented Jan 12, 2017 in Digital Logic 148 views
2 answers
30
answered Jan 11, 2017 in Digital Logic 86 views
...