NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 608 - 612 of 2012

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 608

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2013

MCQ▾

Question

How many edges are there in a forest of t-trees containing a total of n vertices? (December Paper-II)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 609

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2013

MCQ▾

Question

Given a binary search tree for a set of keys with the following probabilities:

Table shows the probabilities

Table shows the probabilities

0

1

2

3

4

5

-

0.15

0.10

0.50

0.10

0.20

0.05

0.10

0.05

0.05

0.05

0.10

The expected optimal cost of the search is (September Paper-III)

Choices

Choice (4) Response

a.

2.65

b.

2.70

c.

2.75

d.

2.80

Question number: 610

» Fuzzy Systems » Fuzzy Logic Tools

Edit

Appeared in Year: 2013

MCQ▾

Question

Let A be the set of comfortable houses given as and B be the set of affordable houses Then the set of comfortable and affordable houses is (September Paper-III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 611

» Programming in C and C Plus Plus » Programming in C » Elements of C-Tokens, Identifiers, Data Types in C

Edit

Appeared in Year: 2013

MCQ▾

Question

Trace the error:

  1. voidmain()
  2. {
  3.     int*b,&a;
  4.     *b=20
  5.     printf(“%d,%d”,a,*b)
  6. }

(June Paper III)

Choices

Choice (4) Response

a.

No error

b.

Logical error

c.

Syntax error

d.

Semantic error

Question number: 612

» Theory of Computation » Computability » Models of Computation-Finite Automata

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following: (June Paper III)

List-Ⅰ (Column I) List-Ⅱ (Column II)

(A)

Regular grammar

(i)

Recursive enumerable

(B)

Context sensitive language

(ii)

Pushdown automation

(C)

Unrestricted grammar

(iii)

Recursive language

(D)

Context free grammar

(iv)

Deterministic finite automation

Choices

Choice (4) Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (iv)
  • (iii)
  • (i)
  • (ii)

b.

  • (iii)
  • (i)
  • (iv)
  • (ii)

c.

  • (iii)
  • (ii)
  • (iv)
  • (i)

d.

  • (iii)
  • (iv)
  • (i)
  • (ii)

Developed by: