Bihar STET Computer Science: 40 Important MCQs (DBMS, Networking, C, Data Structures)
Practice 40 important Bihar STET Computer Science Paper 2 MCQs covering Data Structures, OOP, Operating Systems, Network Security and more, with answers to check your prep instantly.
This set of 40 important MCQs is built for candidates preparing for Bihar STET Computer Science (Paper II). The questions span a wide mix of topics that show up in the actual exam pattern, including Data Structures, Algorithms, OOP Concepts, Operating Systems, Software Engineering, Network Security, Digital Electronics, Artificial Intelligence, IoT, and general awareness areas like Bihar GK, Indian Constitution, and Awards and Honours.
Use this set as a quick self-check rather than a first-time learning resource. Attempt all 40 questions on your own first, then go through the answers to see which topics need more revision before you move on to full-length practice.
How to use these questions
- Attempt all 40 questions in one sitting before checking any answers, so you get an honest read on your current preparation.
- Time yourself loosely to build the habit of answering under exam-like pressure.
- After checking answers, list out the topics you got wrong — if Data Structures, OOP, or Networking keep tripping you up, revise those areas specifically.
- Once you've reviewed your mistakes, move to full-length mock tests to practice at actual exam scale rather than just topic-wise questions.
How can two polynomials represented as linked lists be added together efficiently?
- (A) By sorting nodes randomly and appending data fields
- (B) By merging lists and using dual pointers to compare exponents, adding coefficients when exponents match
- (C) By converting both lists into 2D matrices first
- (D) By deleting terms with odd coefficients
Answer: (B) By merging lists and using dual pointers to compare exponents, adding coefficients when exponents match
Explanation: Efficient addition merges the sorted lists using dual pointers, comparing exponents and adding coefficients when they match.
What is the primary role of a Load Shedding mechanism in heavy IIoT data streaming pipelines?
- (A) Throwing away old physical computer monitors
- (B) Dropping low-priority telemetry packets selectively during peak network congestion or system overload to protect core control stability
- (C) Turning off building lights at night
- (D) Disconnecting all cables manually
Answer: (B) Dropping low-priority telemetry packets selectively during peak network congestion or system overload to protect core control stability
Explanation: Load shedding drops low-priority data during overload to protect critical control functions and stability.
Which collision resolution technique involves placing collided elements in the next available empty slot in the hash table?
- (A) Linear probing
- (B) Quadratic probing
- (C) Separate chaining
- (D) Double hashing
Answer: (A) Linear probing
Explanation: Linear probing searches sequentially for the next open slot in the hash table to place a collided element.
How are pointer indices updated in a Circular Queue of size N during Enqueue and Dequeue operations?
- (A) rear = (rear + 1) % N and front = (front + 1) % N
- (B) rear = rear + 1 and front = front - 1
- (C) rear = (rear × 2) % N
- (D) front = (front + rear) / 2
Answer: (A) rear = (rear + 1) % N and front = (front + 1) % N
Explanation: Circular queues wrap pointers using modulo arithmetic: rear=(rear+1)%N and front=(front+1)%N.
Reversing a string using a stack takes what time and space complexity?
- (A) O(n) Time and O(n) Auxiliary Space
- (B) O(n²) Time and O(1) Space
- (C) O(1) Time and O(n) Space
- (D) O(log n) Time and O(n) Space
Answer: (A) O(n) Time and O(n) Auxiliary Space
Explanation: Each character is pushed and popped once (O(n) time) and stored in an auxiliary stack (O(n) space).
In pointer implementation of linked lists, which operation can be performed in constant time (O(1)) when inserting or deleting nodes?
- (A) Inserting at the beginning
- (B) Inserting at the end
- (C) Inserting at a specific position
- (D) Deleting a specific node
Answer: (A) Inserting at the beginning
Explanation: Inserting at the beginning only requires updating the head pointer, taking constant O(1) time.
Separate chaining involves storing collided elements in separate data structures, typically in:
- (A) Linked Lists
- (B) Arrays
- (C) Stacks
- (D) Queues
Answer: (A) Linked Lists
Explanation: In separate chaining, colliding elements are stored in a linked list attached to each hash bucket.
What evaluation result is obtained for the Postfix expression: 5 3 2 * + 4 -?
- (A) 12
- (B) 7
- (C) 11
- (D) 15
Answer: (B) 7
Explanation: 3*2=6, 5+6=11, 11-4=7, giving the final postfix evaluation result.
How many null pointers exist in a standard Binary Search Tree containing n nodes?
- (A) n null pointers
- (B) n + 1 null pointers
- (C) 2n null pointers
- (D) n - 1 null pointers
Answer: (B) n + 1 null pointers
Explanation: A binary tree with n nodes has exactly n+1 null (empty) child pointers, a well-known structural property.
What balance factor condition must every node satisfy in a valid AVL Tree?
- (A) Balance Factor ∈ {-1, 0, +1}
- (B) Balance Factor ∈ {-2, 0, +2}
- (C) Balance Factor strictly equals 0
- (D) Balance Factor > +2
Answer: (A) Balance Factor ∈ {-1, 0, +1}
Explanation: AVL trees require every node's balance factor to stay within -1, 0, or +1.
How do you reverse a Singly Linked List in-place using iterative pointers?
- (A) Using three pointers (prev, curr, next) to flip direction pointers in O(n) time
- (B) Swapping data values across all pairs of nodes using two nested loops in O(n²) time
- (C) Converting nodes into an array and reading backwards
- (D) Re-allocating new memory blocks for every node
Answer: (A) Using three pointers (prev, curr, next) to flip direction pointers in O(n) time
Explanation: Using three pointers (prev, curr, next), each node's link is reversed one at a time in O(n) time without extra memory.
What is the time complexity to find the middle node of a linked list in a single pass?
- (A) O(n²)
- (B) O(n) time using Fast and Slow pointer approach
- (C) O(log n)
- (D) O(1)
Answer: (B) O(n) time using Fast and Slow pointer approach
Explanation: The fast and slow pointer (tortoise and hare) approach finds the middle node in a single O(n) pass.
What occurs when an Enqueue operation is called on a standard queue implemented via a fixed-size array when rear == MAX - 1 and front == 0?
- (A) Underflow
- (B) Overflow
- (C) Allocation Warning
- (D) Data Corruption
Answer: (B) Overflow
Explanation: With rear at the last index and front at 0, the array is completely full, causing Overflow.
In a B-tree of order m, each internal node can have up to ___ children.
- (A) m - 1
- (B) m
- (C) 2m - 1
- (D) 2m
Answer: (B) m
Explanation: By definition, a B-tree of order m allows each internal node to have at most m children.
............. data type is used to implement Queue data structure in Python.
- (A) Sets
- (B) Dictionary
- (C) Tuple
- (D) List
Answer: (D) List
Explanation: Python's List data type supports append and pop operations used to implement a Queue.
What is the worst-case time complexity to delete a node at a given pointer position in a Singly Linked List (if predecessor pointer is NOT provided)?
- (A) O(1) by copying next node data and deleting next node
- (B) O(n) because traversing from head is required to locate predecessor node
- (C) O(log n)
- (D) O(n²)
Answer: (B) O(n) because traversing from head is required to locate predecessor node
Explanation: Without a predecessor pointer, the list must be traversed from the head to locate the node before the target, taking O(n).
Convert the Infix expression (A + B) * C into its correct Prefix format.
- (A) +AB*C
- (B) *+ABC
- (C) AB+C*
- (D) *A+BC
Answer: (B) *+ABC
Explanation: Prefix form places operators before operands: *+ABC evaluates (A+B)*C correctly.
In Python, ........... module needs to be imported for implementing Double Ended Queue.
- (A) counter
- (B) collections
- (C) random
- (D) numpy
Answer: (B) collections
Explanation: Python's deque, used for a double-ended queue, is provided by the collections module.
What is the equivalent Postfix expression for: A + B * C - D?
- (A) A B C * + D -
- (B) A B + C * D -
- (C) A B C + * D -
- (D) + * A B C - D
Answer: (A) A B C * + D -
Explanation: Applying operator precedence (* before +,-) converts A + B*C - D to A B C * + D -.
A system call is:
- (A) An ordinary function call with no mode change
- (B) A page-replacement algorithm
- (C) Used only by device firmware
- (D) The controlled entry point from user mode into kernel services
Answer: (D) The controlled entry point from user mode into kernel services
Explanation: A system call is the controlled interface allowing user programs to request kernel services with a mode switch.
What is the main goal of software quality assurance?
- (A) To eliminate all defects from the software
- (B) To ensure the software is defect-free before release
- (C) To establish and enforce standards and processes to improve software quality
- (D) To test software under different conditions
Answer: (C) To establish and enforce standards and processes to improve software quality
Explanation: SQA focuses on establishing and enforcing standards and processes to improve overall software quality.
Rearranging schemas, linking them with other schemas to create a strongly interconnected cognitive system in Piaget's theory is referred to as:
- (A) Assimilation
- (B) Accommodation
- (C) Organization
- (D) Maturation
Answer: (C) Organization
Explanation: Organization in Piaget's theory refers to linking schemas into a strongly interconnected cognitive system.
The highest jute-producing district of Bihar is (a) Siwan (b) Gaya (c) Vaishali (d) Purnia
- (A) Siwan
- (B) Gaya
- (C) Vaishali
- (D) Purnia
Answer: (D) Purnia
Explanation: Purnia, in the Kosi-Seemanchal belt, is traditionally the largest jute-producing district of Bihar.
What is MISO pin in the RFID Module?
- (A) Master In Slave Out
- (B) Manage Internal Slave Output
- (C) Master Internal Search Optimization
- (D) Manage Input Slave Op
Answer: (A) Master In Slave Out
Explanation: MISO stands for Master In Slave Out, an SPI communication pin used in RFID modules.
What is the overall time complexity of running BFS or DFS on a graph represented using an Adjacency List with |V| vertices and |E| edges?
- (A) O(|V| × |E|)
- (B) O(|V|²)
- (C) O(|V| + |E|)
- (D) O(|E| log |V|)
Answer: (C) O(|V| + |E|)
Explanation: Each vertex and edge is processed once in adjacency-list BFS/DFS, giving O(|V| + |E|) time.
The complement of a^nb^n over {a,b} is:
- (A) Never context-free
- (B) Context-free (it is actually a regular union a CFL), even though a^nb^n itself is CFL and CFL is not closed under complement in general
- (C) Not RE
- (D) Equal to a^nb^nc^n
Answer: (B) Context-free (it is actually a regular union a CFL), even though a^nb^n itself is CFL and CFL is not closed under complement in general
Explanation: The complement of a^nb^n is itself context-free even though CFLs are not closed under complement in general.
What does a first-order predicate logic contain?
- (A) Predicate and a subject
- (B) Predicate and a preposition
- (C) Subject and an object
- (D) None of the above
Answer: (A) Predicate and a subject
Explanation: First-order predicate logic statements are composed of a subject and a predicate describing it.
What is a common effect of inflation on purchasing power?
- (A) Increase in purchasing power
- (B) Decrease in purchasing power
- (C) No effect on purchasing power
- (D) Increase in savings
Answer: (B) Decrease in purchasing power
Explanation: Inflation reduces the value of money, so purchasing power decreases as prices rise.
Looping a lossy-compressed clip many generations (export, upload, re-encode) causes:
- (A) Perfect restoration of the RAW
- (B) A change of aspect to 4:3 automatically
- (C) A new storyboard
- (D) Generation loss -- each encode adds artifacts (mosquito noise, wobble, mushy audio)
Answer: (D) Generation loss -- each encode adds artifacts (mosquito noise, wobble, mushy audio)
Explanation: Repeated lossy re-encoding accumulates generation loss, adding artifacts like mosquito noise and audio degradation.
Upcasting is:
- (A) Forcing a base object to become derived without a check (may fail)
- (B) Treating a derived object as its base type (always safe in a sound hierarchy)
- (C) Deleting a class
- (D) Inlining a constructor
Answer: (B) Treating a derived object as its base type (always safe in a sound hierarchy)
Explanation: Upcasting treats a derived object as its base type, which is always safe in a proper class hierarchy.
Current psychological theories of emotion conceptualise the relation between cognitive and emotional processes as-
- (A) independent of each other
- (B) interwinded with each other
- (C) only emotions influence cognition
- (D) only cognition influences emotion
Answer: (B) interwinded with each other
Explanation: Modern theories view cognition and emotion as deeply intertwined, influencing each other continuously.
If x/√128 = √162/x, find the value of x. (equation partly garbled in source — please double-check against original)
- (A) 12
- (B) 144
- (C) 14
- (D) 196
Answer: (A) 12
Explanation: Cross-multiplying gives x² = √128×√162 = √20736 = 144, so x = 12.
Which UML diagram emphasizes the time-ordered sequence of messages passed between interacting objects in a system?
- (A) Class Diagram
- (B) Use Case Diagram
- (C) Sequence Diagram
- (D) Deployment Diagram
Answer: (C) Sequence Diagram
Explanation: A Sequence Diagram shows objects and the time-ordered messages exchanged between them.
In which year Ravish Kumar was awarded the Ganesh Shankar Vidyarthi Award for the Hindi magazine 'Raag'?
- (A) 2009
- (B) 2010
- (C) 2011
- (D) 2012
Answer: (B) 2010
Explanation: Ravish Kumar received the Ganesh Shankar Vidyarthi Award for 'Raag' magazine in 2010.
As per the Cabinet Resolution of 1st January 2015, the NITI Aayog consists of: 1. Prime Minister of India 2. Governing Council comprising of Chief Ministers of all the States and Lieutenant Governors of Union Territories 3. Rural Development Minister 4. Chief Executive Officer to be appointed by the Prime Minister. Select the correct answer from the given options:
- (A) 1, 2 and 3
- (B) 1, 2 and 4
- (C) 1 and 2 only
- (D) 3 and 4 only
Answer: (B) 1, 2 and 4
Explanation: NITI Aayog comprises the PM, Governing Council and a CEO appointed by the PM; Rural Development Minister is not a defined member.
Which condition causes a flip-flop's output to enter an unpredictable intermediate voltage state if setup or hold timing is violated?
- (A) Ground Bounce
- (B) Thermal Runaway
- (C) Quantization Noise
- (D) Metastability
Answer: (D) Metastability
Explanation: Metastability occurs when setup/hold violations cause the flip-flop output to settle unpredictably.
Which of the following attributes is not a valid attribute of the tag in HTML?
- (A) face
- (B) type
- (C) size
- (D) colour
Answer: (B) type
Explanation: 'Type' is not a valid attribute for this tag while face, size and colour are valid.
What does the acronym "HTTP" stand for?
- (A) Hyper Text Transmission Protocol
- (B) HyperText Transfer Protocol
- (C) High-Tech Text Protocol
- (D) HyperTransfer Text Protocol
Answer: (B) HyperText Transfer Protocol
Explanation: HTTP officially stands for HyperText Transfer Protocol, the protocol used for transferring web pages.
Dynamic binding requires:
- (A) A static method
- (B) A private final method in Java that is static
- (C) A virtual/overridable method and a call through a base-typed reference/pointer to a derived object
- (D) Compile-time constants only
Answer: (C) A virtual/overridable method and a call through a base-typed reference/pointer to a derived object
Explanation: Dynamic binding needs a virtual/overridable method invoked through a base-typed reference or pointer to a derived object.
Security authentication is primarily about:
- (A) Verifying the identity of a user or process (passwords, keys, biometrics, tickets)
- (B) Compiling C programs
- (C) Choosing a page size
- (D) FCFS vs SJF
Answer: (A) Verifying the identity of a user or process (passwords, keys, biometrics, tickets)
Explanation: Authentication is the process of verifying the claimed identity of a user or process using credentials.
Take a full mock test
Start with the free mock test: Full Mock Test 12 — timed, with your score and analysis right away.
These questions come from SeatBeat's reviewed question bank. For full preparation, see the test series: Bihar STET Computer Science Paper 2 Mock Test Series 2026
Frequently asked questions
Which topics does this Bihar STET Computer Science questions set cover?
This set of 40 MCQs covers Data Structures, Algorithms, OOP Concepts, Operating Systems, Software Engineering, Software Design, Digital Electronics, Digital Video, Network Security, Artificial Intelligence, Internet of Things (IoT), Numbers, HTML, along with general topics like Bihar GK, Indian Constitution, Developmental Theories, Emotion, Inflation, and Awards and Honours.
Is this enough practice for Bihar STET Computer Science Paper 2?
This set is useful for a quick topic-wise self-check, but it isn't a substitute for full-length practice. For complete coverage, SeatBeat's Bihar STET Computer Science Paper 2 Mock Test Series 2026 offers 12 full tests with 1800 questions.
Is there a free test I can try before buying the full series?
Yes, Full Mock Test 12 from the Bihar STET Computer Science Paper 2 Mock Test Series 2026 is available free, so you can try the format before deciding on the full series.
How much does the full Bihar STET Computer Science Paper 2 Mock Test Series cost?
The Bihar STET Computer Science Paper 2 Mock Test Series 2026, with 12 full tests and 1800 questions, is priced at ₹49.
Should I attempt these 40 MCQs with a timer?
Yes, attempting them under a rough time limit helps simulate exam conditions. Answer all 40 first, then check your answers and note the topics that need more revision.