Scribd
Upload
3 views

Array

The document is a test paper for a Level 200 Data Structure course, consisting of multiple-choice questions covering various topics such as binary search algorithms, data structures, arrays, and linked lists. It assesses students' understanding of concepts like linear and non-linear data structures, memory addresses, and the characteristics of different data types. The test is designed to evaluate knowledge on the properties and operations associated with data structures.

Uploaded by

mustaphaylw2
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Array

The document is a test paper for a Level 200 Data Structure course, consisting of multiple-choice questions covering various topics such as binary search algorithms, data structures, arrays, and linked lists. It assesses students' understanding of concepts like linear and non-linear data structures, memory addresses, and the characteristics of different data types. The test is designed to evaluate knowledge on the properties and operations associated with data structures.

Uploaded by

mustaphaylw2
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SCHOOL OF SEC. EDUC.

, SCIENCES PROGRAMME
LEVEL 200 FIRST SEMESTER TEST 2023/2024
CSC 213-DATA STRUCTURE
1. Which of the following is not the required condition for binary search algorithm?
a The list must be sorted, b. there should be direct access to the middle element in any sublist
 (c.) there must be mechanism to delete and/or insert elements in list d. none of these
2. Which of the following is not a limitation of binary search algorithm?
a. must use a sorted array
b. requirement of sorted array is expensive when a lot of insertion and deletions are needed
c. there must be a mechanism to access middle element directly
 (d.) binary search algorithm is not efficient when the data elements are more than 1000
3. Two dimensional arrays are also called
a tables arrays
b. matrix arrays
 (C). both of above d. none of these
4. A variable P is called a pointer if P:
a. contains the address of an element in DATA.
b points to the address of first element in DATA
 (c.) can store only memory addresses. d. contain the DATA and the address of DATA
5. Which of the following data structure can't store the non-homogeneous data elements?
 Arrays
b. Records c. Pointers d. None

6. Which of the following data structure store the homogeneous data elements?
 (a ).Arrays
b. Records c. Pointers d. None
7. Each data item in a record may be a group item composed of sub-items; those items which are
indecomposable are called
 (a.) elementary items b. atoms
c. Scalars
d. All of the above
8. The difference between linear array and a record is:
a. An array is suitable for homogeneous data but the data items in a record may have different data type
b. In a record. there may not be a natural ordering in opposed to linear array
c. A record form a hierarchical structure but a linear array does not
 (d.) All of the above
9. Which of the following statements is false?
 (a.) Arrays are dense lists and static data structure
b. data elements in linked list need not be stored in adjacent space in memory
c. pointers store the next data element of a list
d. linked lists are collection of the nodes that contain information part and next pointer
10. Binary search algorithm cannot be applied to
 (a.)sorted linked list b. sorted binary trees
c. Sorted linear array
d. pointer array.
SCHOOL OF SEC. EDUC., SCIENCES PROGRAMME
LEVEL 200 FIRST SEMESTER TEST 2023/2024
TIME: 20 MINS
CSC 213 - DATA STRUCTURE
1. Which of the following data structure is not linear?
a. Arrays
b. Linked lists
 c. Both of above
d. None of these
2. Which of the following data structure is linear?
a Trees
b. Graphs
 c. Arrays
d. None of these
3. The operation of processing each clement in the list is known as:
a. Sorting b. Merging c. Inserting

 d Traversal
4. Finding the location of the element with a given value is:
a. Traversal
 b. Search
c. Sort d. None of these
5. Arrays are best data structures for
 relatively permanent collections of data
b. the size and data of the structure are constantly changing
c. both of these situation
d. none of these situation
6. Linked lists are best suited for
a relatively permanent collections of data
 b. the size of the structure and the data in the structure are constantly changing
c. both of above situation
d. none of above situation
7. Each array declaration need not give, implicitly or explicitly, the information about
a. the name of array
b. the data type of array
 c. the first data from the set to be stored
d. the index set of the array
8. The elements of an array are stored successively in memory cells because
 a. by this way computer can keep track only the address of the first clement and the
addresses of other elements can be calculated
b. the architecture of computer memory does not allow arrays to store other than serially c. both of above
d. none of above
9. The memory address of the first clement of an array is called
a floor address b. foundation address c. first address
 d. abase address
10. Which of the following data structures are indexed structures?
 a linear arrays
b. linked lists c. both of above d. none of these

You might also like