menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Questions by Keith Kr

2 votes
3 answers
1
True or False: Relational algebra cannot perform aggregate function
True or False: Relational algebra cannot perform aggregate function
True or False: Relational algebra cannot perform aggregate function
asked Jan 31, 2015 in Databases 655 views
3 votes
2 answers
2
True or False: DCFL is closed under set difference
True or False: DCFL is closed under set difference
True or False: DCFL is closed under set difference
asked Jan 10, 2015 in Theory of Computation 896 views
1 vote
3 answers
3
Given a relation R(A, B, C) with functional dependencies set {A → B, B → C, C → B}
Given a relation R(A, B, C) with functional dependencies set {A → B, B → C, C → B} (i) lossless decomposition is always possible for R (ii) Dependency preserving decomposition is always possible for R. Assume decomposition includes all the attributes ... ) Both (i) and (ii) are false Please explain your answer and what does Assume decomposition includes all the attributes of R mean?
asked Jan 7, 2015 in Databases 1.8k views
0 votes
2 answers
4
Which of the following are true about associative memory.
Which of the following are true about associative memory. S1: Associative memory is fast memory. S2: Associative memory searches by content and not by accessing the address. a) Both S1 and S2 are true and S2 is correct explanation of S1 b) Both ... is not correct explanation of S1 c) S1 is true but S2 is false d) S1 is false but S2 is true
Which of the following are true about associative memory. S1: Associative memory is fast memory. S2: Associative memory searches by content and not by accessing the address. a) Both S1 and S2 are true and S2 is correct explanation of S1 b) Both S1 and S2 are true, and S2 is not correct explanation of S1 c) S1 is true but S2 is false d) S1 is false but S2 is true
asked Jan 7, 2015 in CO and Architecture 752 views
3 votes
3 answers
5
Data hazards: RAW,WAR,WAW
Indicate the type of data hazards (RAW, WAR, and WAW) that exist between the following instructions: I1:ADD R1, R2, R3 ; R1 = R2 + R3 I2:ADD R4, R1, R4 ; R4 = R1 + R4 I3:ADD R3, R1, R2 ; R3 = R1 + R2 I4:ADD R1, R1, R4 ; R1 = R1 + ... single instruction?(as in I2 and I4) ii)Do we have to consider only consecutive instructions? (as in I1 and I2) or can it be (I1 and I3) too?
Indicate the type of data hazards (RAW, WAR, and WAW) that exist between the following instructions: I1:ADD R1, R2, R3 ; R1 = R2 + R3 I2:ADD R4, R1, R4 ; R4 = R1 + R4 I3:ADD R3, R1, R2 ; R3 = R1 + R2 I4:ADD R1, R1, R4 ; R1 = R1 + R4 Soln: Between ... in single instruction?(as in I2 and I4) ii)Do we have to consider only consecutive instructions? (as in I1 and I2) or can it be (I1 and I3) too?
asked Dec 16, 2014 in CO and Architecture 1.1k views
0 votes
1 answer
6
What will be the output for f(p,p), if p is initialized to 4.
int f(int &x, int c) { c=c-1; if(c==0) return 1; x=x+1; return f(x,c) * x; } What will be the output for f(p,p), if p is initialized to 4.
int f(int &x, int c) { c=c-1; if(c==0) return 1; x=x+1; return f(x,c) * x; } What will be the output for f(p,p), if p is initialized to 4.
asked Dec 14, 2014 in Programming 78 views
0 votes
1 answer
7
What is the output, explain
int main(void) { char p[20]; char *s = "Gate015"; int length = strlen(s); int i=0; for(i=0;i<length;i++) p[i]=s[length-i]; printf("%s",p); return 0; }
int main(void) { char p[20]; char *s = "Gate015"; int length = strlen(s); int i=0; for(i=0;i<length;i++) p[i]=s[length-i]; printf("%s",p); return 0; }
asked Dec 14, 2014 in Programming 118 views
0 votes
1 answer
8
Hashing
Consider the following, five binary strings of length 8. 01010010, 11011011, 10011010, 11111011, 01110010 A hash table of size M = 8 (0 to 7) is using open addressing for hashing the binary strings. Assume finding an empty slot directly without collision or after collision is also a probe. Calculate the total number of probes that occur while hashing five strings using linear probing.
Consider the following, five binary strings of length 8. 01010010, 11011011, 10011010, 11111011, 01110010 A hash table of size M = 8 (0 to 7) is using open addressing for hashing the binary strings. Assume finding an empty slot directly without collision or after collision is also a probe. Calculate the total number of probes that occur while hashing five strings using linear probing.
asked Nov 26, 2014 in Algorithms 498 views
1 vote
1 answer
9
The digital operations such as AND, OR, NOT can be performed by using
The digital operations such as AND, OR, NOT can be performed by using A)switches B)amplifiers C)rectifiers D)oscillators
The digital operations such as AND, OR, NOT can be performed by using A)switches B)amplifiers C)rectifiers D)oscillators
asked Oct 28, 2014 in Digital Logic 301 views
0 votes
1 answer
10
time stamp ordering
Consider the following sequence of actions. r1(A) r2(B) w1(C) r3(B) r3(C) w2(B) w3(A) Which of the following time stamp ordering allowed to execute the schedule using basic time stamp protocol? A) (T1, T2, T3) = (10, 30, 20) B) (T1, T2, T3) = (20, 30, 10) C) (T1, T2, T3) = (30, 20, 10) D) (T1, T2, T3) = (10, 20, 30)
Consider the following sequence of actions. r1(A) r2(B) w1(C) r3(B) r3(C) w2(B) w3(A) Which of the following time stamp ordering allowed to execute the schedule using basic time stamp protocol? A) (T1, T2, T3) = (10, 30, 20) B) (T1, T2, T3) = (20, 30, 10) C) (T1, T2, T3) = (30, 20, 10) D) (T1, T2, T3) = (10, 20, 30)
asked Oct 19, 2014 in Databases 597 views
1 vote
3 answers
11
Find the number of candidates keys that includes attribute A3
A relation R with 5 attributes A1, A2, A3, A4, A5. Given the following FDs A1 → A2 A2A3 → A5 A4A5 → A1 Find the number of candidates keys that includes attribute A3
A relation R with 5 attributes A1, A2, A3, A4, A5. Given the following FDs A1 → A2 A2A3 → A5 A4A5 → A1 Find the number of candidates keys that includes attribute A3
asked Oct 19, 2014 in Databases 322 views
0 votes
1 answer
12
functional dependency
GIven a relation instance X Y Z 2 8 4 2 10 6 2 12 6 6 4 4 which of the following FDs is satisfied by relation A)XY → Z, Z → Y B)YZ → X, Y → Z C)YZ → X, X → Z D)XZ → Y, Y → X
GIven a relation instance X Y Z 2 8 4 2 10 6 2 12 6 6 4 4 which of the following FDs is satisfied by relation A)XY → Z, Z → Y B)YZ → X, Y → Z C)YZ → X, X → Z D)XZ → Y, Y → X
asked Oct 19, 2014 in Databases 301 views
6 votes
3 answers
13
Consider the following statement about indexes
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these
asked Oct 19, 2014 in Databases 2.4k views
6 votes
1 answer
14
Disk scheduling
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38 at a given time when the given disk drive is reading from cylinder 20. The seek time is 6ms per cylinder. 1.What is the total seek time, if the disk arm scheduling ... None 2.What is the total seek time, if the closest cylinder next scheduling is used? A)360 ms B)876 ms C)850 ms D)900 ms
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38 at a given time when the given disk drive is reading from cylinder 20. The seek time is 6ms per cylinder. 1.What is the total seek time, if the disk arm scheduling algorithm FCFS is ... D)None 2.What is the total seek time, if the closest cylinder next scheduling is used? A)360 ms B)876 ms C)850 ms D)900 ms
asked Oct 3, 2014 in Operating System 7.4k views
0 votes
2 answers
15
Concurrency
Consider the following sequential code which is executed in a multiprogramming mode by assuming that each statement can execute independently to achieve the concurrency. If any statement dependent on other statements then those statements will be executed in the order. S1: a = b + c; ... execute concurrently at the beginning of execution? a)S3 and S4 b)S2 and S3 c)S1 and S2 d)S2 and S4
Consider the following sequential code which is executed in a multiprogramming mode by assuming that each statement can execute independently to achieve the concurrency. If any statement dependent on other statements then those statements will be executed in the order. S1: a = b + c; S2: ... can execute concurrently at the beginning of execution? a)S3 and S4 b)S2 and S3 c)S1 and S2 d)S2 and S4
asked Oct 1, 2014 in Operating System 640 views
3 votes
4 answers
16
Which of the following are equal things when there is only one CPU in a system.
Which of the following are equal things when there is only one CPU in a system. A) Multiprogramming and Multitasking B) Multiprocessing and Multiprogramming C) Multitasking and Multiprocessing D) None of these
Which of the following are equal things when there is only one CPU in a system. A) Multiprogramming and Multitasking B) Multiprocessing and Multiprogramming C) Multitasking and Multiprocessing D) None of these
asked Sep 30, 2014 in Operating System 1.1k views
1 vote
1 answer
17
Fragmentation is
Fragmentation is a. dividing the secondary memory into equal sized fragments b. dividing the main memory into equal size fragments c. fragments of memory world used in a page d. fragments of memory words unused in a page. Please explain.
Fragmentation is a. dividing the secondary memory into equal sized fragments b. dividing the main memory into equal size fragments c. fragments of memory world used in a page d. fragments of memory words unused in a page. Please explain.
asked Sep 26, 2014 in Operating System 2.6k views
8 votes
5 answers
18
UGCNET-July-2018-II: 64
Relations produced from E-R Model will always be in _____ 1 NF 2 NF 3 NF 4 NF
Relations produced from E-R Model will always be in _____ 1 NF 2 NF 3 NF 4 NF
asked Sep 25, 2014 in Databases 10.3k views
24 votes
5 answers
19
GATE1999-2.20
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
asked Sep 12, 2014 in Algorithms 4.5k views
45 votes
1 answer
20
GATE1999-1.6
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true? $L_1 = L_2$ $L_1 \supset L_2$ $L_1 \subset L_2$ None
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true? $L_1 = L_2$ $L_1 \supset L_2$ $L_1 \subset L_2$ None
asked Sep 10, 2014 in Theory of Computation 6.5k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...