An ideal sort is an in-place-sort whose additional space requirement is ............... (A) O(log2n) (B) O(nlog2n) (C) O(1) (D) O(n)

An ideal sort is an in-place-sort whose additional space requirement is ............... (A) O(log2n) (B) O(nlog2n) (C) O(1) (D) O(n)
by

1 Answer

Answer :

Answer: C
by

Related questions

In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Last Answer : D) [log2n]+1

Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Description : Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Last Answer : (D) O(n+m)

Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Description : If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Last Answer : (D) O(d(n+k))

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

Which of the following sorting algorithm is in-place a) Counting sort b) Radix sort c) Bucket sort d) None

Description : Which of the following sorting algorithm is in-place a) Counting sort b) Radix sort c) Bucket sort d) None

Last Answer : b) Radix sort

Which of the following is not an in-place sorting algorithm? a) Selection sort b) Heap sort c) Quick sort d) Merge sort

Description : Which of the following is not an in-place sorting algorithm? a) Selection sort b) Heap sort c) Quick sort d) Merge sort

Last Answer : merge sort

Which of the following is a stable sorting algorithm? a) Merge sort b) Typical in-place quick sort c) Heap sort d) Selection sort

Description : Which of the following is a stable sorting algorithm? a) Merge sort b) Typical in-place quick sort c) Heap sort d) Selection sort

Last Answer : a) Merge sort

The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Description : The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Last Answer : (D) O(logn log logn)

The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 )

Description : The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 ) 

Last Answer : (C) O(n) 

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) (3) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Description : Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), ... (1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Last Answer : Answer: 3

……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by

Description : ……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by

Last Answer : C) Having

Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Description : Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Last Answer : (B) 80 msec

………….. Phase is a time consuming phase and yet a very crucial phase A) Feasibility Study B) Requirement Phase C) Analysis Phase D) Testing Phase

Description : ………….. Phase is a time consuming phase and yet a very crucial phase A) Feasibility Study B) Requirement Phase C) Analysis Phase D) Testing Phase

Last Answer : C) Analysis Phase

Based on the identification of objectives, input, output and file content, the vital document is called … A) System Definition B) System Document C) System Requirement Document D) System Subject

Description : Based on the identification of objectives, input, output and file content, the vital document is called … A) System Definition B) System Document C) System Requirement Document D) System Subject

Last Answer : B) System Document

Which one of the following is not a step of requirement engineering ? (A) Requirement elicitation (B) Requirement analysts (C) Requirement design (D) Requirement documentation

Description : Which one of the following is not a step of requirement engineering ? (A) Requirement elicitation (B) Requirement analysts (C) Requirement design (D) Requirement documentation

Last Answer : (C) Requirement design

Software Configuration Management is the discipline for systematically controlling (A) the changes due to the evolution of work products as the project proceeds. (B) the changes due to defects (bugs) being found and then fixed. (C) the changes due to requirement changes (D) all of the above

Description : Software Configuration Management is the discipline for systematically controlling (A) the changes due to the evolution of work products as the project proceeds. (B) the changes due to defects (bugs) being found and then fixed. (C) the changes due to requirement changes (D) all of the above

Last Answer : (D) all of the above

The software ................. of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. (A) Design (B) Architecture (C) Process (D) Requirement

Description : The software ................. of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. (A) Design (B) Architecture (C) Process (D) Requirement

Last Answer : (B) Architecture

Requirement Development, Organizational Process Focus, Organizational Training, Risk Management and Integrated Supplier Management are process areas required to achieve maturity level (A) Performed (B) Managed (C) Defined (D) Optimized

Description : Requirement Development, Organizational Process Focus, Organizational Training, Risk Management and Integrated Supplier Management are process areas required to achieve maturity level (A) Performed (B) Managed (C) Defined (D) Optimized

Last Answer : (C) Defined

Requirements prioritization and negotiation belongs to: (A) Requirements validation (B) Requirements elicitation (C) Feasibility Study (D) Requirement reviews

Description : Requirements prioritization and negotiation belongs to: (A) Requirements validation (B) Requirements elicitation (C) Feasibility Study (D) Requirement reviews

Last Answer : (B) Requirements elicitation

Which one of the following statements, related to the requirements phase in Software Engineering, is incorrect ? (A) “Requirement validation” is one of the activities in the requirements phase. (B) “Prototyping” is one of the methods for requirement analysis. (C) “Modelling-oriented approach” is one of the methods for specifying the functional specifications. (D) “Function points” is one of the most commonly used size metric for requirements.

Description : Which one of the following statements, related to the requirements phase in Software Engineering, is incorrect ? (A) Requirement validation is one of the activities in the requirements phase. (B) ... . (D) Function points is one of the most commonly used size metric for requirements. 

Last Answer : (C) “Modelling-oriented approach” is one of the methods for specifying the functional specifications. 

Which of the following is not included in waterfall model ? (A) Requirement analysis (B) Risk analysis (C) Design (D) Coding

Description : Which of the following is not included in waterfall model ? (A) Requirement analysis (B) Risk analysis (C) Design (D) Coding

Last Answer : (B) Risk analysis

The major shortcoming of waterfall model is (A) the difficulty in accommodating changes after requirement analysis. (B) the difficult in accommodating changes after feasibility analysis. (C) the system testing. (D) the maintenance of system.

Description : The major shortcoming of waterfall model is (A) the difficulty in accommodating changes after requirement analysis. (B) the difficult in accommodating changes after feasibility analysis. (C) the system testing. (D) the maintenance of system.

Last Answer : (A) the difficulty in accommodating changes after requirement analysis.

