Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
GateAspirant999
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by GateAspirant999
0
votes
1
answer
41
Which type of index is this?
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is called a. Dense b. Sparse c. CLustered d. Unclustered I find the question utterly non sense. It ... "? Please someone shed some light. No book explains/defines any type of index with such vague / ambiguous / non sensical words.
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is calleda. Denseb. Sparsec. CLust...
489
views
asked
Oct 30, 2016
5
votes
3
answers
42
Dependency preserving decomposition
Let R(X,Y,Z,W) be a relational schema with the following functional dependencies: $X\rightarrow Y, Y\rightarrow Z, Z\rightarrow W$ and $W\rightarrow Y$ The decomposition of R into (X,Y),(Y,Z),(Y,W) is a. ... preserving b. Lossless join, but is not dependency preserving c. Lossless join and dependency preserving d. Lossy join and not dependency preserving
Let R(X,Y,Z,W) be a relational schema with the following functional dependencies:$X\rightarrow Y, Y\rightarrow Z, Z\rightarrow W$ and $W\rightarrow Y$The decomposition of...
2.8k
views
asked
Oct 29, 2016
Databases
dependency-preserving
databases
database-normalization
+
–
5
votes
3
answers
43
Number of minimal candidate keys
A relation R(A,B,C,D,E,F) holds following FDs $AB\rightarrow C$ $C\rightarrow D$ $D\rightarrow EA$ $E\rightarrow F$ $F\rightarrow B$ The number of minimal candidate keys of R are _______.
A relation R(A,B,C,D,E,F) holds following FDs$AB\rightarrow C$$C\rightarrow D$$D\rightarrow EA$$E\rightarrow F$$F\rightarrow B$The number of minimal candidate keys of R a...
2.3k
views
asked
Oct 29, 2016
Databases
databases
database-normalization
candidate-key
+
–
1
votes
1
answer
44
Flip flop delay and MOD of counter
A certain JK-FF has propagation delay $t_{pd}=12$ ns. The largest MOD of the counter suc that, the counter can be designed from these FF's which will operate upto 10 MHz will be ______.
A certain JK-FF has propagation delay $t_{pd}=12$ ns. The largest MOD of the counter suc that, the counter can be designed from these FF's which will operate upto 10 MHz ...
525
views
asked
Oct 23, 2016
Digital Logic
digital-logic
+
–
2
votes
1
answer
45
Clock frequency required for proper operation of ripple counter
An 8 stage ripple counter uses a flip flop with propagation delay of 75 ns. The pulse width of strobe is 50ns. The frequency of input signal which can be used for proper operation of counter is? (A) 1 MHz (B) 500 MHz (C) 1.5 MHz (D) 2 MHz
An 8 stage ripple counter uses a flip flop with propagation delay of 75 ns. The pulse width of strobe is 50ns. The frequency of input signal which can be used for proper ...
7.9k
views
asked
Oct 17, 2016
Digital Logic
digital-logic
clock-frequency
digital-counter
+
–
0
votes
1
answer
46
Size of a output of combinational circuit
A combinational circuit is designed to multiply the input by 9. The input is 4 bit BCD and the output is binary. How many output lines are required?
A combinational circuit is designed to multiply the input by 9. The input is 4 bit BCD and the output is binary. How many output lines are required?
453
views
asked
Oct 17, 2016
Digital Logic
digital-logic
+
–
1
votes
3
answers
47
Carry look ahead adder delay
How many gate delays are needed to add for increase of level in multilevel carry look ahead adder? (A) 2 gate delays (B) 3 gate delays (C) 4 gate delays (D) 5 gate delays I really didnt get what it is meant by "to add ... calculating Px and Gx two stages of internal logic for calculating carry one stage calculating final sum So should the answer be 4 gate delays?
How many gate delays are needed to add for increase of level in multilevel carry look ahead adder?(A) 2 gate delays(B) 3 gate delays(C) 4 gate delays(D) 5 gate delaysI re...
1.6k
views
asked
Oct 16, 2016
Operating System
digital-logic
adder
+
–
6
votes
3
answers
48
Minimum number of two input NAND gates required to realize the logic circuit
The truth table for the combinational circuit is shown below: What is the minimum number of two input NAND gates required to realize this logic circuit?
The truth table for the combinational circuit is shown below:What is the minimum number of two input NAND gates required to realize this logic circuit?
9.5k
views
asked
Oct 11, 2016
Digital Logic
digital-logic
min-no-gates
normal
+
–
0
votes
0
answers
49
Number of levels required in multiplexer tree
If we have to prepare n:1 MUX using only m:1 MUXs where n>m. How many levels will be required? For example preparing 64:1 MUX with only 16:1 MUXs, I will need two levels: first level will be four 16:1 MUX and second one will be single 16:1 ... , but this does not seem to be the case as $\lceil log_8{32}\rceil =1$ while $\lceil log_{16}{64}\rceil =2$
If we have to prepare n:1 MUX using only m:1 MUXs where n>m. How many levels will be required?For example preparing 64:1 MUX with only 16:1 MUXs, I will need two levels: ...
702
views
asked
Sep 23, 2016
Unknown Category
digital-logic
multiplexer
+
–
4
votes
1
answer
50
Which of the following statements are TRUE/FALSE?
Which of the following statements are TRUE/FALSE? S1: SQL permits attributes names to be repeated in the same relation S2: The power of DRC and TRC is same as that of relational algebra S3: The project operation (pi) cometimes only distributes over join ... (D) <T,F,T> Sol. I dont understand what it is meant by S3. I feel first two are false.
Which of the following statements are TRUE/FALSE?S1: SQL permits attributes names to be repeated in the same relationS2: The power of DRC and TRC is same as that of relat...
2.3k
views
asked
Sep 15, 2016
Programming in C
relational-calculus
relational-algebra
sql
+
–
1
votes
1
answer
51
Indexing problem
Consider the following relations. Emp(eid:integer,ename:varchar,sal:integer,age:integer,did:integer) Dept(did:integer,budget:integer,floor:integer,mgr_eid:integer) Salaries ranges from 10000 to 100000 ages vary from 20 to 80, each department has about five employees ... Clustered B+ tree index on the budge field of Dept I feel in first paragraph what all important is Dept table.
Consider the following relations.Emp(eid:integer,ename:varchar,sal:integer,age:integer,did:integer)Dept(did:integer,budget:integer,floor:integer,mgr_eid:integer)Salaries ...
784
views
asked
Sep 14, 2016
Databases
indexing
bplustrees
hashing
+
–
2
votes
1
answer
52
Deleting a node from B+ tree
How to delete key 15 from below B+ tree?
How to delete key 15 from below B+ tree?
769
views
asked
Sep 4, 2016
Programming in C
b-tree
databases
algorithms
+
–
0
votes
2
answers
53
Which Tuple Relation calculus query is correct?
Schema student (rollNo, name, degree, year, sex, deptNo, advisor) course (courseId, cname, credits, deptNo) enrollment (rollNo, courseId, sem, year, grade) Obtain the names of courses enrolled by student named Mahesh {c.name | course(c) ^ (∃s) (∃e ... (s) ^ c.courseId = e.courseId ^ e.rollNo = s.rollNo ^ s.name = "Mahesh" } Are both correct?
Schemastudent (rollNo, name, degree, year, sex, deptNo, advisor)course (courseId, cname, credits, deptNo)enrollment (rollNo, courseId, sem, year, grade)Obtain the names o...
1.1k
views
asked
Aug 21, 2016
Databases
databases
relational-calculus
+
–
2
votes
1
answer
54
Decide about functional dependencies
Consider relation R(ABCD) and FD = {AB->CD,C->A,D->B}. Which of the following is false? (A) C->A is a partial dependency (B) C->A is a transitive dependency (C) D->B is a partial dependency (D) All of these
Consider relation R(ABCD) and FD = {AB->CD,C->A,D->B}. Which of the following is false?(A) C->A is a partial dependency(B) C->A is a transitive dependency(C) D->B is a pa...
516
views
asked
Aug 16, 2016
Databases
database-normalization
+
–
1
votes
1
answer
55
Is bounded waiting and progress ensured in this code using exchange instruction?
Consider the atomic exchange instruction defined as follows: void exchange (int *a, int *b) { int temp; temp = *b; *b = *a; *a = temp; } Now consider the solution to critical section problem based on ... ..., P(n)); 20 } Does the above code meets bounded waiting and progress requirements of critical section problem?
Consider the atomic exchange instruction defined as follows:void exchange (int *a, int *b) { int temp; temp = *b; *b = *a; *a = temp; }Now consider the soluti...
574
views
asked
Jul 21, 2016
Operating System
deadlock-prevention-avoidance-detection
process-synchronization
+
–
2
votes
1
answer
56
Write program using fork and join constructs for given precedence graph
I have few doubts: Is precedence graph, fork-join construct, parbegin-parend construct, cobegin-coend construct topics are in syllabus for Operating System for GATE exam. (They are related with parallel programming ... steps / stepwise procedure? Lastly write fork-join code for realizing following precedence graph: ​
I have few doubts:Is precedence graph, fork-join construct, parbegin-parend construct, cobegin-coend construct topics are in syllabus for Operating System for GATE exam. ...
2.8k
views
asked
Jul 17, 2016
Operating System
operating-system
+
–
0
votes
1
answer
57
Finding Effective Access Time
Do you find the answer in the options? I didnt. Or I am plain understanding this question wrong: Consider the following data with respect to a paging system with the page table stored in the memory: Associative look up = $x \mu sec$ Memory cycle time = $1 \mu sec$ Hit ratio (percentage of time that ... 1+x+y)$\mu$s (B) (2+x+y)$\mu$s (C) (x+y-1)$\mu$s (D) (2+x-y)$\mu$s
Do you find the answer in the options? I didnt. Or I am plain understanding this question wrong:Consider the following data with respect to a paging system with the page ...
842
views
asked
Jun 12, 2016
Operating System
operating-system
+
–
0
votes
2
answers
58
Finding effective average instruction execution time
I find below problem a lot complex to solve: A system uses 2 level paging schemes. A regular memory access takes 100 ns and servicing a page fault takes 10 ms. An average instruction takes 100 ns of cpu time and two memory access. The TLB ... effective average instruction execution time? (A)​ 1300 ns (B) 1250 ns (C) 1320 ns (D) 1275 ns
I find below problem a lot complex to solve: A system uses 2 level paging schemes. A regular memory access takes 100 ns and servicing a page fault takes 10 ms. An average...
942
views
asked
Jun 11, 2016
Operating System
operating-system
+
–
0
votes
4
answers
59
Finding hit ratio
Cache access time Tc = 100 ns Memory access time Tm = 500 ns If the effective access time is 10% greater than the cache access time, what is the hit ratio H? (A) 89% (B) 91% (C) 98% (D) 95%
Cache access time Tc = 100 nsMemory access time Tm = 500 nsIf the effective access time is 10% greater than the cache access time, what is the hit ratio H?(A) 89%(B) 91%(...
13.1k
views
asked
Jun 9, 2016
0
votes
1
answer
60
Problem on memory management
Consider a paging system with the page table stored in the memory. A memory reference takes 100 ns. We add TLBs and 80% of all page table references are found in TLBs. Finding a page table entry in the TLBs take negligible time. How long does a paged memory ... (B) 150 ns (C) 200 ns (D) 300 ns I didn't get what does it meant by "paged" memory reference.
Consider a paging system with the page table stored in the memory. A memory reference takes 100 ns. We add TLBs and 80% of all page table references are found in TLBs. Fi...
1.2k
views
asked
Jun 5, 2016
Operating System
operating-system
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register