NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 451 - 456 of 2104

Access detailed explanations (illustrated with images and videos) to 2104 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time!

View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 451

» System Software and Compilers » Parsing and Parse Trees

Edit

Appeared in Year: 2012

MCQ▾

Question

Which of the following is the most powerful parsing method? (December Paper II)

Choices

Choice (4)Response

a.

LL (I)

b.

Canonical LR

c.

SLR

d.

LALR

Question number: 452

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2012

MCQ▾

Question

In which tree, for every node the height of its left subtree and right subtree differ almost by one? (December Paper II)

Choices

Choice (4)Response

a.

Binary search tree

b.

AVL tree

c.

Threaded Binary Tree

d.

Complete Binary Tree

Question number: 453

» Operating Systems with Unix » Basic Concepts » Interrupts,System Calls,Instructions

Edit

Appeared in Year: 2012

MCQ▾

Question

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using: (December Paper II)

Choices

Choice (4)Response

a.

Parity bit

b.

Aging

c.

Compaction

d.

Timer

Question number: 454

» Computer Graphics » Graphic Standard

Edit

Appeared in Year: 2012

MCQ▾

Question

Which API is used to draw a circle? (December Paper II)

Choices

Choice (4)Response

a.

Circle

b.

Ellipse

c.

Round Rect

d.

Pie

Question number: 455

» Software Engineering » System Development Life Cycle » Prototypes

Edit

Appeared in Year: 2012

MCQ▾

Question

RAD stands for ________. (December Paper II)

Choices

Choice (4)Response

a.

Rapid Aided Development

b.

Rapid Application Design

c.

Rapid Application Development

d.

Rapid and Design

Question number: 456

» Data and File Structures » Stacks

Edit

Appeared in Year: 2012

MCQ▾

Question

Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push (5), Pop, what is the value of the top of the stack? (December Paper II)

Choices

Choice (4)Response

a.

4

b.

3

c.

2

d.

1

Developed by: