MH State Board All Notes Free5th to 12th & BA, BSc, B.Com 🔍

BSc Second Year (Sem 3 & 4) Computer Science – Daily Revision MCQ (English Medium)

📅 26 October 2026 · 10 questions · based on the Maharashtra university syllabus

This is the set for 26 October 2026. Solve today's MCQs →

Timed quiz: 15 seconds per question, the next one loads by itself when time runs out. Or solve without the timer: tap an option, right turns green, wrong turns red. New sets are added regularly.

  1. Using a stack, what is the value of the postfix expression 2 3 4 * + ?

    Chapter 3: Stacks and Queues

    Show answer

    Answer: B. 14
    Push 2, 3, 4; '*' pops 4 and 3 → 12; '+' pops 12 and 2 → 14.

  2. An inorder traversal of a binary search tree visits the keys in:

    Chapter 5: Trees

    Show answer

    Answer: A. Ascending (sorted) order
    Inorder visits left subtree, root, right subtree; in a BST left < root < right, so keys come out sorted ascending.

  3. The worst-case time complexity of binary search on a sorted array of n elements is:

    Chapter 8: Searching and Sorting

    Show answer

    Answer: C. O(log n)
    Each comparison halves the search range, so at most about log₂ n steps are needed.

  4. Breadth-first search (BFS) of a graph is normally implemented using a:

    Chapter 6: Graphs: Representation and Traversal

    Show answer

    Answer: B. Queue
    BFS visits vertices level by level, first-in first-out, so it uses a queue; DFS uses a stack (or recursion).

  5. Inserting a new node at the beginning of a singly linked list (given its head pointer) takes time:

    Chapter 4: Linked Lists

    Show answer

    Answer: A. O(1)
    Only two pointer changes are needed (new→next = head; head = new), independent of the list length.

  6. In C++, run-time polymorphism is achieved through:

    Chapter 12: Inheritance and Polymorphism

    Show answer

    Answer: C. Virtual functions
    A virtual function call through a base-class pointer or reference is resolved at run time (dynamic binding); overloading and templates are resolved at compile time.

  7. Which statement about a C++ constructor is correct?

    Chapter 11: Classes and Objects in C++

    Show answer

    Answer: A. It has the same name as its class and no return type
    A constructor is named after its class, has no return type, runs automatically when an object is created, and may be parameterised.

  8. In relational algebra, which operator chooses particular columns (attributes) of a relation?

    Chapter 16: Relational Model and Relational Algebra

    Show answer

    Answer: B. Projection (π)
    Projection π picks columns; selection σ picks rows that satisfy a condition.

  9. Which of these SQL commands is a DDL (Data Definition Language) command?

    Chapter 17: SQL Basics

    Show answer

    Answer: C. CREATE
    CREATE defines a database object such as a table; INSERT and UPDATE are DML, and SELECT queries data.

  10. In the ACID properties of a database transaction, 'A' stands for:

    Chapter 19: Transactions and Concurrency Control

    Show answer

    Answer: D. Atomicity
    Atomicity means a transaction is all-or-nothing: either every operation is done or none is.

📘 Notes for this subject📝 All subjects MCQ

BSc Second Year (Sem 3 & 4): MCQ in other subjects

PhysicsChemistryMathematicsBotanyZoologyMicrobiologyEnglish (Compulsory)

All questions are written by PadhaiNotes in our own words from the common syllabus of Maharashtra universities (NEP). Your own university's syllabus may differ a little.