# Algorithms-Searching (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 1 - 7 of 9

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

## Question number: 1

» Algorithms » Searching

MCQ▾

### Question

The goal of hashing is to produce a search that takes

### Choices

Choice (4) Response

a.

time

b.

0 (1) time

c.

0 (logn)

d.

None of the above

## Question number: 2

» Algorithms » Searching

MCQ▾

### Question

In external searching table is kept which storage memory

### Choices

Choice (4) Response

a.

memory

b.

Main memory

c.

Auxiliary storage

d.

Question does not provide sufficient data or is vague

## Question number: 3

» Algorithms » Searching

MCQ▾

### Question

Searching is divided how many categories

### Choices

Choice (4) Response

a.

Three

b.

Two

c.

Four

d.

All of the above

## Question number: 4

» Algorithms » Searching

MCQ▾

### Question

Fold the key 987654321 into a hash table of ten spaces (0 through 10).

### Choices

Choice (4) Response

a.

3

b.

4

c.

8

d.

None of the above

## Question number: 5

» Algorithms » Searching

MCQ▾

### Question

A hash function f defined as f (key) =key mod 7 with linear probing, insert the key 37,38,72,48,98,11,56 into a table indexed from 11 will be stored in the location-

### Choices

Choice (4) Response

a.

5

b.

3

c.

6

d.

9

## Question number: 6

» Algorithms » Searching

MCQ▾

### Question

Sequential searching is a also known as

### Choices

Choice (4) Response

a.

External searching

b.

searching

c.

Linear search

d.

Question does not provide sufficient data or is vague

## Question number: 7

» Algorithms » Searching

MCQ▾

### Question

When deleting an element is possible only at one end but operation of deletion is possible at both end of queues is a called-

### Choices

Choice (4) Response

a.

dequeues

b.

Input restricted dequeues

c.

Output restricted dequeues

d.

None of the above

f Page