This section contains carefully selected MCQs and Previous Year Questions with explanations to help students understand concepts and prepare effectively for examinations, interviews, and competitive tests.
Q: 1ORDBMS is an:
Option B
An ORDBMS (Object-Relational Database Management System) combines the features of relational databases with object-oriented concepts. It is called an extension of RDBMS because it is built on the relational model and adds object-oriented features to it.
Q: 2Advantages of a distributed database include:
Option D
A distributed database stores data across multiple locations but appears as a single database to users.
Q: 3Which among the following is a programming technique that allows developers to interact with Relational Database Management System (RDBMS) using objects in Object Oriented Programming (OOP)?
Option B
In software development, when using Object-Oriented Programming (OOP) with relational databases, there is a mismatch between objects (classes) and tables (relations).
To solve this, a technique called Object Relational Mapping (ORM) is used. ORM allows developers to interact with a database using objects instead of writing SQL queries directly.
ORM maps a class to a table, an object to a row, and attributes to columns, making database operations easier and more intuitive in Object-Oriented Programming languages.
Q: 4Which is not a type of NoSQL?
Option D
NoSQL (Not Only SQL) databases are non-relational databases designed to handle large volumes of unstructured or semi-structured data. They are categorized into different types based on their data models: document-based, key-value, column-family, and graph databases.
| NoSQL Database | Type | Description |
|---|---|---|
| MongoDB | Document-Oriented | Stores data in BSON (Binary JSON), flexible schema, widely used in web apps and analytics for its scalability and flexibility. |
| CouchDB | Document-Oriented | JSON-based documents, supports replication and offline storage. It is good for distributed applications. |
| HBase | Column-Family | Handles very large datasets across clusters, modeled after Bigtable, It is used in big data. |
| Redis | Key-Value | In-memory database, extremely fast and used for caching, session management, real-time analytics. |
| Cassandra | Column-Family | Highly scalable and fault-tolerant, ideal for big data and real-time applications. |
| Neo4j | Graph | Stores data as nodes and relationships, excellent for social networks, recommendations, and network analysis. |
| DynamoDB | Key-Value / Document | Fully managed by AWS (Amazon Web Services) scalable, low-latency access. It is supports both key-value and document models. |
Q: 5Which of the following is a characteristics of NoSQL databases?
Option D
NoSQL Databases are designed to handle large volumes of structured, semi-structured, and unstructured data.
Unlike relational databases, they do not enforce a fixed table schema. Instead, they allow a flexible or dynamic schema, meaning the structure of stored data can change without modifying the database design. This flexibility makes NoSQL databases suitable for Big Data applications and distributed systems.
Q: 6In which type of Database Management System is information distributed across different sites?
Option C
A Distributed Database Management System (DDBMS) stores and manages data at multiple physical locations called sites, but presents it to users as a single logical database. This improves data availability, reliability, and performance.
Q: 7Scalability in a database refers to the ability of a system to:
Option A
Scalability means the ability of a system to grow or shrink in capacity such as handling more users, more data, or higher workload without major redesign.
Q: 8In Object-Relational Data Models, which of the following is true about attributes of tuples?
Option C
In Object-Relational Data Models (ORDM), the traditional relational restriction that each attribute must be atomic is relaxed. Tuples can have attributes of complex types, such as nested relations, arrays, or objects. This allows the database to better model real-world entities and relationships while retaining relational principles.
Q: 9What are the maximum number of spanning trees (Tn) possible for a complete graph K5 on 5 vertices?
Option D
A spanning tree of a graph is a tree that connects all the vertices without forming any cycle.
For a complete graph Kn ,where every vertex is connected to every other vertex, the number of possible spanning trees is given by Cayley’s formula, Tn=nn−2.
Here, n = 5 so, T5=55−2 = 53 = 125.
You have reached the end of this topic. Continue learning with the next topic below.
Thank you so much for taking the time to read my Computer Science MCQs section carefully. Your support and interest mean a lot, and I truly appreciate you being part of this journey. Stay connected for more insights and updates! If you'd like to explore more tutorials and insights, check out my YouTube channel.
Don’t forget to subscribe and stay connected for future updates.
| Student Name | |
|---|---|
| College |
| What's Say |
|---|