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

Recent activity by vaishali jhalani

1 answer
1
NO of tables
Let the cardinality of each relation is 1: 1, then find the minimum number of tables possible in relational model? (Assume that the participation of A, B is total)
Let the cardinality of each relation is 1: 1, then find the minimum number of tables possible in relational model? (Assume that the participation of A, B is total)
asked Feb 7, 2017 in Databases 249 views
4 answers
2
Interrupt I/O
Consider a system employing interrupt driven input/output for a particular device that transfers data at an average of 16 KB/s on a continuous basis. Assume that interrupt processing takes 50 μsec (i.e., the jump to the interrupt service routine (ISR), ... of processor time is consumed by this input/output device if it interrupt for every byte is _______ (Upto 3 decimal places).
Consider a system employing interrupt driven input/output for a particular device that transfers data at an average of 16 KB/s on a continuous basis. Assume that interrupt processing takes 50 μsec (i.e., the jump to the interrupt service routine (ISR), execute ... fraction of processor time is consumed by this input/output device if it interrupt for every byte is _______ (Upto 3 decimal places).
commented Feb 7, 2017 in CO and Architecture 3k views
1 answer
3
Self doubt
DIfference between Static single assignment, 3 address code , 3 address instruction? How these 3 are different in representation?
DIfference between Static single assignment, 3 address code , 3 address instruction? How these 3 are different in representation?
commented Feb 6, 2017 in CO and Architecture 122 views
1 answer
5
MadeEasy Subject Test: Algorithms - Time Complexity
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtree what is the time complexity?
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtree what is the time complexity?
commented Feb 4, 2017 in Algorithms 526 views
4 answers
11
GATE2015-3-22
Consider the following statements. TCP connections are full duplex TCP has no option for selective acknowledgement TCP connections are message streams Only I is correct Only I and III are correct Only II and III are correct All of I, II and III are correct
Consider the following statements. TCP connections are full duplex TCP has no option for selective acknowledgement TCP connections are message streams Only I is correct Only I and III are correct Only II and III are correct All of I, II and III are correct
commented Feb 1, 2017 in Computer Networks 6.5k views
0 answers
12
Foreign key
Foreign key should be a candidate key of parent table and should have unique value(including null) in referenced table. Is this statement correct??
Foreign key should be a candidate key of parent table and should have unique value(including null) in referenced table. Is this statement correct??
asked Jan 31, 2017 in Databases 180 views
0 answers
21
Doubts in PIpelining
1. In case of no data forwarding can we use split phase. 2. Should we have to consider data forwarding, According to options? 3. Where we can use split phase??( I know about WB-ID and EX-ID) @Pc @Arjun Sir Please answer..
1. In case of no data forwarding can we use split phase. 2. Should we have to consider data forwarding, According to options? 3. Where we can use split phase??( I know about WB-ID and EX-ID) @Pc @Arjun Sir Please answer..
commented Jan 30, 2017 in CO and Architecture 1.3k views
1 answer
22
can LR(1) parser parse any context free grammar/language ??
can LR(1) parser parse any context free grammar/language ?? and hence evry regular lamguage can be parsed by LR(1) parsers??
can LR(1) parser parse any context free grammar/language ?? and hence evry regular lamguage can be parsed by LR(1) parsers??
commented Jan 29, 2017 in Compiler Design 1.8k views
3 answers
23
Minimal Cover Possible
commented Jan 28, 2017 in Databases 413 views
1 answer
30
MadeEasy Subject Test: Databases - Transactions
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positions So number of schedules will be 5 which are view eq to given schedule. But ans given is 10
Here T1 T2 T4 T5 will come in this order only and for T3 we have 5 positions So number of schedules will be 5 which are view eq to given schedule. But ans given is 10
asked Jan 26, 2017 in Databases 94 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...