WeCP DS Quiz – 1

Int is the data type used, prepinsta is the name of the array and [20] is the size of the array.

The answer is c, i.e., Spatial locality. Here, spatial locality means that the instruction accessed recently, then the nearby memory location would be accessed in the next iteration. As we know that in an array, all the elements are stored in a contiguous block of memory, so spatial locality is accessed quickly.

The first three options are the stack applications, but option d is not a stack application. The queue data structure is used for synchronization between the processes.

The answer is a, i.e., A+B*C because, in infix notation, all the operators appear between the operands.

The answer is c because stack follows LIFO, which means that the element inserted at the last will be removed first.

Reverse of the prefix expression: 1, 4, 8, /, 2, 3, *, -, +

The infix expression of the above prefix expression is:

(2*3) - (8/4) +1

6 -2 +1 = 5

The circular queue is also known as a ring buffer. In a circular queue, the last element is connected back to the first element of the queue that forms a circle. Therefore, the structure of a circular queue is also known as a ring structure.

The answer is a, i.e., 1234. The queue follows the FIFO principle in which the element inserted first will be removed first.

The answer is d. The options a, b, and c are the applications of the Queue data structure while option d, i.e., balancing of symbols is not the application of the Queue data structure. The option a, i.e., resource shared between various system is the application of the Queue data structure as it allows to align all the requests for the resource in a queue. The option b, i.e., data is transferred asynchronously is a application of the Queue data structure. Here asynchronously means that the data received at the different rate as sent.

The option c, i.e., load balancing is also an application of the Queue data structure because all the requests from the client are stored in the Queue, and it distributes the requests to the client one by one.

The option d, i.e., balancing of symbols is an application of the stack data structure.

The answer is b.

Let's dry run the above code.

When insertfront(10) is called, deque would be:

10

When insertfront(20) is called, the deque would be:

20 10

When insertrear(30) is called, the deque would be:

20 10 30

When insertrear(40) is called, the deque would be:

20 10 30 40

When deletefront() is called, the deque would be:

10 30 40

When insertfront(50) is called, the deque would be:

50 10 30 40

When deleterear() is called, the deque would be:

50 10 30