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---
Recursive problems are implemented by-
Recursive problems are implemented by-
The complexity of Bubble sort algorithm is
The complexity of Bubble sort algorithm is
How many divisions are there in COBOL language
How many divisions are there in COBOL language
The complexity of Binary search algorithm is
The complexity of Binary search algorithm is
Which sorting method is slowest----
Which sorting method is slowest----
Which of the following data structure is linear data structure---
Which of the following data structure is linear data structure---
The complexity of linear search algorithm is
The complexity of linear search algorithm is
O log(n) can be connected with
O log(n) can be connected with
Information about an array used in a program will be stored in
Information about an array used in a program will be stored in
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?
A graph with one or more edges is at least
A graph with one or more edges is at least
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 of the languages is often translated to the pseudo code
Which of the languages is often translated to the pseudo code
In C how many parameters can passed to a function?
In C how many parameters can passed to a function?
Repeated execution of simple computation may cause compounding of
Repeated execution of simple computation may cause compounding of
Which of the following name does not relate to stacks
Which of the following name does not relate to stacks
Which is having highest precedence in C--
Which is having highest precedence in C--
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--
Which is ALGOL based simulation language?
Which is ALGOL based simulation language?
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
The complexity of merge sort algorithm is
The complexity of merge sort algorithm is
Deletion from one end and insertion from other end is
Deletion from one end and insertion from other end is
Which is ALGOL based simulation language?
Which is ALGOL based simulation language?
Which is problem oriented language
Which is problem oriented language
Merge sort uses
Merge sort uses
