PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free BSEB Inter Computer Science Practice Questions

Bihar School Examination Board (BSEB) Intermediate Computer Science (Addl.) (Class 12 / Intermediate Public Examination — Computer Science) practice questions are available now; exam metadata is being verified.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
100+ Questions
100% Free

Loading practice questions...

Same family resources

Explore More Bihar BSEB Intermediate Subjects

Continue into nearby exams from the same family. Each card keeps practice questions, study guides, flashcards, videos, and articles in one place.

Bihar BSEB Intermediate Accountancy

Practice Questions

Bihar BSEB Intermediate Agriculture

Practice Questions

Bihar BSEB Intermediate Bangla

Practice Questions

Bihar BSEB Intermediate Biology

Practice Questions

Bihar BSEB Intermediate Business Studies

Practice Questions

Bihar BSEB Intermediate Chemistry

Practice Questions
2026 Statistics

Key Facts: BSEB Inter Computer Science Exam

~3h 15m

Typical BSEB Intermediate Computer Science theory exam duration

BSEB Intermediate exam pattern (secondary + board logistics)

70 theory

Computer Science Addl. theory full marks (practical typically extra ~30)

BSEB Intermediate Computer Science model-paper style logistics

122/221/328

Illustrative model-paper style codes for I.Sc./I.Com./I.A. THEORY streams

BSEB Intermediate Computer Science (Addl.) model paper materials

English MCQ adaptation

This free local bank is not the official Intermediate paper format

OpenExamPrep practice policy

BSEB Intermediate Computer Science (Addl.) is a Class 12 public exam subject with a theory paper of about 3 hours 15 minutes (70 marks; model-paper style codes 122/221/328) plus practical assessment commonly described as about 70 theory + 30 practical out of 100, separate theory/practical pass requirements, and mixed objective–subjective items — not a pure MCQ board paper. This free 2026 bank is an English MCQ study adaptation for BSEB-aligned Class 12 Computer Science concepts.

Sample BSEB Inter Computer Science Practice Questions

Try these sample questions to test your BSEB Inter Computer Science exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1In a stack that follows LIFO discipline, which pair of operations is standard?
A.enqueue and dequeue
B.push and pop
C.insert and seek
D.open and close
Explanation: A stack is Last-In-First-Out. The primary operations are push (insert at top) and pop (remove from top).
2A stack currently holds elements bottom→top: A, B, C. After push(D) then pop(), the top is:
A.A
B.B
C.C
D.D
Explanation: push(D) makes top D; pop() removes D, so top returns to C.
3Which statement best describes a linear queue implemented with front and rear indices?
A.Elements leave from rear and enter at front
B.Elements enter at rear and leave from front
C.Both ends always insert only
D.Only one index is ever needed
Explanation: In a standard linear queue, enqueue inserts at the rear and dequeue removes from the front (FIFO).
4A queue is empty when which condition is typically true for the common front/rear convention with empty = front == −1?
A.front == rear and both are not −1 only
B.front == −1 (and rear == −1)
C.rear < front always
D.front == capacity
Explanation: A common textbook convention initializes empty queues with front = rear = −1; emptiness is recognized when front == −1.
5In a singly linked list, each node typically stores:
A.Only data, never a link
B.Data and a pointer/reference to the next node
C.Only two integer counters
D.A fixed array of 100 children
Explanation: A singly linked list node holds the data element and a next link to the successor node (or null at the end).
6To insert a new node at the beginning of a singly linked list, the essential steps are:
A.Only free the old head
B.Set new node’s next to current head, then update head to the new node
C.Always traverse to the last node first
D.Swap data of all nodes
Explanation: Head insertion: new.next = head; head = new. No full traversal is required.
7Which data structure is most natural for reversing the evaluation order of nested function calls / matching parentheses?
A.Queue
B.Stack
C.Circular linked list only
D.Hash table only
Explanation: Stacks naturally match last-opened constructs first (LIFO), which models nested calls and parentheses matching.
8A circular queue of capacity N (array size N) is full under the common modular condition when:
A.(rear + 1) % N == front
B.front == rear always means full
C.rear == 0 only
D.front > N always
Explanation: In a circular array queue, full is often detected when the next rear position wraps onto front: (rear + 1) % N == front (one slot may be left unused depending on scheme).
9Deleting the last node of a singly linked list of n nodes (n ≥ 2), given only the head, requires in the worst case:
A.O(1) time always without any scan
B.A traversal of O(n) to reach the second-last node
C.O(log n) binary search
D.O(n²) nested swaps only
Explanation: Without a tail pointer, you must walk to the second-last node to set its next to null — linear time.
10If you push 1, then 2, then 3 onto an empty stack and then pop twice, the remaining element is:
A.1
B.2
C.3
D.The stack is empty
Explanation: Order after pushes (bottom→top): 1,2,3. Two pops remove 3 then 2; 1 remains.

About the BSEB Inter Computer Science Practice Questions

Verified exam format metadata for Bihar School Examination Board (BSEB) Intermediate Computer Science (Addl.) (Class 12 / Intermediate Public Examination — Computer Science) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.