Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for out-of-syllabus-now
28
votes
6
answers
1
GATE CSE 2015 Set 2 | Question: 28
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ isA multiple of 4EvenOddCongruent to 0 $mod$ 4...
go_editor
12.8k
views
go_editor
asked
Feb 12, 2015
Graph Theory
gatecse-2015-set2
graph-theory
graph-isomorphism
out-of-syllabus-now
+
–
0
votes
0
answers
2
Numerical Method Analysis :
Solve the following system using Gauss seidal iterative method with initial guess (0, 0, 0) and tolerance 0.001. $\left\{\begin{matrix} 2x_{1}-3x_{2}+x_{3} = 5\\ x_{1}+4x_{2}+12x_{3} = 10\\ 6x_{1}+x_{2}+5x_{3} = 9 \end{matrix}\right.$
Solve the following system using Gauss seidal iterative method with initial guess (0, 0, 0) and tolerance 0.001.$\left\{\begin{matrix} 2x_{1}-3x_{2}+x_{3} = 5\\ x_{1}+4x_...
kidussss
282
views
kidussss
asked
Mar 7, 2023
Others
numerical-methods
out-of-syllabus-now
+
–
32
votes
4
answers
3
GATE CSE 2013 | Question: 46
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is (A) 4 (B) 5 (C) 6 (D) 7
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is(A...
Arjun
27.5k
views
Arjun
asked
Sep 24, 2014
Digital Logic
gatecse-2013
digital-logic
normal
out-of-syllabus-now
+
–
11
votes
4
answers
4
GATE CSE 2014 Set 1 | Question: 26
Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is $2 \times10^8m/s$ and the token transmission time is ignored. If each station is allowed to hold ... minimum time for which the monitoring station should wait (in $µsec$) before assuming that the token is lost is _______.
Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is $2 \times10^8m/s$ and the to...
go_editor
15.3k
views
go_editor
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
token-ring
numerical-answers
out-of-syllabus-now
+
–
10
votes
3
answers
5
GATE IT 2008 | Question: 11
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE? If X can be solved in polynomial time, then so can Y X is NP-complete X is NP-hard X is in NP, but not necessarily NP-complete
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?If X can be solved in polynomial time, then so can YX is NP-c...
Ishrat Jahan
7.1k
views
Ishrat Jahan
asked
Oct 27, 2014
Algorithms
gateit-2008
algorithms
p-np-npc-nph
normal
out-of-syllabus-now
+
–
1
votes
2
answers
6
Computer network
Chetnawadhwa
549
views
Chetnawadhwa
asked
Oct 23, 2016
Computer Networks
computer-networks
congestion-control
network
layer
out-of-syllabus-now
+
–
16
votes
3
answers
7
GATE CSE 2013 | Question: 49
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. ... without any spill to memory? Do not apply any optimization other than optimizing register allocation. 3 4 5 6
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...
go_editor
6.8k
views
go_editor
asked
Apr 21, 2016
Compiler Design
out-of-syllabus-now
gatecse-2013
normal
compiler-design
target-code-generation
code-optimization
+
–
19
votes
3
answers
8
GATE CSE 2007 | Question: 4
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has 9 edges and 5 vertices 9 edges and 6 vertices 10 edges and 5 vertices 10 edges and 6 vertices
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
Kathleen
10.1k
views
Kathleen
asked
Sep 21, 2014
Graph Theory
gatecse-2007
graph-theory
normal
out-of-syllabus-now
+
–
3
votes
2
answers
9
How many RAM chips & size of decoder required?
How many 256 X 4 RAM chips are required to organize a memory of capacity 32KB ? What is the size of decoder required in this implementation to select a row of chip? Options : (a) 128 , 7 X 128 (b) 256 , 7 X 128 (c) 512 , 7 X 128 (d) 256 , 8 X 256.
How many 256 X 4 RAM chips are required to organize a memory of capacity 32KB ? What is the size of decoder required in this implementation to select a row of chip?Option...
Jitendra Verma
13.6k
views
Jitendra Verma
asked
Mar 14, 2016
CO and Architecture
co-and-architecture
memory-interfacing
out-of-syllabus-now
+
–
11
votes
2
answers
10
GATE CSE 2001 | Question: 2.19
Consider the following program Program P2 var n : int; procedure W(var x : int) begin x = x + 1; print x; end procedure D begin var n : int; n = 3; W(n); end begin \\begin P2 n=10; D; end If the language has dynamic scooping and parameters are passed by reference, what will be printed by the program? 10 11 3 None of the above
Consider the following programProgram P2 var n : int; procedure W(var x : int) begin x = x + 1; print x; end procedure D begin var n : int; n = 3; W(n); end begin \\begin...
Kathleen
7.3k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2001
programming
parameter-passing
normal
out-of-syllabus-now
+
–
15
votes
2
answers
11
GATE CSE 2006 | Question: 56, ISRO2009-58
Consider the following code written in a pass-by-reference language like FORTRAN and these statements about the code. subroutine swap(ix,iy) it = ix L1 : ix = iy L2 : iy = it end ia = 3 ib = 8 call swap (ia, ib+5) print *, ia, ib end ... : The program will print 13 and -2 Exactly the following set of statement(s) is correct: S1 and S2 S1 and S4 S3 S1 and S5
Consider the following code written in a pass-by-reference language like FORTRAN and these statements about the code. subroutine swap(ix,iy) it = ix L1 : ix = iy L2 : iy ...
Rucha Shelke
6.7k
views
Rucha Shelke
asked
Sep 26, 2014
Programming in C
gatecse-2006
programming
parameter-passing
normal
out-of-syllabus-now
isro2009
+
–
16
votes
2
answers
12
GATE CSE 2015 Set 2 | Question: 2
Consider two decision problems $Q_1, Q_2$ such that $Q_1$ reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to $Q_2$. Then which one of the following is consistent with the above statement? $Q_1$ is in NP, $Q_2$ is NP hard. $Q_2$ is in NP, $Q_1$ is NP hard. Both $Q_1$ and $Q_2$ are in NP. Both $Q_1$ and $Q_2$ are in NP hard.
Consider two decision problems $Q_1, Q_2$ such that $Q_1$ reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to $Q_2$. Then which one of the followi...
go_editor
6.4k
views
go_editor
asked
Feb 12, 2015
Theory of Computation
gatecse-2015-set2
algorithms
p-np-npc-nph
easy
out-of-syllabus-now
+
–
4
votes
3
answers
13
GATE CSE 1998 | Question: 2.10, ISRO2008-17
The address space of $8086$ CPU is one Megabyte $256$ Kilobytes $1 \;\text{K}$ Megabytes $64$ Kilobytes
The address space of $8086$ CPU isone Megabyte$256$ Kilobytes$1 \;\text{K}$ Megabytes$64$ Kilobytes
Kathleen
4.5k
views
Kathleen
asked
Sep 25, 2014
CO and Architecture
gate1998
co-and-architecture
microprocessors
out-of-syllabus-now
isro2008
+
–
13
votes
5
answers
14
GATE CSE 2014 Set 1 | Question: 38
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the...
go_editor
8.0k
views
go_editor
asked
Sep 28, 2014
Theory of Computation
gatecse-2014-set1
algorithms
p-np-npc-nph
normal
out-of-syllabus-now
+
–
13
votes
2
answers
15
GATE CSE 2002 | Question: 1.18
The results returned by function under value-result and reference parameter passing conventions Do not differ Differ in the presence of loops Differ in all cases May differ in the presence of exception
The results returned by function under value-result and reference parameter passing conventionsDo not differDiffer in the presence of loopsDiffer in all casesMay differ i...
Kathleen
8.2k
views
Kathleen
asked
Sep 15, 2014
Programming in C
gatecse-2002
programming
parameter-passing
normal
out-of-syllabus-now
+
–
11
votes
2
answers
16
GATE CSE 2015 Set 1 | Question: 42
Consider the following C program segment. while (first <= last) { if (array[middle] < search) first = middle + 1; else if (array[middle] == search) found = TRUE; else last = middle - 1; middle = (first + last)/2; } if (first > last) notpresent = TRUE; The cyclomatic complexity of the program segment is_______________.
Consider the following C program segment.while (first <= last) { if (array[middle] < search) first = middle + 1; else if (array[middle] == search) found = TRUE; else last...
makhdoom ghaya
13.2k
views
makhdoom ghaya
asked
Feb 13, 2015
IS&Software Engineering
gatecse-2015-set1
is&software-engineering
cyclomatic-complexity
normal
out-of-syllabus-now
numerical-answers
+
–
6
votes
2
answers
17
GATE CSE 2000 | Question: 18
Consider the following program is pseudo-Pascal syntax program main; var x: integer; procedure Q (z: integer); begin z := z+x; writeln(z); end; procedure P (y: integer); var x: integer; begin x := y+2; Q(x); writeln(x); ... is call-by-value and the scope rule is static scoping? the parameter passing mechanism is call-by-reference and the scope rule is dynamic scoping?
Consider the following program is pseudo-Pascal syntaxprogram main; var x: integer; procedure Q (z: integer); begin z := z+x; writeln(z); end; procedure P (y: integer);...
Kathleen
3.0k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2000
programming
parameter-passing
normal
out-of-syllabus-now
descriptive
+
–
11
votes
1
answer
18
GATE CSE 2007 | Question: 66, ISRO2016-71
In a token ring network the transmission speed is $10^7$ bps and the propagation speed is $200\;\text{meters}/\mu \text{s}.$ The $1$-bit delay in this network is equivalent to: $500$ meters of cable. $200$ meters of cable. $20$ meters of cable. $50$ meters of cable.
In a token ring network the transmission speed is $10^7$ bps and the propagation speed is $200\;\text{meters}/\mu \text{s}.$ The $1$-bit delay in this network is equivale...
Kathleen
16.9k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
token-ring
out-of-syllabus-now
isro2016
+
–
3
votes
2
answers
19
GATE CSE 1998 | Question: 17
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. The first sector to be read is sector 3 on track 10. Assume that the diskette ... sectored and the controller has a 1-sector buffer. The diskette spins at 300 RPM and initially, the head is on track 10.
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. Th...
Kathleen
2.9k
views
Kathleen
asked
Sep 26, 2014
Operating System
gate1998
operating-system
disk
normal
numerical-answers
out-of-syllabus-now
+
–
5
votes
4
answers
20
GATE IT 2004 | Question: 82
Consider a 10 Mbps token ring LAN with a ring latency of 400 µs. A host that needs to transmit seizes the token. Then it sends a frame of 1000 bytes, removes the frame after it has circulated all around the ring, and finally releases the token. ... every frame. Assuming that only a single host wishes to transmit, the effective data rate is 1 Mbps 2 Mbps 5 Mbps 6 Mbps
Consider a 10 Mbps token ring LAN with a ring latency of 400 µs. A host that needs to transmit seizes the token. Then it sends a frame of 1000 bytes, removes the frame a...
Ishrat Jahan
7.1k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
lan-technologies
token-ring
normal
out-of-syllabus-now
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register