Dark Mode

Recent questions tagged out-of-syllabus-now

0 votes

0 answers

1

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.$

kidussss asked in Others Mar 7, 2023

284 views

1 vote

0 answers

2

Token ring 802.5
Token ring is operating at 4Mbps and has a token holding time of 10. Milli seconds what is the longest frame that can be sent on this ring ?

Bharani Viswas asked in Computer Networks Dec 26, 2016

by Bharani Viswas

600 views

1 vote

2 answers

3

Computer network

Chetnawadhwa asked in Computer Networks Oct 23, 2016

by Chetnawadhwa

564 views

3 votes

3 answers

4

ISRO-2013-51
In case of a DVD, the speed of data transfer is mentioned in multiples of? 150 KB/s 1.38 MB/s 300 KB/s 2.40 MB/s

makhdoom ghaya asked in Operating System May 2, 2016

by makhdoom ghaya

3.5k views

16 votes

3 answers

5

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

go_editor asked in Compiler Design Apr 21, 2016

6.8k views

3 votes

2 answers

6

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.

Jitendra Verma asked in CO and Architecture Mar 14, 2016

by Jitendra Verma

13.6k views

0 votes

2 answers

7

Computer Organization Question
A computer with 32-bit wide data bus uses 4 K x 8 static RAM memory chips. The smallest memory this computer can have is: (a) 32 kb (b) 16 kb (c) 8 kb (d) 24 kb

spawndon asked in CO and Architecture Jan 12, 2016

3.2k views

0 votes

0 answers

8

Find Number of Lexeme and Tokens
Find Number Of Lexeme And Tokens in the Below FORTRAN Code. [ ignore the white spaces only ] ( pls also explain me what do the code mean ) DO 10 I = 100 DO 10 I=10,1 DO 10 I = 10.1

pC asked in Compiler Design Jan 11, 2016

by pC

1.4k views

4 votes

1 answer

9

Is this question part of syllabus?
Given answer: B

shikharV asked in Digital Logic Dec 4, 2015

927 views

0 votes

0 answers

10

Are questions on computational complexity completely out of Gate 2016 syllabus?
I want to know whether the problems on NP, P, NP-Hard, NP-complete are completely out of Gate 2016 syllabus?

shikharV asked in Others Nov 10, 2015

533 views

0 votes

1 answer

11

MAX RESOLUTION SUPPORT
System having 8 MB of video memory for bit mapped graphics with 64 bit color what is max resolution can support

monali asked in Operating System Oct 7, 2015

by monali

1.6k views

12 votes

3 answers

12

GATE CSE 2015 Set 3 | Question: 50
The velocity $v$ (in kilometer/minute) of a motorbike which starts form rest, is given at fixed intervals of time $t$ (in minutes) as follows: t 2 4 6 8 10 12 14 16 18 20 v 10 18 25 29 32 20 11 5 2 0 The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson's $1/3^{rd}$ rule is ________.

go_editor asked in Numerical Methods Feb 16, 2015

7.5k views

11 votes

2 answers

13

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_______________.

makhdoom ghaya asked in IS&Software Engineering Feb 13, 2015

by makhdoom ghaya

13.1k views

28 votes

6 answers

14

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.

go_editor asked in Graph Theory Feb 12, 2015

12.6k views

16 votes

2 answers

15

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.

go_editor asked in Theory of Computation Feb 12, 2015

6.4k views

5 votes

1 answer

16

maths_mock_test
How many labelled sub-graphs of $K_n$ are isomorphic to $W_{n-1}$? (Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $ n+1$ vertices) 1.$\frac{(n-1)!}{2}$ 2. $\frac{(n-2)!}{2}$ 3. $\frac{n!}{2(n-1)}$ 4. $\frac{n!}{2(n-1)^2}$

Vikrant Singh asked in Graph Theory Feb 1, 2015

by Vikrant Singh

859 views

0 votes

0 answers

17

2012 numerical methed

Nisha kumari asked in Numerical Methods Jan 29, 2015

by Nisha kumari

287 views

4 votes

2 answers

18

No of vertices in Planar graph
If G is a planar graph with 35 regions each of degree 6 the no of vertices are a) 70 b) 80 c) 72 d) 62 What does degree of a region specify here?

dhingrak asked in Graph Theory Nov 30, 2014

9.1k views

7 votes

2 answers

19

GATE IT 2005 | Question: 18
The shell command find -name passwd -print is executed in /etc directory of a computer system running Unix. Which of the following shell commands will give the same information as the above command when executed in the same directory? ls passwd cat passwd grep name passwd grep print passwd

Ishrat Jahan asked in Operating System Nov 3, 2014

by Ishrat Jahan

3.2k views

9 votes

2 answers

20

GATE IT 2005 | Question: 17
A student wishes to create symbolic links in a computer system running Unix. Three text files named $``\text{file 1}", ``\text{file 2}"$ and $``\text{file 3}"$ exist in her current working directory, and the student has read and ... information would be lost from her file system? Hobbies Friends Courses I and II only II and III only II only I and III only

Ishrat Jahan asked in Operating System Nov 3, 2014

by Ishrat Jahan

4.1k views

5 votes

4 answers

21

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

Ishrat Jahan asked in Computer Networks Nov 2, 2014

by Ishrat Jahan

7.2k views

3 votes

1 answer

22

GATE IT 2004 | Question: 38
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula? 8 8(1/3) 8(2/3) 9

Ishrat Jahan asked in Numerical Methods Nov 2, 2014

by Ishrat Jahan

3.6k views

0 votes

2 answers

23

GATE IT 2004 | Question: 30
Consider the following statements: telnet, ftp and http are application layer protocols. EJB (Enterprise Java Beans) components can be deployed in a J2EE (Java2 Enterprise Edition) application server. If two languages conform to the Common Language Specification (CLS) of the ... other. Which statements are true? I and II only II and III only I and III only I, II and III

Ishrat Jahan asked in Web Technologies Nov 2, 2014

by Ishrat Jahan

1.8k views

1 vote

2 answers

24

GATE IT 2004 | Question: 29
Which of the following objects can be used in expressions and scriplets in JSP (Java Server Pages) without explicitly declaring them? session and request only request and response only response and session only session, request and response

Ishrat Jahan asked in Web Technologies Nov 2, 2014

by Ishrat Jahan

3.0k views

2 votes

2 answers

25

GATE IT 2004 | Question: 16
Which of the following commands or sequences of commands will rename a file x to file y in a Unix system ? mv y, x mv x, y cp y, x (rm x) cp x, y (rm x) II and III II and IV I and III II only

Ishrat Jahan asked in Operating System Nov 1, 2014

by Ishrat Jahan

3.9k views

6 votes

1 answer

26

GATE IT 2006 | Question: 10
A problem in NP is NP-complete if it can be reduced to the 3-SAT problem in polynomial time the 3-SAT problem can be reduced to it in polynomial time it can be reduced to any other problem in NP in polynomial time some problem in NP can be reduced to it in polynomial time

Ishrat Jahan asked in Algorithms Oct 31, 2014

by Ishrat Jahan

6.0k views

0 votes

2 answers

27

GATE IT 2007 | Question: 75
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. ... utilization of the token ring when tt = 5 ms, tp = 3 ms, N = 15 is: 0.545 0.655 0.9375 0.961

Ishrat Jahan asked in Computer Networks Oct 30, 2014

by Ishrat Jahan

2.1k views

3 votes

2 answers

28

GATE IT 2007 | Question: 74
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. ... utilization of the token ring when tt =3 ms, tp = 5 ms, N = 10 is 0.545 0.6 0.857 0.961

Ishrat Jahan asked in Computer Networks Oct 30, 2014

by Ishrat Jahan

3.6k views

1 vote

1 answer

29

GATE IT 2007 | Question: 59
The contents of the text file t1 txt containing four lines are as follows : a1 b1 a2 b2 a3 b2 a4 b1 The contents of the text file t2 txt containing five lines are as follows : a1 c1 a2 c2 a3 c3 a4 c3 a5 c4 Consider the following Bourne ... that the given strings may be substrings of a printed line.) "b1 c1" "b2 c3" "b1 c2" "b1 c3"

Ishrat Jahan asked in Operating System Oct 30, 2014

by Ishrat Jahan

1.5k views

0 votes

1 answer

30

GATE IT 2007 | Question: 52
Given the following algorithm for sorting an array X and N numbers: SUBROUTINE SHORT (X, N) IF (N < 2) RETURN FOR (i = 2) TO N INCREMENT BY 1) FOR (j = 1) TO i INCREMENT BY 1) IF (X [i] > X [j]) CONTINUE TEMP = X[i] X[i] = X[j] X[j] = TEMP END FOR END SUBROUTINE A good approximation of Halstead`s estimated program length is 20 50 80 110

Ishrat Jahan asked in IS&Software Engineering Oct 30, 2014

by Ishrat Jahan

841 views

Page:

1
2
3
4
next »

Recent questions tagged out-of-syllabus-now