English

CUET (UG) entrance exam Question Bank Solutions

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics

Please select a subject first

Advertisements
Advertisements
< prev  2241 to 2260 of 8128  next > 

One limitation of antivirus programs is that they :

[11] Security Aspects
Chapter: [11] Security Aspects
Concept: undefined >> undefined

Which of the following device is connected to both the source and destination computer?   

[16] Introduction to Computer Networks
Chapter: [16] Introduction to Computer Networks
Concept: undefined >> undefined

Advertisements

A ______ is a software program that is designed to copy itself from one computer to another, without human intervention.

[16] Introduction to Computer Networks
Chapter: [16] Introduction to Computer Networks
Concept: undefined >> undefined

Which one of the following is a type of antivirus program? 

[11] Security Aspects
Chapter: [11] Security Aspects
Concept: undefined >> undefined

The biggest advantage of selection sort is:

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

______ is an algorithm that requires minimum number of swaps.

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

How many for loops does selection sort use?

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

In which of the following scenarios will you use a selection sort?

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

Bubble sort and selection sort are in place sorting algorithm. This means that:

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

In a sorting algorithm, the smallest element is selected from the unsorted array and swapped with the leftmost element and not considered for further passes. The process continues for the next element in the unsorted array till the list is sorted. Which algorithm are we referring to?

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

Binary search makes use of ______.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

When we say that in binary search with every pass the search area is reduced by half means ______.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

Determine the number of comparisons required in list [-4, 0, 2,7, 8, 17, 19] to search for - 4.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

How many swaps does selection sort perform in worst case?

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

A modified binary search is used when one is ______.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

How many swaps required to swap [60, 41, 20, 7] using selection sort?

[5] Sorting
Chapter: [5] Sorting
Concept: undefined >> undefined

What is true for binary search comparisons?

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

For 9 elements in a list, binary search will start from element at ______.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

Element in an unordered list cannot be searched using ______.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined

Binary search can be performed only on ordered lists.

[4] Searching
Chapter: [4] Searching
Concept: undefined >> undefined
< prev  2241 to 2260 of 8128  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×