Recent questions tagged out-of-syllabus-now / GATE Overflow for GATE CSE

1 votes

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

The following table shows the time between failures for a software system.Error Number12345Time since last failure(hours)64856The reliability of the system for one hour o...

Ishrat Jahan

2.0k views

Ishrat Jahan asked Oct 30, 2014

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

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

Ishrat Jahan

5.2k views

Ishrat Jahan asked Oct 29, 2014

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

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-210-310-410-5For which of th...

Ishrat Jahan

1.5k views

Ishrat Jahan asked Oct 29, 2014

1 votes

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

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

Ishrat Jahan

1.2k views

Ishrat Jahan asked Oct 29, 2014

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

Consider the execution of the following commands in a shell on a Linux operating system.bash\$ cat alphaMathematicsbash\$ In alpha betabash\$ rm alphabash\$ cat > beta ...

Ishrat Jahan

1.3k views

Ishrat Jahan asked Oct 27, 2014

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

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, Fortra...

Ishrat Jahan

5.7k views

Ishrat Jahan asked Oct 27, 2014

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

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

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

Consider the following program in pseudo-Pascal syntax. What is printed by the program if parameter $a$ in procedure $\text{test1}$ is passed ascall-by-reference paramete...

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true