BPSC TRE Exam Paper Solution

Option B

In this code, the expression (x | y) performs a bitwise OR on 10 and 5.
10 in binary : 1010
5 in binary :   0101
Bitwise OR : 1111 which is 15.
Next, (a + b) adds the Boolean values:
true : 1
false : 0
So, a + b = 1.
Finally, p = 15 + 1 = 16.

Option A

Given Boolean Expression:
=x(x+y)
=xx+xy
=x+xy
=x(1+y)
=x.1
=x

Option C

These operations are performed on a double-ended queue (deque) or a list that allows insertion and deletion at both front and rear.

• InsertFront(x) places x at the beginning.
• InsertRear(x) places x at the end.
• DeleteFront() removes the first element.
• DeleteRear() removes the last element.

Now apply the operations one by one and show the list after each step:

• InsertFront(10) : 10
• InsertFront(20) : 20 10
• InsertRear(30) : 20 10 30
• DeleteFront() : Removes 20 : 10 30
• InsertRear(40) : 10 30 40
• InsertRear(10) : 10 30 40 10
• DeleteRear() : Removes Last 10 : 10 30 40
• InsertRear(15) : 10 30 40 15
• Display() : Prints 10 30 40 15

So, the final list is 10 30 40 15.

Option B

A computer program that converts an assembly language program into its equivalent machine language is called an assembler.
Assembly language uses symbolic instructions like MOV, ADD, SUB etc. called mnemonics, which are easier for humans to understand but must be translated into binary machine code for the computer to execute.

• A compiler converts a high-level language into machine code.
• A linker combines multiple object files into a single executable.

Option B

A spanning tree is a subgraph of a connected graph that includes all the vertices but only enough edges to keep the graph connected without forming any cycles.

• The spanning tree does not have any cycle.
• A complete undirected graph can have maximum N^N-2 number of spanning trees, where N is the number of vertices.
• Spanning tree has N-1 edges, where N is the number of vertices.

Option A

In a circular queue implemented using an array, the queue is considered empty when there are no elements stored in it. The most common and standard way to represent an empty circular queue is if front=rear=-1.
When the circular queue is first created, it contains no elements. To show this, both front and rear are initialized to -1. As soon as we insert the first element both front and rear becomes 0. When all elements are deleted again, we reset them to -1 to show the queue is empty.

• When front=rear=0, means one element is present.
• When front=rear+1, this is the condition for circular queue full (no empty space available).

Option B

The X-NOR gate, produces a high (1) output when both inputs are the same, either both 0 or both 1.
Truth—Table:

Option D

A Divide and Conquer algorithm are a problem-solving technique where a big problem is broken into smaller ones, solved individually, and then combined to produce the final answer. This method is used in algorithms like Merge Sort, Quick Sort, and Binary Search. The Divide and Conquer approach follow three main steps:

• Divide: Break the original problem into smaller subproblems.
• Conquer: Solve each subproblem either directly if small enough or by applying recursion.
• Combine: Merge subproblem solutions to solve the original problem.

Option C

A doubly linked list is a linked list where each node contains three parts:

• Data.
• Pointer to the next node.
• Pointer to the previous node.

We can traverse in both the directions. This is true. Because each node has a prev pointer, we can move forward and backward.
It requires extra space. This is true. Every node stores an additional pointer (prev), so space required is more than a singly linked list.
Implementation of doubly linked list is easier than the singly linked list. This statement is not true. A doubly linked list is more difficult to implement because you must maintain both next and prev pointers during insertion and deletion. Singly linked list is simpler.

Option D

Digital electronics are devices that operate using binary signals. They process information in discrete steps rather than continuous signals.
Examples of digital electronic devices include computers, which use digital circuits for all processing tasks, mobile phones, which contain digital processors and memory and digital cameras, which convert images into digital data.