NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 901 - 905 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: 901

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2017

MCQ▾

Question

Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i < =n), the index of the parent is: (November Paper II)

Choices

Choice (4) Response

a.

Ceiling

b.

Ceiling

c.

d.

Floor

Question number: 902

» Programming in C and C Plus Plus » C Plus Plus Programming » Class and Objects

Edit

Appeared in Year: 2014

MCQ▾

Question

Which of the following is not a member of class? (December Paper II)

Choices

Choice (4) Response

a.

Static function

b.

Friend function

c.

Const function

d.

Virtual function

Question number: 903

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

Edit

Appeared in Year: 2017

MCQ▾

Question

Which of the following scheduling algorithms may cause starvation?

  1. First-come-first-served
  2. Round Robin
  3. Priority
  4. Shortest process next
  5. Shortest remaining time first (January paper II)

Choices

Choice (4) Response

a.

3,4 and 5

b.

2,3 and 4

c.

2,4 and 5

d.

1,3 and 5

Question number: 904

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

Edit
MCQ▾

Question

Which of the following is used for calculating the Disk access time in the Disk Scheduling Algorithms?

Choices

Choice (4) Response

a.

Seek Time

b.

Rotational Latency

c.

Transfer Time

d.

All a. , b. and c. are correct

Question number: 905

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2017

MCQ▾

Question

A list of n strings, each of length n, is sorted into lexicographic order using merge – sort algorithm. The worst case running time of this computation is: (November Paper II)

Choices

Choice (4) Response

a.

b.

c.

d.

Developed by: