The complexity of Binary search algorithm is
The complexity of Binary search algorithm is
O log(n) can be connected with
O log(n) can be connected with
The complexity of Bubble sort algorithm is
The complexity of Bubble sort algorithm is
minimum number of stacks of size n required to implement a queue of size n--
minimum number of stacks of size n required to implement a queue of size n--
In C how many parameters can passed to a function?
In C how many parameters can passed to a function?
A graph with one or more edges is at least
A graph with one or more edges is at least
How many divisions are there in COBOL language
How many divisions are there in COBOL language
Which is problem oriented language
Which is problem oriented language
Recursive problems are implemented by-
Recursive problems are implemented by-
Which is having highest precedence in C--
Which is having highest precedence in C--
Repeated execution of simple computation may cause compounding of
Repeated execution of simple computation may cause compounding of
Which of the following data structure is linear data structure---
Which of the following data structure is linear data structure---
Merge sort uses
Merge sort uses
Deletion from one end and insertion from other end is
Deletion from one end and insertion from other end is
Which data structure is needed to convert infix notations to postfix notations--
Which data structure is needed to convert infix notations to postfix notations--
Which sorting method is slowest----
Which sorting method is slowest----
Which is ALGOL based simulation language?
Which is ALGOL based simulation language?
The complexity of merge sort algorithm is
The complexity of merge sort algorithm is
Recursive problems are implemented by-
Recursive problems are implemented by-
The memory address of the first element of an array is called---
The memory address of the first element of an array is called---
Which of the languages is often translated to the pseudo code
Which of the languages is often translated to the pseudo code
The complexity of linear search algorithm is
The complexity of linear search algorithm is
Information about an array used in a program will be stored in
Information about an array used in a program will be stored in
Sort which compares adjacent elements in a list and switches where necessary is
Sort which compares adjacent elements in a list and switches where necessary is
Which is ALGOL based simulation language?
Which is ALGOL based simulation language?
What are the minimum number of queues needed to implement the priority queue?
What are the minimum number of queues needed to implement the priority queue?
Which of the following name does not relate to stacks
Which of the following name does not relate to stacks