What is the difference between selection sort and bubble sort?

Description : What is the difference between selection sort and bubble sort?

Last Answer : A: In selection sort, successive rounds are executed to select the element which is required to be placed in their sorted position, whereas, in bubble sort, every consecutive pairs of elements are compared ... element at every pass, whereas, in bubble sort we get the largest element in every pass.

The command which transcribes the standard input to the standard output and also makes a copy of the same in a file is A. tee B. tr C. sort D. grep E. None of the above

Description : The command which transcribes the standard input to the standard output and also makes a copy of the same in a file is A. tee B. tr C. sort D. grep E. None of the above

Last Answer : A. tee

Which command is used to sort the lines of data in a file in reverse order A. sort B. sh C. st D. sort -r E. None of the above

Description : Which command is used to sort the lines of data in a file in reverse order A. sort B. sh C. st D. sort -r E. None of the above

Last Answer : D. sort -r

………… is a sort of blueprint of the system Development Effort. A) MDP B) DMP C) MPD D) DPM

Description : ………… is a sort of blueprint of the system Development Effort. A) MDP B) DMP C) MPD D) DPM

Last Answer : A) MDP

Which of the following is not the internal sort? A) Insertion Sort B) Bubble Sort C) Merge Sort D) Heap Sort

Description : Which of the following is not the internal sort? A) Insertion Sort B) Bubble Sort C) Merge Sort D) Heap Sort

Last Answer : C) Merge Sort

Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach

Description : Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach

Last Answer : a) Divide-and-conquer

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

Description : Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

Last Answer : d) Selection sort

Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Last Answer : b) Selection sort

Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None

Description : Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None

Last Answer : b) Selection sort

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Last Answer : a) Insertion sort

Which of the following is not a stable sorting algorithm? a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort

Description : Which of the following is not a stable sorting algorithm? a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort

Last Answer : b) Selection sort

You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Description : You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Last Answer : (D) Insertion sort

To calculate the ideal body weight for a woman, the nurse allows a) 100 pounds for 5 feet of height. To calculate the ideal body weight of a woman, the nurse allows 100 pounds for 5 feet of height and adds 5 pounds for each additional inch over 5 feet b) 106 pounds for 5 feet of height. The nurse allows 106 pounds for 5 feet of height in calculating the ideal body weight for a man. c) 6 pounds for each additional inch over 5 feet. The nurse adds 6 pounds for each additional inch over 5 feet in calculating the ideal body weight for a man. d) 80 pounds for 5 feet of height. Eighty pounds for 5 feet of height is too little.

Description : To calculate the ideal body weight for a woman, the nurse allows a) 100 pounds for 5 feet of height. To calculate the ideal body weight of a woman, the nurse allows 100 pounds for 5 feet of height and adds ... man. d) 80 pounds for 5 feet of height. Eighty pounds for 5 feet of height is too little.

Last Answer : a) 100 pounds for 5 feet of height. To calculate the ideal body weight of a woman, the nurse allows 100 pounds for 5 feet of height and adds 5 pounds for each additional inch over 5 feet

A two stage compressor is used to compress an ideal gas. The gas is cooled to the initial temperature after each stage. The intermediate pressure for the minimum total work requirement should be equal to the __________ mean of P1 and P2.(where, P1 and P2 are initial and final pressures respectively) (A) Logarithmic (B) Arithmetic (C) Geometric (D) Harmonic

Description : A two stage compressor is used to compress an ideal gas. The gas is cooled to the initial temperature after each stage. The intermediate pressure for the minimum total work requirement should be equal to ... final pressures respectively) (A) Logarithmic (B) Arithmetic (C) Geometric (D) Harmonic

Last Answer : (C) Geometric

Digital Evidence must follow the requirement of the A)Ideal Evidence Rule B)Best Evidence Rule C)Exchange Rule D)All of the mentioned

Description : Digital Evidence must follow the requirement of the A)Ideal Evidence Rule B)Best Evidence Rule C)Exchange Rule D)All of the mentioned

Last Answer : D)All of the mentioned

Digital Evidence must follow the requirement of the A)Ideal Evidence Rule B)Best Evidence Rule C)Exchange Rule D)All of the mentioned

Description : Digital Evidence must follow the requirement of the A)Ideal Evidence Rule B)Best Evidence Rule C)Exchange Rule D)All of the mentioned

Last Answer : D)All of the mentioned

Define alignment and state the requirement of an ideal road alignment.

Description : Define alignment and state the requirement of an ideal road alignment.

Last Answer : Alignment: - The position occupied by centerline of a road in plan is called alignment. Requirements of an ideal road alignment:- 1) Short: - In between two terminal station the alignment ... - The alignment should pass through regions of natural beauty and scenery to have good natural aspects.

A ………………. Is a class whose instances themselves are classes. A) Subclass B) Abstract Class C) Meta Class D) Object Class

Description : A ………………. Is a class whose instances themselves are classes. A) Subclass B) Abstract Class C) Meta Class D) Object Class

Last Answer : C) Meta Class

By an external entity we mean a A) Unit outside the system being designed which can be controlled by an analyst. B) Unit outside the system whose behavior is independent of the system being designed C) A unit external to the system being designed D) A unit which is not part of a DFD

Description : By an external entity we mean a A) Unit outside the system being designed which can be controlled by an analyst. B) Unit outside the system whose behavior is independent of the system being designed C) A unit external to the system being designed D) A unit which is not part of a DFD

Last Answer : C) A unit external to the system being designed

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above

Description : A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above

Last Answer : A) AVL tree