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
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
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
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
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
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
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
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
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
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
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
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
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.
Description : Mark correct option a) Station articles are intended for delivery from a PO to which they are sent b) Sorting articles are articles that are to be sorted by the Poor Mail Office to which they ... Express bundle require to sort immediately & Differed bundle may be disposed later. e) All the above
Last Answer : e) All the above
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
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
Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)
Last Answer : (D) (a), (b) , (c) and (d)
Description : A Press Sorting Office is: (A) A RMS Office where the articles received from the various Presses and publishers are only sorted (B) A RMS office situated on the premises of a newspaper ... ) A branch of a Sorting Mail Office dealing with articles from Press / Publishers and Registered newspapers
Last Answer : (C) (B) above, plus where the articles received from the newspaper publisher is sorted and despatched and where the entire expenditure of the establishment of the office is borne by the newspaper publisher
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
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
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
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
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.
Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True
Last Answer : D) True, True
Description : The time that depends on the input: an already sorted sequence that is easier to sort. a) Process b) Evaluation c) Running d) Input
Last Answer : Answer: c Explanation: The running time depends on the input: an already sorted sequence is easier to sort. The running time is given by the size of the input, since short sequences are easier to sort than the longer ones. Generally, we seek upper bounds on the running time, because it is reliable
Description : Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. ... of such messages. (D) In PVM Model, the message order is not preserved.
Last Answer : (D) In PVM Model, the message order is not preserved.
Description : A perfectly spherical bubble of air is suspended in a tank of water. A beam of light consisting of parallel rays passes through the bubble. As the light emerges from the opposite side of the bubble the light rays: w) diverge x) converge y) are unaffected
Last Answer : ANSWER: W -- DIVERGE
Description : The ……………. Operator is known as insertion operator. A) >> B) > C)
Last Answer : C)
Description : ……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal
Last Answer : D) Traversal
Description : Which type of biopsy is used for nonpalpable lesions found on mammography? a) Stereotactic Stereotactic biopsy utilizes computer location of the suspicious area found on biopsy, followed by core needle insertion ... core biopsy is used when a tumor is relatively large and close to the skin surface.
Last Answer : a) Stereotactic Stereotactic biopsy utilizes computer location of the suspicious area found on biopsy, followed by core needle insertion and sampling of tissue for pathologic examination.
Description : A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester. The salary of the architect is Rs.80,000 per month, the ... ) Rs.28,16,000 (2) Rs.20,90,000 (3) Rs.26,95,000 (4) Rs.27,50,000
Last Answer : (4) Rs.27,50,000
Description : Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT. Which of the following is not true ? I. The beam-penetration is used with random scan monitors. II. Shadow-mask is used ... -penetration method. (A) I and II (B) II and III (C) III only (D) IV only
Last Answer : (C) III only
Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search
Last Answer : (3) Heuristic Search
Description : To shuffle the list(say list1) what function do we use ? a) list1.shuffle () b) shuffle(list1) c) random.shuffle(list1) d) random.shuffleList(list1)
Last Answer : c) random.shuffle(list1)
Description : What is a short way of writing a word consisting of the letters in the word followed by a period?
Last Answer : Feel Free to Answer
Description : Every appointment of district forum shall be made by the state govt on the recommendation of a selection committee consisting of the following a) President of the state commission shall be a chairman ... incharge of dept dealing with consumer affair shall be a another member. d) All the above
Last Answer : d) All the above
Description : Mark correct option a) Sorting sub office are situated near the junction of several mail lines b) Nodal Post office is working in important cities some post office are authorized to receive letters from ... per sorting diagram. c) Central bagging unit is branch of RMS office . d) All the above
Description : Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?
Last Answer : Mergesort always makes recursive calls to sort subarrays that are about half size of the original array, resulting in O(n log n) time.
Description : What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system ... sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance
Last Answer : A. Higher system performance is gained
Description : For the purpose of such registration, every publication, consisting wholly or in great part of political or other news, or of articles relating thereto or to other current topics, with or without advertisements, ... it has a bona fide list of subscribers c) All of the above d) None of these
Last Answer : c) All of the above
Description : Suppose list Example is [‘h’,’e’,’l’,’l’,’o’], what is len(list Example)? a) 5 b) 4 c) None d) Error
Last Answer : a) 5
Description : What is the output when we execute list(“hello”)? a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’]. b) [‘hello’]. c) [‘llo’]. d) [‘olleh’].
Last Answer : a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’].
Description : The main task carried out in the …………… is to remove repeating attributes to separate tables. A) First Normal Form B) Second Normal Form C) Third Normal Form D) Fourth Normal Form
Last Answer : D) Fourth Normal Form
Description : The …………………………. Is a collection of protocols designed by Internet Engineering Task Force(IETF) to provide security for a packet at the Network level. A) IPsec B) Netsec C) Packetsec D) Protocolsec
Last Answer : A) IPsec
Description : The task of correcting and pre processing data is called as (A) Data streaming (B) Data cleaning (C) Data mining (D) Data storming
Last Answer : (B) Data cleaning
Description : To place a sound into a word document, following feature of windows is used: (A) Clip board (B) Task switching (C) C Win App (D) OLE
Last Answer : (D) OLE
Description : Consider the two class classification task that consists of the following points: Class C1: [1 1.5] [1 -1.5] Class C2: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: (A) x1+x2+1.5=0 (B) x1+x2-1.5=0 (C) x1+1.5=0 (D) x1-1.5=0
Last Answer : (C) x1+1.5=0
Description : Which command is used to concatenate all files beginning with the string 'emp' and followed by a non-numeric characters? A. cat emp[!0-9] B. more [emp][!0-9] C. cat emp[x-z]
Last Answer : A. cat emp[!0-9]
Description : ………………….. operator is basically a join followed by a project on the attributes of first relation. A) Join B) Semi-Join C) Full Join D) Inner Join
Last Answer : B) Semi-Join