menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User vaishali jhalani
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
Recent Posts
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
I tried calling IISC Admission Dept, but they...
Mock 2 are live now.
sir ,it's already 17th
It will be live soon.
This Year IISc is not taking students of computer...
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
databases
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
co-and-architecture
interrupts
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
co-and-architecture
2
answers
4
MadeEasy Subject Test: Programming & DS - Binary Tree
commented
Feb 4, 2017
in
DS
264
views
made-easy-test-series
data-structures
binary-tree
time-complexity
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
made-easy-test-series
data-structures
trees
algorithms
time-complexity
1
answer
6
MadeEasy Subject Test: CO & Architecture - Instruction Execution
commented
Feb 4, 2017
in
CO and Architecture
205
views
co-and-architecture
made-easy-test-series
instruction-execution
0
answers
7
MadeEasy Subject Test: Databases - Joins
commented
Feb 2, 2017
in
Databases
133
views
made-easy-test-series
databases
joins
1
answer
8
MadeEasy Subject Test: Compiler Design - Parsing
commented
Feb 2, 2017
in
Compiler Design
172
views
made-easy-test-series
compiler-design
parsing
1
answer
9
MadeEasy Subject Test: CO & Architecture - Addressing Modes
asked
Feb 1, 2017
in
CO and Architecture
130
views
made-easy-test-series
co-and-architecture
addressing-modes
0
answers
10
MadeEasy Subject Test: Theory of Computation - Recursive And Recursively Enumerable Languages
asked
Feb 1, 2017
in
Theory of Computation
96
views
made-easy-test-series
theory-of-computation
recursive-and-recursively-enumerable-languages
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
gate2015-3
computer-networks
tcp
normal
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
databases
0
answers
13
MadeEasy Subject Test: Engineering Mathematics - First Order Logic
commented
Jan 31, 2017
in
Mathematical Logic
189
views
made-easy-test-series
discrete-mathematics
mathematical-logic
first-order-logic
4
answers
14
MadeEasy Subject Test: CO & Architecture - Dma
commented
Jan 31, 2017
in
CO and Architecture
1.8k
views
co-and-architecture
made-easy-test-series
dma
0
answers
15
MadeEasy Subject Test: Databases - Sql
commented
Jan 31, 2017
in
Databases
133
views
made-easy-test-series
databases
sql
1
answer
16
MadeEasy Subject Test: Operating System - Semaphores
commented
Jan 30, 2017
in
Operating System
156
views
operating-system
made-easy-test-series
semaphores
1
answer
17
MadeEasy Subject Test: Digital Logic - Min Sum Of Products Form
asked
Jan 30, 2017
in
Digital Logic
227
views
made-easy-test-series
digital-logic
min-sum-of-products-form
1
answer
18
MadeEasy Subject Test: Operating System - Virtual Memory
commented
Jan 30, 2017
in
Operating System
125
views
made-easy-test-series
operating-system
virtual-memory
1
answer
19
MadeEasy Subject Test: Programming & DS - Linked Lists
asked
Jan 30, 2017
in
DS
127
views
made-easy-test-series
data-structures
linked-lists
time-complexity
0
answers
20
MadeEasy Subject Test: Databases - Er Diagram
asked
Jan 30, 2017
in
Databases
134
views
databases
made-easy-test-series
er-diagram
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
co-and-architecture
pipelining
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
compiler-design
grammar
3
answers
23
Minimal Cover Possible
commented
Jan 28, 2017
in
Databases
413
views
databases
minimal-cover
1
answer
24
MadeEasy Subject Test: Theory of Computation - Identify Class Language
commented
Jan 28, 2017
in
Theory of Computation
118
views
made-easy-test-series
theory-of-computation
identify-class-language
1
answer
25
MadeEasy Subject Test: Algorithms - Dynamic Programming
commented
Jan 27, 2017
in
Algorithms
449
views
made-easy-test-series
algorithms
dynamic-programming
1
answer
26
MadeEasy Subject Test: Databases - Transactions
asked
Jan 27, 2017
in
Databases
98
views
made-easy-test-series
databases
transactions
0
answers
27
Decidability
asked
Jan 27, 2017
in
Theory of Computation
103
views
decidability
theory-of-computation
made-easy-test-series
1
answer
28
BCNF and Dependency preserving
commented
Jan 26, 2017
in
Databases
378
views
dependency-preserving
databases
1
answer
29
MadeEasy Subject Test: Theory of Computation - Regular Languages
asked
Jan 26, 2017
in
Theory of Computation
167
views
made-easy-test-series
theory-of-computation
regular-languages
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
made-easy-test-series
databases
transactions
...