• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

ISRO CS 2008

Question 61

The page replacement algorithm which gives the lowest page fault rate is
  • LRU
  • FIFO
  • Optimal page replacement
  • Second chance algorithm

Question 62

Which of the following class of statement usually produces no executable code when compiled?
  • declaration
  • assignment statements
  • input and output statements
  • structural statements

Question 63

What is the value of F(4) using the following procedure:
function F(K : integer)
integer;
begin
if (k<3) then F:=k 
else F:=F(k-1)*F(k-2)+F(k-3)
end;
  • 5
  • 6
  • 7
  • 8

Question 64

In DNA sequence alignment, which string-matching algorithm is commonly used to identify similarities between two DNA sequences efficiently?

  • Rabin-Karp algorithm

  • Knuth-Morris-Pratt algorithm

  • Z function

  • None of the above

Question 65

Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

  • Deleting a node whose location is given

  • Searching an unsorted list for a given item

  • Inserting a node after the node with a given location

  • Traversing the list to process each node

Question 66

The time required to search an element in a linked list of length n is

  • O (log n)

  • O (n)

  • O (1)

  • O (n2)

Question 67

A Steiner patch is

  • Biquadratic Bezier patch

  • Bicubic patch

  • Circular patch only

  • Bilinear Bezier patch

Question 68

A complete binary tree with the property that the value at each node is as least as large as the values at its children is known as

  • Binary search tree

  • AVL tree

  • Completely balanced tree

  • Heap

Question 69

The minimum number of fields with each node of doubly linked list is

  • 1

  • 2

  • 3

  • 4

Question 70

How many comparisons are needed to sort an array of length 5 if a straight selection sort is used and array is already in the opposite order?
  • 1
  • 5
  • 10
  • 20

There are 80 questions to complete.

Last Updated :
Take a part in the ongoing discussion