Dark Mode

Recent questions tagged out-of-syllabus-now

1 vote

1 answer

31

GATE IT 2007 | Question: 51
The following table shows the time between failures for a software system. Error Number 1 2 3 4 5 Time since last failure(hours) 6 4 8 5 6 The reliability of the system for one hour of operation assuming an exponential model is : 0.45 0.63 0.84 0.95

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

by Ishrat Jahan

2.0k views

7 votes

1 answer

32

GATE IT 2007 | Question: 35
Early binding refers to a binding performed at compile time and late binding refers to a binding performed at execution time. Consider the following statements: Static scope facilitates w1 bindings. Dynamic scope requires w2 bindings. Early bindings w3 ... , decrease, increase Late, early, increase, decrease Late, early, decrease, increase Early, late, increase, decrease

Ishrat Jahan asked in Programming in C Oct 29, 2014

by Ishrat Jahan

5.1k views

0 votes

1 answer

33

GATE IT 2007 | Question: 22
The trapezoidal method is used to evaluate the numerical value of $\int_{0}^{1}e^x dx$. Consider the following values for the step size h. 10-2 10-3 10-4 10-5 For which of these values of the step size h, is the computed value guaranteed to be correct ... that there are no round-off errors in the computation. iv only iii and iv only ii, iii and iv only i, ii, iii and iv

Ishrat Jahan asked in Numerical Methods Oct 29, 2014

by Ishrat Jahan

1.5k views

1 vote

1 answer

34

GATE IT 2007 | Question: 20
Consider the XML document fragment given below: <Book> <Title>GATE 2K7 Example<Title> <Content> One of many lines </Content> <TOC> One of many content entries </TOC> </Book> Consider the XPath ... The Title and Content elements The Content and TOC elements The Title and TOC elements The Title, Content and TOC elements

Ishrat Jahan asked in Web Technologies Oct 29, 2014

by Ishrat Jahan

1.2k views

0 votes

0 answers

35

GATE IT 2008 | Question: 14
Consider the execution of the following commands in a shell on a Linux operating system. bash\$ cat alpha Mathematics bash\$ In alpha beta bash\$ rm alpha bash\$ cat >> beta << SAME ... The output of the last command will be: Mathematics Information Technology SAME Mathematics Information Technology Information Technology Information Technology SAME

Ishrat Jahan asked in Operating System Oct 27, 2014

by Ishrat Jahan

1.3k views

12 votes

2 answers

36

GATE IT 2008 | Question: 13
Match the programming paradigms and languages given in the following table. Paradigms Languages (I) Imperative (a) Prolog (II) Object Oriented (b) Lisp (III) Functional (c) C, Fortran 77, Pascal (IV) Logic (d) C++, Smalltalk, Java I-c, II-d, III-b, IV-a I-a, II-d, III-c, IV-b I-d, II-c, III-b, IV-a I-c, II-d, III-a, IV-b

Ishrat Jahan asked in Programming in C Oct 27, 2014

by Ishrat Jahan

5.6k views

10 votes

3 answers

37

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

Ishrat Jahan asked in Algorithms Oct 27, 2014

by Ishrat Jahan

7.1k views

3 votes

1 answer

38

GATE CSE 1996 | Question: 19
Consider the following program in pseudo-Pascal syntax. What is printed by the program if parameter $a$ in procedure $\text{test1}$ is passed as call-by-reference parameter call-by-value-result parameter program Example (input, output) var b: integer; procedure test2: begin b ... ', a, b); end begin (*Example*) b:=3; test1(b); writeln('point3: ', b); end

Kathleen asked in Programming in C Oct 9, 2014

1.5k views

0 votes

1 answer

39

GATE CSE 1996 | Question: 6
An 8052 based system has an output port with address 00H. Consider the following assembly language program. ORG 0100H MVI A, 00H LXI H, 0105H OUT 00H INR A PCHL HLT What does the program do with respect to the output port $00H$ ? Show the waveforms at the three least significant bits of the port $00H$.

Kathleen asked in CO and Architecture Oct 9, 2014

797 views

4 votes

2 answers

40

GATE CSE 1996 | Question: 2.5
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c > 0$ is $x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 + c}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - c}{3x_n^2}$

Kathleen asked in Numerical Methods Oct 9, 2014

1.8k views

3 votes

2 answers

41

GATE CSE 1996 | Question: 1.22
Number of machine cycles required for RET instruction in 8085 microprocessor is 1 2 3 5

Kathleen asked in CO and Architecture Oct 9, 2014

3.5k views

0 votes

0 answers

42

GATE CSE 1995 | Question: 16

Kathleen asked in CO and Architecture Oct 8, 2014

579 views

0 votes

0 answers

43

GATE CSE 1995 | Question: 10

Kathleen asked in Others Oct 8, 2014

457 views

0 votes

0 answers

44

GATE CSE 1995 | Question: 2.11

Kathleen asked in Others Oct 8, 2014

579 views

2 votes

0 answers

45

GATE CSE 1995 | Question: 1.13

Kathleen asked in Others Oct 8, 2014

1.4k views

0 votes

0 answers

46

GATE CSE 1994 | Question: 10

Kathleen asked in CO and Architecture Oct 5, 2014

476 views

0 votes

0 answers

47

GATE CSE 1994 | Question: 3.10
Match the following items (i) ECL (a) Unipolar; very high speed; difficult to fabricate; good resistance to radiation (ii) Ga As (b) Unipolar; low power; modest speed and packing density (iii) TTL (c) Bipolar; highest speed silicon IC; low packing density (iv) CMOS (d) Bipolar, modest packing density, inexpensive

Kathleen asked in Integrated Circuits Oct 5, 2014

597 views

0 votes

0 answers

48

GATE CSE 1994 | Question: 3.1

Kathleen asked in CO and Architecture Oct 4, 2014

662 views

0 votes

0 answers

49

GATE CSE 1993 | Question: 7.5

Kathleen asked in Others Sep 29, 2014

491 views

0 votes

0 answers

50

GATE CSE 1993 | Question: 7.1,2,3

Kathleen asked in Others Sep 29, 2014

517 views

0 votes

0 answers

51

GATE CSE 1997 | Question: 24

Kathleen asked in Others Sep 29, 2014

565 views

0 votes

0 answers

52

GATE CSE 1997 | Question: 22

Kathleen asked in Others Sep 29, 2014

360 views

4 votes

1 answer

53

GATE CSE 1997 | Question: 10
Consider the following program in Pseudo-Pascal syntax. program what: var z: integer procedure recur(x): begin if x <= 40 then begin x:x+z recur(x); z:=x+10 end end(*recur*) begin(*what*) z=10; recur(z); writeln(z) end ... by program? How many times is ‘recur’ called? What value is printed by the program if the parameter is passed by reference?

Kathleen asked in Programming in C Sep 29, 2014

2.1k views

0 votes

0 answers

54

GATE CSE 1997 | Question: 8

Kathleen asked in Others Sep 29, 2014

435 views

0 votes

0 answers

55

GATE CSE 1997 | Question: 7

Kathleen asked in Digital Logic Sep 29, 2014

649 views

0 votes

0 answers

56

GATE CSE 1997 | Question: 4.8

Kathleen asked in Others Sep 29, 2014

536 views

1 vote

1 answer

57

GATE CSE 1997 | Question: 2.2
RST 7.5 interrupt in 8085 microprocessor executes the interrupt service routing from interrupt vector location 0000H 0075H 003CH 0034H

Kathleen asked in CO and Architecture Sep 29, 2014

3.0k views

11 votes

3 answers

58

GATE CSE 2014 Set 3 | Question: 38
Consider the decision problem $2CNFSAT$ defined as follows: $\left\{ \phi \mid \phi \text{ is a satisfiable propositional formula in CNF with at most two literals per clause}\right\}$ ... by reduction to directed graph reachability. solvable in constant time since any input instance is satisfiable. NP-hard but not NP-complete.

go_editor asked in Theory of Computation Sep 28, 2014

3.8k views

13 votes

5 answers

59

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)?

go_editor asked in Theory of Computation Sep 28, 2014

8.1k views

15 votes

2 answers

60

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

Rucha Shelke asked in Programming in C Sep 26, 2014

by Rucha Shelke

6.7k views

Page:

Recent questions tagged out-of-syllabus-now