Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Xylene
7
answers
1
GATE IT 2005 | Question: 85b
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...
14.9k
views
comment edited
Jan 20, 2018
Computer Networks
gateit-2005
computer-networks
routing
normal
+
–
6
answers
2
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
26.5k
views
commented
Jan 19, 2018
Databases
gatecse-2008
databases
er-diagram
normal
+
–
6
answers
3
GATE CSE 2008 | Question: 42
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has at ... least $2$ edge-disjoint paths between every pair of vertices. There are at least $2$ vertex-disjoint paths between every pair of vertices.
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$?For...
23.6k
views
commented
Dec 25, 2017
Graph Theory
gatecse-2008
graph-connectivity
normal
+
–
0
answers
4
Ace Test series: CO & Architecture - Pipelining
Consider the following program which is executed on $4$ stage pipelined processor. IF=$2$ clocks/word ID=$2$ clocks/word EX stage takes $2$ clocks for register operands and $3$ clocks for memory operand WR stage takes ... Minimum number of clocks needed to complete the above program is _________________ Note:Pipeline stage sequence is IF,ID,EX and WR
Consider the following program which is executed on $4$ stage pipelined processor.IF=$2$ clocks/wordID=$2$ clocks/wordEX stage takes $2$ clocks for register operands and ...
1.4k
views
commented
Dec 22, 2017
CO and Architecture
ace-test-series
co-and-architecture
pipelining
+
–
0
answers
5
Database index.
A file can have either one primary index or one clustered index but not both. True or false ? Give an answer with explanation.
A file can have either one primary index or one clustered index but not both. True or false ? Give an answer with explanation.
1.3k
views
commented
Dec 22, 2017
Databases
databases
indexing
+
–
1
answer
6
Congestion Control
Please Confirm whether 10 MSS is correct or not ?
Please Confirm whether 10 MSS is correct or not ?
657
views
commented
Dec 21, 2017
Computer Networks
computer-networks
congestion-control
tcp
+
–
1
answer
7
Priority Queue
How many minimum queues are required to implement a priority queue?
How many minimum queues are required to implement a priority queue?
1.5k
views
commented
Dec 20, 2017
DS
priority-queue
data-structures
+
–
0
answers
8
Domain of Mod-Trigo function ALLEN2017
For existence of f(x) = , x lies in (take n I) (1) [0, 2nπ] (2) (3) (4) None of these how to solve such question? Pl give detailed explanation. Always find difficult to solve Range and domain of such complex question.
For existence of f(x) = , x lies in (take n I)(1)[0, 2nπ](2)(3)(4)None of thesehow to solve such question? Pl give detailed explanation.Always find difficult to solve R...
531
views
comment edited
Dec 20, 2017
Linear Algebra
linear-algebra
range
domain
trigonomatric
function
modulus
+
–
0
answers
9
Bounded wait example
Can someone give me an example of a problem which is starvation free but bounded waiting condition is not satisfied?
Can someone give me an example of a problem which is starvation free but bounded waiting condition is not satisfied?
628
views
commented
Dec 14, 2017
Operating System
operating-system
+
–
1
answer
10
DFS back edge
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
2.5k
views
commented
Nov 9, 2017
Programming in C
depth-first-search
algorithms
graph-algorithms
+
–
7
answers
11
GATE CSE 2008 | Question: 38
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is: before effective address calculation has started during effective address calculation after effective address calculation has completed after data cache lookup has completed
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is:before effective address calculation has starteddur...
19.4k
views
comment edited
Nov 2, 2017
CO and Architecture
gatecse-2008
co-and-architecture
virtual-memory
normal
+
–
1
answer
12
Number of duals
Number of duals of distinct boolean expressions of 4 variables is ?
Number of duals of distinct boolean expressions of 4 variables is ?
1.7k
views
commented
Oct 28, 2017
Digital Logic
digital-logic
+
–
7
answers
13
number of WAR dependencies
Consider the following instructions. $I_1:R_1=100$ $I_2:R_1=R_2+R_4$ $I_3:R_2=R_4+25$ $I_4:R_4=R_1+R_3$ $I_5:R_1=R_1+30$ Calculate sum of ($\text{WAR, RAW and WAW}$) dependencies the above instructions. $10$ $12$ $6$ $8$
Consider the following instructions.$I_1:R_1=100$$I_2:R_1=R_2+R_4$$I_3:R_2=R_4+25$$I_4:R_4=R_1+R_3$$I_5:R_1=R_1+30$Calculate sum of ($\text{WAR, RAW and WAW}$) dependenci...
6.7k
views
commented
Oct 25, 2017
CO and Architecture
co-and-architecture
data-dependency
+
–
1
answer
14
Decidability property.
Intersection of languages produced by two DCFG is a DCFL . Decidable or not ? Please give reference for your answer.
Intersection of languages produced by two DCFG is a DCFL . Decidable or not ? Please give reference for your answer.
1.7k
views
commented
Oct 23, 2017
Theory of Computation
theory-of-computation
+
–
2
answers
15
Synchronous transmission
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bps, what is the bit rate of receiver ?
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bps, what is the bit rate of receiv...
1.7k
views
commented
Oct 20, 2017
Computer Networks
synchronous-data
+
–
3
answers
16
Paging question
A computer system implements a 36 bit virtual address. Page size is 4KB and size of physical memory is 30 bits. The approximate size of page table in the system is ___ MB ? Is it 36MB or 48MB ?
A computer system implements a 36 bit virtual address. Page size is 4KB and size of physical memory is 30 bits. The approximate size of page table in the system is ___ MB...
4.2k
views
commented
Oct 19, 2017
Operating System
operating-system
+
–
0
answers
17
Paging question
TLB lookup time (th) = 20 ns TLB hit ratio (ht) = 99% Memory access time (ts) = 100 ns Page fault rate (hp) =0.05 Swap page time (in or out) (tp) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 5118.91 ns 51.21 ns 5121ns None of the above Is the answer 5121 ?
TLB lookup time (th) = 20 nsTLB hit ratio (ht) = 99%Memory access time (ts) = 100 nsPage fault rate (hp) =0.05Swap page time (in or out) (tp) = 5000,000 nsWhat is the eff...
790
views
commented
Oct 18, 2017
Operating System
operating-system
+
–
0
answers
18
Decidablity problem.
Is L(G) subset of L(R) decidable ? Where G is CFG and R is regular grammar. Problem can be reduced to checking if L(G) $\cap$ ( L(R))' = phi. Now L(R)' is regular, so it also CFL and determining whether L(G1) $\cap$ L(G2) = phi is known to be undecidable where L(G1) and L(G2) are CFL's . So above problem should also be undecidable. Where am I going wrong ?
Is L(G) subset of L(R) decidable ? Where G is CFG and R is regular grammar.Problem can be reduced to checking if L(G) $\cap$ ( L(R))' = phi.Now L(R)' is regular, so it al...
1.8k
views
commented
Oct 17, 2017
Theory of Computation
decidability
theory-of-computation
+
–
3
answers
19
Virtual Gate Test Series: Theory Of Computation - Regular Languages
The language given is $\text{$L = \{ w | w $ contains an equal no of occurrences of substrings '$ab'$ and $'ba' \}.$ }$ $L$ is regular $?$ Note$:-$ $aba ∈ L $since $'aba'$ contains $1$ occurrence of $'ab'$ and $1$ occurrence of $'ba'$ but $ abab ∉ L$
The language given is $\text{$L = \{ w | w $ contains an equal no of occurrences of substrings '$ab'$ and $'ba' \}.$ }$ $L$ is regular $?$Note$:-$ $aba ∈ L $since $'a...
4.3k
views
comment edited
Oct 16, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-language
virtual-gate-test-series
+
–
2
answers
20
B+ tree maximum number of records.
What is the maximum number of records that can be indexed in B+ tree of level $4$ ,order $10$ where root is at level $1$ ? As the order of tree is $10$, nodes in the last level of b+ tree should contain $10$ record pointers (number of ... $10-1 = 9$ record pointers. Which one is correct?
What is the maximum number of records that can be indexed in B+ tree of level $4$ ,order $10$ where root is at level $1$ ?As the order of tree is $10$, nodes in the last ...
4.8k
views
commented
Oct 13, 2017
Databases
b-tree
databases
+
–
1
answer
21
Convoy effect.
Is convoy effect possible in SJF and Priority (preemptive and non preemptive) scheduling ? Please explain your answer.
Is convoy effect possible in SJF and Priority (preemptive and non preemptive) scheduling ? Please explain your answer.
1.2k
views
commented
Oct 8, 2017
Operating System
operating-system
+
–
3
answers
22
Which of the following algorithm leads convoy effect?
Which of the following algorithm leads convoy effect? FCFS SJF Priority scheduling All of the above
Which of the following algorithm leads convoy effect?FCFS SJF Priority scheduling All of the above
10.4k
views
commented
Oct 7, 2017
Operating System
operating-system
+
–
10
answers
23
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...
37.0k
views
comment edited
Oct 6, 2017
Compiler Design
gatecse-2003
compiler-design
syntax-directed-translation
normal
+
–
1
answer
24
Minimum tables required
1.Minimum number of tables required which satisfies 1NF ? 2.Minimum number of tables required which satisfies 3NF ?
1.Minimum number of tables required which satisfies 1NF ?2.Minimum number of tables required which satisfies 3NF ?
818
views
edited
Sep 20, 2017
Databases
databases
er-diagram
+
–
0
answers
25
Minimum number of index blocks
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index? I think the answer should be (417/10) + (42/11) +(4/11) = 42 + 4 + 1 = 47 (Assuming order of leaf and internal nodes are same as they are not given separately). Am I correct?
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index?I think t...
1.2k
views
asked
Sep 20, 2017
Databases
databases
indexing
+
–
1
answer
26
Number of relations in ER diagram
Minimum number of relations or tables required ?
Minimum number of relations or tables required ?
1.5k
views
comment edited
Sep 20, 2017
Databases
databases
er-diagram
+
–
0
answers
27
Concurrent transactions
Number of concurrent transactions that can be formed with 3 transactions having 3,2 and 1 operations respectively. Here should the answer be 60 or 54 ? Should we include serial transactions also in the answer or should we subtract it?
Number of concurrent transactions that can be formed with 3 transactions having 3,2 and 1 operations respectively.Here should the answer be 60 or 54 ? Should we include s...
522
views
asked
Sep 20, 2017
Databases
databases
+
–
4
answers
28
ME test
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the maximum frequency of the MOD256 counter ? (in MHz)
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the...
3.9k
views
comment edited
Sep 15, 2017
Digital Logic
digital-logic
digital-counter
flip-flop
+
–
2
answers
29
Prime Implicants and Essential Prime Impliccants
What are the prime implicants and essential prime implicants for the below questions ? F(w, x, y, z) = ∑(1,2,5,7,12) + d(0,9,13) Explain by drawing K-map. Also explain the prime implicants and essential prime implicants with don't care condition .
What are the prime implicants and essential prime implicants for the below questions ?F(w, x, y, z) = ∑(1,2,5,7,12) + d(0,9,13)Explain by drawing K-map.Also explain the...
20.4k
views
comment edited
Sep 13, 2017
Digital Logic
digital-logic
prime-implicants
+
–
1
answer
30
Stack
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
1.6k
views
comment reshown
Sep 13, 2017
Programming in C
stack
data-structures
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register