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

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

1 Answer

Answer :

C) Merge Sort
by

Related questions

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

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 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

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

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

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

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

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

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

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

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.

In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Description : In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Last Answer : (C) Shared memory segments 

Which one of the following array represents a binary max-heap? (A) [26, 13, 17, 14, 11, 9, 15] (B) [26, 15, 14, 17, 11, 9, 13] (C) [26, 15, 17, 14, 11, 9, 13] (D) [26, 15, 13, 14, 11, 9, 17]

Description : Which one of the following array represents a binary max-heap? (A) [26, 13, 17, 14, 11, 9, 15] (B) [26, 15, 14, 17, 11, 9, 13] (C) [26, 15, 17, 14, 11, 9, 13] (D) [26, 15, 13, 14, 11, 9, 17]

Last Answer : (C) [26, 15, 17, 14, 11, 9, 13]

Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit heap dynamic (iv) All objects in JAVA Codes: (a) (b) (c) (d) (A) (i) (iii) (iv) (ii) (B) (iv) (i) (iii) (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Description : Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit ... (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Last Answer : (C) (iii) (i) (iv) (ii) 

The ……………. Operator is known as insertion operator. A) >> B) > C) << D) <

Description : The ……………. Operator is known as insertion operator. A) >> B) > C)

Last Answer : C)

……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Description : ……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Last Answer : D) Traversal

………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above

Description : ………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above

Last Answer : D) None of the above

.......... displays the information about the active document such as page number, section number, number of pages, insertion point, position, etc. A) View Bar B) Menu Bar C) Status Bar D) Ruler Lin

Description : .......... displays the information about the active document such as page number, section number, number of pages, insertion point, position, etc. A) View Bar B) Menu Bar C) Status Bar D) Ruler Lin

Last Answer : C) Status Bar

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.

Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.

Last Answer : (D) Deletion of the last node of the linked list. 

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

An ammeter with an internal resistance of 50 ohm(s) is used to measure a current thorugh a lod resistor Rl = 1 kohm(s). Determine the percentage error of the reading due to ammeter insertion.

Description : An ammeter with an internal resistance of 50 ohm(s) is used to measure a current thorugh a lod resistor Rl = 1 kohm(s). Determine the percentage error of the reading due to ammeter insertion.

Last Answer : 50/(50+1k)*100 = 4.76%

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 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 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

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)

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))

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)

Description : 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)

Last Answer : Answer: C

Which one of the following processes is responsible for the glittering of air bubble rising through water? (1) Reflection of light (2) Refraction of light (3) Total internal reflection of light (4) Scattering of light

Description : Which one of the following processes is responsible for the glittering of air bubble rising through water? (1) Reflection of light (2) Refraction of light (3) Total internal reflection of light (4) Scattering of light

Last Answer : (3) Total internal reflection of light Explanation: Total internal reflection is responsible for glittering which occurs when the light from a denser media (liquid) tries to enter less dense media (air in bubble). This reflected light when captured by our eyes is seen as glittering.

The pressure outside a bubble/droplet of liquid is __________ the internal pressure. (A) Greater than (B) Less than (C) Equal to (D) Unpredictable; depends on the bubble size

Description : The pressure outside a bubble/droplet of liquid is __________ the internal pressure. (A) Greater than (B) Less than (C) Equal to (D) Unpredictable; depends on the bubble size

Last Answer : Option B

Which one of the following processes is responsible for the glittering of air bubble rising through water? (1) Reflection of light (2) Refraction of light (3) Total internal reflection of light (4) Scattering of light

Description : Which one of the following processes is responsible for the glittering of air bubble rising through water? (1) Reflection of light (2) Refraction of light (3) Total internal reflection of light (4) Scattering of light

Last Answer : Total internal reflection of light

Can you dispose of paper in a compost heap?

Description : Can you dispose of paper in a compost heap?

Last Answer : There’s chemicals used in paper manufacturing; bleaches and dyes and so forth, that can leech into the compost, I’d imagine. I wouldn’t put paper in the compost, no.

Does anyone know how to build a compost heap?

Description : Does anyone know how to build a compost heap?

Last Answer : This link has a pretty good explanation as to how to do so.

A heap of wheat is in the form of a cone whose diameter is 10.5 m and height is 3 m. -Maths 9th

Description : A heap of wheat is in the form of a cone whose diameter is 10.5 m and height is 3 m. -Maths 9th

Last Answer : Diameter of cone = 10.5 m Radius of cone (r) = 5.25 m Height of cone (h) = 3 m Volume of cone = 1 / 3 πr2h = 1 / 3 × 22 / 7 × 5.25 × 5.25 × 3 = 86.625m3 Cost of 1m3 of wheat = 10 ∴ Cost of 86.625 m3 of wheat = 10 × 86.625 = 86.625

A heap of wheat is in the form of a cone whose diameter is 10.5 m and height is 3 m. -Maths 9th

Description : A heap of wheat is in the form of a cone whose diameter is 10.5 m and height is 3 m. -Maths 9th

Last Answer : Diameter of cone = 10.5 m Radius of cone (r) = 5.25 m Height of cone (h) = 3 m Volume of cone = 1 / 3 πr2h = 1 / 3 × 22 / 7 × 5.25 × 5.25 × 3 = 86.625m3 Cost of 1m3 of wheat = 10 ∴ Cost of 86.625 m3 of wheat = 10 × 86.625 = 86.625

A heap of wheat is in the form of a cone whose diameter is 10.5 m -Maths 9th

Description : A heap of wheat is in the form of a cone whose diameter is 10.5 m -Maths 9th

Last Answer : Radius of the conical heap of wheat (r) = 10.5/2 m Height of the conical heap of wheat (h) = 3 m Volume of the conical heap of wheat = 1/3 πr2h = 1/3 x 22/7 x (10.5/2)2 x 3 = 173.25/2 = 86.625 ... = 6.05 m Area of canvas required = curved surface area of cone πrl = 22/7 x 10.5/2 x 6.05 = 99.825 m2

what is a heap

Description : what is a heap

Last Answer : Need Answer

When Marrion divided 24 oranges into 3 heaps in the ratio 4 to 5 to 3 how many oranges were in each heap?

Description : When Marrion divided 24 oranges into 3 heaps in the ratio 4 to 5 to 3 how many oranges were in each heap?

Last Answer : There are 8, 10 and 6.

What is the collective noun heap?

Description : What is the collective noun heap?

Last Answer : The noun 'heap' is used as a collective noun for: a heap oftrash.

What is the difference between the stack and the heap?

Description : What is the difference between the stack and the heap?

Last Answer : The stack is a local memory reserve where the program stores variable and function data. The heap is a special memory reserve where the programmer can dynamically allocate memory from. The heap is useful ... large to make certain variables, he just constructs one of the right size during run-time.

The layers of vegetable wastes and night soil alternatively piled above the ground to form a mound, is called A. A heap B. Plateau C. Windrow D. None of these

Description : The layers of vegetable wastes and night soil alternatively piled above the ground to form a mound, is called A. A heap B. Plateau C. Windrow D. None of these

Last Answer : ANS: D

Is a struct stored on the heap or stack?

Description : Is a struct stored on the heap or stack? 

Last Answer : Stack

What is a heap and a stack?

Description : What is a heap and a stack?

Last Answer : There are 2 kinds of heap - 1: a chunk of memory where data is stored and 2: a tree based data structure. When we talk about the heap and the stack we mean the first kind of ... a LIFO data structure that stores variables and flow control information. Typically each thread will have its own stack.