FREE Bachelor of Computer Engineering Data Structure Questions and Answers

Question 1

Which of the following best sums up an array?

Accepted Answer

Container of objects of similar types

Answer

An array is a fundamental data structure that stores a fixed-size sequential collection of elements of the same data type. All elements in an array are of the same type (e.g., all integers, all characters), and they are stored contiguously in memory, allowing for efficient access by index.

Question 2

How can an array be initialized in C?

Accepted Answer

int arr[3] = {1,2,3};

Answer

In C programming, an array is initialized by declaring its type and size, followed by an equals sign and a list of initial values enclosed in curly braces `{}`. The syntax `int arr[3] = {1,2,3};` correctly declares an integer array named `arr` of size 3 and initializes its elements to 1, 2, and 3, respectively.

Question 3

In Java, how do you create an array?

Accepted Answer

int arr[] = new int[3];

Answer

In Java, arrays are objects, so they must be created using the `new` keyword. The syntax `new int[3]` allocates memory for an array of 3 integers. The `int arr[]` part declares a variable `arr` that can hold an array of integers, and the assignment links it to the newly created array object.

Question 4

Which of the following notions uses arrays the most?

Accepted Answer

Spatial locality

Answer

Spatial locality refers to the tendency of a program to access data items that are physically close to each other in memory. Arrays store elements in contiguous memory locations, which naturally promotes spatial locality. When an element in an array is accessed, it's highly probable that nearby elements will be accessed soon, making arrays highly beneficial for caching and memory optimization based on spatial locality.

Question 5

The action of adding a stack member is known as .

Accepted Answer

Push

Answer

In a stack data structure, the operation of adding an element is known as 'push'. This operation places the new element at the top of the stack. Stacks follow a Last-In, First-Out (LIFO) principle, meaning the last element added is the first one to be removed.

B CompE Bachelor of Computer Engineering Practice Test

B CompE Bachelor of Computer Engineering Practice Test

FREE Bachelor of Computer Engineering Data Structure Questions and Answers