For a linear search in an array of n elements the time compl...

MCQ

For a linear search in an array of n elements the time complexity for best, worst and average case are ......., ....... and ........ respectively

O(1),O(n) and O(n)

O(1), O(n) and O(n/2)

O(n), O(1), and O(n/2)

O(1), O(n) and (n-1/2)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What are some of the applications of sorted arrays?

Commercial computing

Priority Scheduling

Discrete Mathematics

All of the mentioned

Discussion

MCQ

What is the output of the following piece of code?

public class array
{
 public static void main(String args[])
 {
  int []arr = {1,2,3,4,5};
  System.out.println(arr[2]);
  System.out.println(arr[4]);
 }
}

3 and 5

5 and 3

2 and 4

4 and 2

Discussion

MCQ

For a linear search in an array of n elements the time complexity for best, worst and average case are ......., ....... and ........ respectively

O(1),O(n) and O(n)

O(1), O(n) and O(n/2)

O(n), O(1), and O(n/2)

O(1), O(n) and (n-1/2)

Discussion

MCQ

Advantages of linked list representation of binary trees over arrays?

dynamic size

ease of insertion/deletion

ease in randomly accessing a node

both dynamic size and ease in insertion/deletion

Discussion

MCQ

The memory address of fifth element of an array can be calculated by the formula

LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array

LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array

None of above

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics