Scribd
Upload
34 views

Dso (Cse)

This document appears to be a multiple choice exam for a Data Structures course covering topics like algorithms, data structures, queues, hashing, and sorting. It contains 20 multiple choice questions testing knowledge of concepts like: 1) Merge sort is an algorithm that uses the divide, conquer, and combine paradigm. 2) In a queue, insertion is done at the rear and deletion is done using the dequeue function. 3) A hash table is a data structure that uses a hash function to map keys to values. 4) A queue is a First In First Out (FIFO) data structure used to model real world queues.

Uploaded by

AARLA NITHYAPOOJAIAH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views

Dso (Cse)

This document appears to be a multiple choice exam for a Data Structures course covering topics like algorithms, data structures, queues, hashing, and sorting. It contains 20 multiple choice questions testing knowledge of concepts like: 1) Merge sort is an algorithm that uses the divide, conquer, and combine paradigm. 2) In a queue, insertion is done at the rear and deletion is done using the dequeue function. 3) A hash table is a data structure that uses a hash function to map keys to values. 4) A queue is a First In First Out (FIFO) data structure used to model real world queues.

Uploaded by

AARLA NITHYAPOOJAIAH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

JNT UNIVERSITY ANATHAPUR, ANANTHAPURAMU-515002

KLM COLLEGE OF ENGINEERING FOR WOMEN, KADAPA


I BTECH II Semester II Midterm Examination, May,2017
Subject: Data structures Max. Marks: 10
Branch: C.S.E
Date: 10.05.2017 Roll No. :
Session: FN(10:30-12:30)
Time: 20 Min Marks Awarded:
Signature of Invigilator:
CHOOSE THE CORRECT ANSWERS:
1) ____algorithm uses the divide, conquer, and combine algorithmic paradigm? [ ]
a) Selection Sort b) Insertion sort c) Merge sort d) Radix sort
2) In a queue, insertion is done at____ [ ]
a) Rear b) Front c) Back d) Top
3) The function that deletes values from a queue is called _________ [ ]
a) Enqueue b) Dequeue c) pop d) peek
4) A hash function is a ___________ [ ]
a) Mathematical formula b) value c) variable d) none
5) Hash table is a __________ [ ]
a) Data structure b) value c) variable d) none
6) The hash table contains _________types of values [ ]
a) Two b) three c) four d) six
7) The process of examining memory locations in the hash table is called _____ [ ]
a) Probing b) hashing c) variable d) allocation
8) _______means to find whether a particular value is present in an array or not [ ]
a) Searching b) sorting c) hashing d) none
9) _________means arranging the elements of an array so that they are placed in some relevant order which may be either
ascending or descending [ ]
a) Searching b) sorting c) hashing d) none
10) A queue is a __________ [ ]
a) FIFO b) LIFO c) MIFO d) none
11) FIFO is termed as __________ [ ]
a) First-in-First-out b) Fall-in-Fall-out c) Fast-in-Fast-out d) none
12) The collection of all records is called a __________ [ ]
a) Table b) column c) row d) none
13) A search will be termed successful in the ______ is found [ ]
a) Key b) column c) row d) table
14) Queue is empty _________ [ ]
a) FRONT=0 REAR=1 b) FRONT=0 REAR=0 c) FRONT=0 d) REAR=0
15) Queue is full __________ [ ]
a) REAR=N FRONT=1 b) FRONT=0 REAR=0 c) FRONT=0 d) REAR=0
16) Queue insertion called________ [ ]
a) ENQUEUE b) DEQUEUE c) NULL d) FULL
17) Queue deletion called_____________ [ ]
a) ENQUEUE b) DEQUEUE c) NULL d) FULL
18) Circular Queue is empty ___________ [ ]
a) FRONT=0 REAR=0 b) FRONT=1 REAR=1 c) ) FRONT=N d) REAR=N
19) String of characters are arranged in the same order as in dictionary is called___ [ ]
a) Lexicographic order b) Descending order c) Ascending order d) Null
20) ____ between two data storages implies the interchange of their contents [ ]
a) Swap b) Random order c) stable sort d) none

You might also like