All Practice Exams

Free Practice Questions for BSEB Inter Computer Science

Exam-style questions and explanations by OpenExamPrep.

✓ No registration✓ No credit card
100+ Questions
100% Free

Loading practice questions...

Exam Review

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-focused Class 12 Computer Science concepts.

Sample BSEB Inter Computer Science Practice Questions

Try these sample questions to review concepts for the BSEB Inter Computer Science exam. 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 Exam

Bihar Intermediate Computer Science (Addl.) under BSEB covers Class 12 computing topics aligned to Board Intermediate syllabus themes: data structures (stack, queue, linked lists), object-oriented programming, Python/programming constructs (functions, modules, files, exceptions), Boolean algebra and logic gates, computer networks, databases and SQL basics, cyber safety, HTML/web fundamentals where prescribed, number systems, and elementary algorithm complexity. Official assessment combines a mixed objective–subjective theory paper (about 3 hours 15 minutes, 70 marks; model-paper style codes 122/221/328) with a practical examination that typically accompanies the subject. This free local bank provides English four-option MCQs for revision and reasoning practice; pair it with official model papers and laboratory work via biharboardonline.com.

Exam sponsor: Bihar School Examination Board (BSEB). The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Assessment

BSEB Intermediate Computer Science (Addl.) is assessed at Class 12 (Intermediate) under the Intermediate Public Examination for applicable streams (I.Sc., I.Com. & I.A. THEORY). Secondary sources and model-paper patterns describe a theory paper of about 3 hours 15 minutes worth 70 marks that mixes objective items (commonly described as a large Section A pool from which candidates answer about 35 one-mark objectives) with short and long subjective answers (e.g., answer about 10 × 2-mark and 3 × 5-mark items) — not a pure multiple-choice paper. A practical component typically accompanies Computer Science, with overall subject totals often described as about 70 theory + 30 practical out of 100 where practicals apply. Official materials are bilingual (Hindi/English). Exact section splits, practical marks, and model-paper codes (122/221/328 style) are set by BSEB for each academic year; always confirm the current model paper and circulars on biharboardonline.com. This practice bank is an English-language MCQ study adaptation for concept and programming fluency — it does not simulate the official mixed-format Intermediate paper or replace laboratory practicals.

Time Limit

About 3 hours 15 minutes (theory public examination; confirm year’s timetable)

Passing Score

Theory and practical cleared separately where practicals apply (commonly cited ~21/70 theory and ~12/30 practical); overall subject wording often near ~30% — verify the current BSEB Intermediate notification.

Exam / Certification Fees

As notified by BSEB and paid through Intermediate colleges/schools for regular and compartment/improvement sittings (no single fixed public subject fee for all categories).

Exam sponsor website

Fees, eligibility, and exam policies can change. Confirm them with the exam sponsor before applying or paying.

Our practice resources: topics covered

We aim to reflect publicly available exam outlines and topic information in our study resources. Coverage, format, and difficulty may differ from the actual exam, and we cannot guarantee that every detail is accurate or current. Confirm exam requirements, fees, and policies with the official exam sponsor.

~15% of this local bank

Data Structures

Stack LIFO push/pop, queue FIFO front/rear, circular queue full/empty ideas, linked-list nodes, and insert/delete reasoning.

~13% of this local bank

OOP Concepts

Class vs object, encapsulation, inheritance, polymorphism, constructors, and abstract-class ideas.

~20% of this local bank

Python & Programming

Functions, modules, lists/strings/dicts, file handling, exceptions, recursion, and common operators.

~12% of this local bank

Boolean Algebra & Logic Gates

Gates, Boolean laws, De Morgan, truth tables, simplification, and half-adder SUM/CARRY.

~12% of this local bank

Networking

LAN/WAN, star/bus/ring/mesh topologies, HTTP/TCP/UDP/DNS, routers/switches, and IPv4 basics.

~12% of this local bank

Databases & SQL

Primary/foreign/candidate keys, SELECT/INSERT/WHERE/ORDER BY/COUNT, and 1NF/2NF/3NF concepts.

~10% of this local bank

Cyber Safety, HTML, Numbers & Complexity

Passwords, phishing, malware, HTTPS, basic HTML tags, binary/hex conversions, and big-O comparison.

~6% of this local bank

Mixed Reasoning

Cross-topic items linking operations, SQL intent, and practical-style conceptual checks without replacing lab work.

Preparing for the BSEB Inter Computer Science Exam

What You Need to Know

  • Passing score: Theory and practical cleared separately where practicals apply (commonly cited ~21/70 theory and ~12/30 practical); overall subject wording often near ~30% — verify the current BSEB Intermediate notification.
  • Assessment: BSEB Intermediate Computer Science (Addl.) is assessed at Class 12 (Intermediate) under the Intermediate Public Examination for applicable streams (I.Sc., I.Com. & I.A. THEORY). Secondary sources and model-paper patterns describe a theory paper of about 3 hours 15 minutes worth 70 marks that mixes objective items (commonly described as a large Section A pool from which candidates answer about 35 one-mark objectives) with short and long subjective answers (e.g., answer about 10 × 2-mark and 3 × 5-mark items) — not a pure multiple-choice paper. A practical component typically accompanies Computer Science, with overall subject totals often described as about 70 theory + 30 practical out of 100 where practicals apply. Official materials are bilingual (Hindi/English). Exact section splits, practical marks, and model-paper codes (122/221/328 style) are set by BSEB for each academic year; always confirm the current model paper and circulars on biharboardonline.com. This practice bank is an English-language MCQ study adaptation for concept and programming fluency — it does not simulate the official mixed-format Intermediate paper or replace laboratory practicals.
  • Time limit: About 3 hours 15 minutes (theory public examination; confirm year’s timetable)
  • Exam / certification fees: As notified by BSEB and paid through Intermediate colleges/schools for regular and compartment/improvement sittings (no single fixed public subject fee for all categories). Official sources

Using Our Practice Resources

  • Work through all 100 available questions
  • Review every answer and explanation
  • Track weak areas and revisit them
  • Use our AI tutor for tough concepts

BSEB Inter Computer Science: Suggested Study Strategy

1Trace stack and queue contents on paper after every push/pop or enqueue/dequeue — the same dry runs win both MCQs and short answers.
2For OOP, always classify relationships as is-a (inheritance) vs has-a (composition) before choosing options.
3Practise Python file modes and try/except/finally with tiny programs; Intermediate CS rewards correct intent, not only syntax recall.
4Memorize De Morgan duals and half-adder SUM/CARRY; Boolean simplification questions often reuse the same identities.
5Read SQL stems for intent (SELECT filters vs INSERT vs UPDATE) and pair this MCQ bank with official bilingual model papers from biharboardonline.com.

Frequently Asked Questions

How is BSEB Intermediate Computer Science officially examined?

Computer Science (Addl.) is examined under the Bihar Intermediate Public Examination at Class 12 for applicable streams (I.Sc., I.Com., I.A.). Model-paper style materials (codes such as 122/221/328) describe a 70-mark theory paper of about 3 hours 15 minutes with mixed objective and subjective sections. A practical component typically accompanies Computer Science, often described overall as about 70 theory + 30 practical out of 100 where practicals apply, with separate pass requirements. Confirm the year’s model paper and circulars on biharboardonline.com.

Is this practice bank the same format as the official Intermediate Computer Science paper?

No. Official BSEB Intermediate Computer Science theory papers mix objective and subjective sections, are bilingual (Hindi/English), and include a practical component where applicable. This bank is an English-language multiple-choice study adaptation for concepts and reasoning only — not an official translation, blueprint replica, or practical/lab simulation.

What syllabus does this bank follow?

It is aligned to Bihar Intermediate (BSEB) Class 12 Computer Science (Addl.) themes: data structures, OOP, Python/programming constructs, Boolean algebra and logic gates, networking, databases/SQL, cyber safety, HTML/web basics where in syllabus, number systems, and elementary algorithm complexity.

What is the pass mark for BSEB Intermediate Computer Science?

Theory and practical are commonly required to be passed separately where practicals apply (often cited as about 21 marks out of 70 theory and 12 out of 30 practical). Overall subject wording is frequently described near a 30% floor. Always verify the current BSEB Intermediate notification for exact criteria.

Where should I check official model papers and circulars?

Use the Bihar School Examination Board website at biharboardonline.com for Intermediate model papers (including Computer Science Addl. codes such as 122/221/328 style materials), syllabi, practical instructions, and exam circulars.