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)

asked Feb 7, 2017 in Databases | 169 views

3 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).

commented Feb 7, 2017 in CO and Architecture | 1.6k views

1 answer

3

Self doubt
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 | 85 views

2 answers

4

MadeEasy Subject Test: Programming & DS - Binary Tree

commented Feb 4, 2017 in DS | 208 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?

commented Feb 4, 2017 in Algorithms | 245 views

1 answer

6

MadeEasy Subject Test: CO & Architecture - Instruction Execution

commented Feb 4, 2017 in CO and Architecture | 100 views

0 answers

7

MadeEasy Subject Test: Databases - Joins

commented Feb 2, 2017 in Databases | 85 views

1 answer

8

MadeEasy Subject Test: Compiler Design - Parsing

commented Feb 2, 2017 in Compiler Design | 115 views

1 answer

9

MadeEasy Subject Test: CO & Architecture - Addressing Modes

asked Feb 1, 2017 in CO and Architecture | 87 views

0 answers

10

MadeEasy Subject Test: Theory of Computation - Recursive And Recursively Enumerable Languages

asked Feb 1, 2017 in Theory of Computation | 73 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

commented Feb 1, 2017 in Computer Networks | 3.8k 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??

asked Jan 31, 2017 in Databases | 152 views

0 answers

13

MadeEasy Subject Test: Engineering Mathematics - First Order Logic

commented Jan 31, 2017 in Mathematical Logic | 71 views

4 answers

14

MadeEasy Subject Test: CO & Architecture - Dma

commented Jan 31, 2017 in CO and Architecture | 1.2k views

0 answers

15

MadeEasy Subject Test: Databases - Sql

commented Jan 31, 2017 in Databases | 57 views

1 answer

16

MadeEasy Subject Test: Operating System - Semaphores

commented Jan 30, 2017 in Operating System | 96 views

1 answer

17

MadeEasy Subject Test: Digital Logic - Min Sum Of Products Form

asked Jan 30, 2017 in Digital Logic | 121 views

1 answer

18

MadeEasy Subject Test: Operating System - Virtual Memory

commented Jan 30, 2017 in Operating System | 78 views

1 answer

19

MadeEasy Subject Test: Programming & DS - Linked Lists

asked Jan 30, 2017 in DS | 83 views

0 answers

20

MadeEasy Subject Test: Databases - Er Diagram

asked Jan 30, 2017 in Databases | 70 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..

commented Jan 30, 2017 in CO and Architecture | 858 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??

commented Jan 29, 2017 in Compiler Design | 1k views

3 answers

23

Minimal Cover Possible

commented Jan 28, 2017 in Databases | 298 views

1 answer

24

MadeEasy Subject Test: Theory of Computation - Identify Class Language

commented Jan 28, 2017 in Theory of Computation | 69 views

1 answer

25

MadeEasy Subject Test: Algorithms - Dynamic Programming

commented Jan 27, 2017 in Algorithms | 323 views

1 answer

26

MadeEasy Subject Test: Databases - Transactions

asked Jan 27, 2017 in Databases | 58 views

0 answers

27

Decidability

asked Jan 27, 2017 in Theory of Computation | 81 views

1 answer

28

BCNF and Dependency preserving

commented Jan 26, 2017 in Databases | 237 views

1 answer

29

MadeEasy Subject Test: Theory of Computation - Regular Languages

asked Jan 26, 2017 in Theory of Computation | 100 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

asked Jan 26, 2017 in Databases | 64 views

0 answers

31

MadeEasy Subject Test: Databases - B Tree

commented Jan 26, 2017 in Databases | 105 views

1 answer

32

MadeEasy Subject Test: Theory of Computation - Identify Class Language

asked Jan 25, 2017 in Theory of Computation | 71 views

1 answer

33

MadeEasy Subject Test: Databases - B Tree
What is the meaning of d option.

commented Jan 25, 2017 in Databases | 67 views

0 answers

34

MadeEasy Subject Test: CO & Architecture - Dma

asked Jan 25, 2017 in CO and Architecture | 58 views

1 answer

35

MadeEasy Subject Test: Theory of Computation - Context Free Language

asked Jan 25, 2017 in Theory of Computation | 59 views

2 answers

36

MadeEasy CBT 2017: Algorithms - Graph Algorithms

commented Jan 25, 2017 in Algorithms | 1.4k views

2 answers

37

MadeEasy Subject Test: CO & Architecture - Addressing Modes
Which signed representation has to be taken?

commented Jan 25, 2017 in CO and Architecture | 95 views

0 answers

38

algorithm #

commented Jan 24, 2017 in Algorithms | 63 views

2 answers

39

MadeEasy Subject Test: Algorithms - Graph Connectivity

answer selected Jan 24, 2017 in Algorithms | 746 views

1 answer

40

What is the maximum number of topological sorting possible ?
For a given set of vertices , can we compute the maximum number of topological sortings possible ?

commented Jan 24, 2017 in Algorithms | 511 views