Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
target2017
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by target2017
4
answers
1
GATE2017 EC Digital
3.3k
views
commented
Feb 7, 2017
Digital Logic
digital-logic
+
–
3
answers
2
Gate 2017 ME
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 ?
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...
1.4k
views
commented
Feb 6, 2017
Quantitative Aptitude
quantitative-aptitude
+
–
1
answer
3
database indexing
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 ... 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
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 ...
350
views
commented
Feb 6, 2017
0
answers
4
number of tuples returned by query
A) 3 B) 2 C) 1 D) 0
A) 3B) 2C) 1D) 0
1.0k
views
commented
Feb 6, 2017
1
answer
5
GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
6.3k
views
answered
Feb 6, 2017
Quantitative Aptitude
numerical-answers
+
–
2
answers
6
Combinations
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?
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?
1.8k
views
answered
Feb 4, 2017
Mathematical Logic
combinatory
+
–
2
answers
7
MadeEasy CBT 2017: Databases - Er Diagram
Please explain how they merged.(Modified)
Please explain how they merged.(Modified)
2.0k
views
commented
Jan 30, 2017
Databases
made-easy-test-series
cbt-2017
databases
er-diagram
+
–
0
answers
8
Ace Test Series: Algorithms - Time Complexity
Time complexity of the given program is?
Time complexity of the given program is?
422
views
commented
Jan 30, 2017
Algorithms
ace-test-series
algorithms
time-complexity
+
–
2
answers
9
Ace Test Series: Operating System - Process Schedule
653
views
commented
Jan 30, 2017
Operating System
operating-system
test-series
ace-test-series
round-robin-scheduling
process-scheduling
+
–
1
answer
10
database
273
views
commented
Jan 25, 2017
1
answer
11
Database-Normalisation
Determine the highest normal for relation R(A,B,C,D) AB →C BC→D
Determine the highest normal for relation R(A,B,C,D)AB →CBC→D
766
views
commented
Jan 25, 2017
Databases
database-normalization
partial-dependency
+
–
0
answers
12
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
931
views
asked
Jan 21, 2017
DS
data-structures
queue
circular-queue
+
–
6
answers
13
GATE CSE 2012 | Question: 50
Consider the following relations $A, B$ and $C:$ ... is the same as that of $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$
Consider the following relations $A, B$ and $C:$$$\overset{\text{A}}{\begin{array}{|c|c|c|} \hline \text {ID} & \text {Name} & \text {Age} \\\hline\text{12}& \text{Arun}...
29.1k
views
commented
Jan 21, 2017
Databases
gatecse-2012
databases
joins
normal
+
–
1
answer
14
Testbook
1.2k
views
commented
Jan 18, 2017
2
answers
15
COMPLEMENT OF CSL
1.0k
views
commented
Jan 17, 2017
0
answers
16
compiler
304
views
commented
Jan 17, 2017
2
answers
17
2's Comlement
Find the 2's complement pattern for – 113? (1) 0001111 (2) 00001111 (3) 10001111 (4) 1110001 Correct Answer: 3 Status: unattempted
Find the 2's complement pattern for – 113?(1)0001111(2)00001111(3)10001111(4)1110001Correct Answer: 3 Status: unattempted
1.1k
views
answered
Jan 17, 2017
2
answers
18
Huffman Coding
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)
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)
4.4k
views
commented
Jan 16, 2017
Algorithms
huffman-code
algorithms
+
–
9
answers
19
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
8.7k
views
answer selected
Jan 15, 2017
DS
data-structures
avl-tree
numerical-answers
+
–
1
answer
20
ace mock I
260
views
commented
Jan 15, 2017
4
answers
21
test book test
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
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 associat...
1.1k
views
answered
Jan 15, 2017
2
answers
22
ace mock- I
249
views
answered
Jan 15, 2017
0
answers
23
algorithm
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?
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?
307
views
commented
Jan 14, 2017
2
answers
24
Test by Bikram | Operating Systems | Test 2 | Question: 9
Assume that pages are $128$ words in size. Consider below code snippet whose function is to initialize to $0$ each element of a $128$ - by - $128$ array. Then number of page faults generated by the following Code snippet is: Assume the array is stored row major ... j++) for( int i=0; i<128; i++) A[i][j] = 0; $128$ $16384$ $0$ $16378$
Assume that pages are $128$ words in size. Consider below code snippet whose function is to initialize to $0$ each element of a $128$ – by – $128$ array. Then number ...
679
views
commented
Jan 14, 2017
Operating System
tbb-os-2
+
–
3
answers
25
Test by Bikram | Operating Systems | Test 2 | Question: 5
Let us initialize counting semaphore $X$ to $5$. Assume that processes $P_i$ where $i= 1$ to $15$ are coded as follows. while (1) { P (x); { critical section } V (x); } and suppose that $P_{16}$ is coded as follows: ... { critical section } P (x); } The number of processes can be in the critical section at most at any point of time is ______
Let us initialize counting semaphore $X$ to $5$. Assume that processes $P_i$ where $i= 1$ to $15$ are coded as follows.while (1) { P (x); { critical section } V (x); }an...
727
views
commented
Jan 14, 2017
Operating System
tbb-os-2
numerical-answers
process-synchronization
+
–
0
answers
26
Which source of interrupt will have more priority- Mouse or keyboard?
Suppose both mouse and keyboard issues interrupt t same time. Which source of interrupt will have more priority- Mouse or keyboard? Why?
Suppose both mouse and keyboard issues interrupt t same time. Which source of interrupt will have more priority- Mouse or keyboard? Why?
632
views
commented
Jan 13, 2017
CO and Architecture
co-and-architecture
+
–
3
answers
27
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
i know time complexity is O(nlogn) but can upper bound given in question consider as TRUE..
i know time complexity is O(nlogn) but can upper bound given in question consider as TRUE..
13.3k
views
commented
Jan 12, 2017
Algorithms
greedy-algorithm
algorithms
+
–
0
answers
28
Number of subnets
Finally what we have to do? Number of subnets? 2^n -2 or 2^n, where n is the number of borrowed bits ?
Finally what we have to do?Number of subnets? 2^n -2 or 2^n, where n is the number of borrowed bits ?
616
views
commented
Jan 12, 2017
Computer Networks
computer-networks
+
–
1
answer
29
ACE test
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 ______________
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 ______________
452
views
commented
Jan 12, 2017
1
answer
30
Digital Logic
491
views
commented
Jan 11, 2017
Digital Logic
combinational-circuit
digital-counter
digital-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register