presudo 1.0.0

package/pods/db/mongo_MCQ.txt

@@ -0,0 +1,216 @@
+Q1. Which of the following is NOT a type of NoSQL database?
+A) Document-oriented
+B) Key-Value
+C) Column-family
+D) Relational
+Answer: D
+Explanation: Relational is SQL/RDBMS; NoSQL types include document, key-value, column-family, and graph.
+Q2. Which statement about NoSQL databases is TRUE?
+A) They enforce strict schemas
+B) They are designed for horizontal scalability
+C) They do not support replication
+D) They cannot store semi-structured data
+Answer: B
+Explanation: NoSQL is typically schema-flexible and optimized for scale-out with replication/sharding.
+Q3. The CAP theorem states you can guarantee at most two of the following in a distributed system:
+A) Consistency, Availability, Partition Tolerance
+B) Consistency, Atomicity, Partition Tolerance
+C) Availability, Durability, Partition Tolerance
+D) Consistency, Isolation, Partition Tolerance
+Answer: A
+Explanation: CAP: only two of Consistency (C), Availability (A), Partition tolerance (P) can be guaranteed simultaneously.
+Q4. Which NoSQL type is optimal for social network relationships (friends, followers)?
+A) Key-Value
+B) Document
+C) Graph
+D) Column-family
+Answer: C
+Explanation: Graph DBs like Neo4j excel at relationship traversal (nodes/edges).
+Q5. A key advantage of NoSQL over SQL for certain workloads is:
+A) Strict joins across multiple tables
+B) Strong typing of columns
+C) Flexible schema and horizontal scaling
+D) Mandatory ACID across all operations
+Answer: C
+Explanation: NoSQL favors schema flexibility and distributed scaling; joins/ACID may be limited or optional.
+Q6. “Schema-less” generally means:
+A) There is no structure at all
+B) Structure can vary per record/document
+C) Structure is auto-generated by the database only
+D) Structure must be defined strictly before insertion
+Answer: B
+Explanation: Documents can have different sets of fields; validation can be optional or enforced via rules.
+Q7. Which workload fits a key-value store best?
+A) Ad-hoc analytics with complex joins
+B) Session storage and caching
+C) Hierarchical data with deep relationships
+D) Time-series with wide partitions
+Answer: B
+Explanation: Key-value stores (e.g., Redis) are ideal for cache/session due to fast lookup by key.
+Q8. Column-family databases (e.g., Cassandra) are best suited for:
+A) Graph traversals
+B) OLTP transactions with strict ACID
+C) High write throughput and large-scale time-series
+D) Document validation with nested JSON
+Answer: C
+Explanation: Column-family stores optimize for wide-row, high-volume writes and scale-out.
+Section B: MongoDB Basics & CRUD (9–15)
+Q9. MongoDB stores data internally as:
+A) JSON
+B) BSON
+C) CSV
+D) XML
+Answer: B
+Explanation: BSON (binary JSON) supports additional types (e.g., ObjectId, Date) and is efficient.
+Q10. Which command lists all databases in the Mongo shell?
+A) db.show()
+B) show databases
+C) list dbs
+D) show dbs
+Answer: D
+Explanation: show dbs prints database names and sizes.
+Q11. Insert multiple documents into a collection:
+A) db.users.insertMany([...])
+B) db.users.insertAll([...])
+C) db.users.add([...])
+D) db.users.bulkInsert([...])
+Answer: A
+Explanation: insertMany is the correct bulk insert API.
+Q12. Update multiple documents matching a filter:
+A) update()
+B) updateOne()
+C) updateMany()
+D) save()
+Answer: C
+Explanation: updateMany() applies updates to all matching documents.
+Q13. Upsert behavior means:
+A) Update only existing documents
+B) Insert only when the collection is empty
+C) Insert if no document matches the filter, otherwise update
+D) Always insert and ignore duplicates
+Answer: C
+Explanation: upsert: true creates a new document if none matches.
+Q14. Which operator adds an element to an array only if it doesn’t already exist?
+A) $push
+B) $addToSet
+C) $set
+D) $each
+Answer: B
+Explanation: $addToSet ensures uniqueness in array additions.
+Q15. The default _id field type in MongoDB is typically:
+A) UUID (string)
+B) Integer auto-increment
+C) ObjectId
+D) Binary blob without structure
+Answer: C
+Explanation: ObjectId is a 12-byte unique identifier used by default unless overridden.
+Section C: Querying, Indexes & Aggregation (16–22)
+Q16. Which command creates an ascending index on age?
+A) db.users.addIndex({ age: 1 })
+B) db.users.createIndex({ age: 1 })
+C) db.users.index({ age: 1 })
+D) db.users.ensureIndex({ age: 1 })
+Answer: B
+Explanation: createIndex is the correct method (modern API).
+Q17. Compound index ordering matters because:
+A) It only affects storage layout, not performance
+B) The prefix fields influence which queries can use the index
+C) MongoDB ignores the order entirely
+D) It’s only relevant for text indexes
+Answer: B
+Explanation: Index prefix rule: queries must include leading fields to fully leverage the compound index.
+Q18. Which operator checks for existence of a field?
+A) $match
+B) $exists
+C) $in
+D) $type
+Answer: B
+Explanation: $exists: true/false matches presence/absence of a field.
+Q19. Choose the correct aggregation pipeline stage to group by a field and compute counts:
+A) $project
+B) $group
+C) $sort
+D) $lookup
+Answer: B
+Explanation: $group aggregates documents by keys to compute accumulators ($sum, $avg, etc.).
+Q20. The difference between find() and aggregate() is:
+A) find() is only for insert; aggregate() is only for delete
+B) find() handles simple queries; aggregate() enables complex transformations
+C) Both are identical
+D) aggregate() is deprecated
+Answer: B
+Explanation: find() retrieves documents based on filter; aggregate() performs pipeline-based transformations.
+Q21. A text index in MongoDB enables:
+A) Geospatial queries
+B) Fast prefix-only match on numeric fields
+C) Full-text search across string content
+D) Automatic stemming for all fields by default
+Answer: C
+Explanation: Text indexes support language-aware search; must be created explicitly on string fields.
+Q22. To avoid scanning many documents for a sort, you should:
+A) Use $project
+B) Use $unwind
+C) Create a matching index on the sort fields
+D) Disable sorting
+Answer: C
+Explanation: Sorting is efficient when the query can use an index that matches the sort order.
+Section D: Replication, Transactions & Sharding (23–26)
+Q23. Replication in MongoDB provides:
+A) Horizontal partitioning of data
+B) High availability via multiple copies (primary/secondaries)
+C) Only performance improvements on writes
+D) Encryption at rest
+Answer: B
+Explanation: Replica sets maintain multiple copies; failover promotes a secondary to primary.
+Q24. Which consistency model is typical for reads from secondaries in MongoDB?
+A) Linearizable by default
+B) Strong always
+C) Eventual consistency
+D) No consistency guarantees
+Answer: C
+Explanation: Secondaries replicate asynchronously; reads may be eventually consistent unless configured otherwise.
+Q25. Sharding in MongoDB is:
+A) Replicating identical data across nodes
+B) Vertical scaling (more CPU/RAM)
+C) Splitting data across shards using a shard key
+D) Compressing documents for storage
+Answer: C
+Explanation: Sharding distributes data across multiple servers based on shard key ranges or hashed keys.
+Q26. Multi-document ACID transactions in MongoDB require:
+A) Standalone (no replica set needed)
+B) Replica set or sharded cluster, with appropriate session/transaction APIs
+C) Text index enabled
+D) MapReduce enabled
+Answer: B
+Explanation: Transactions are supported in replica sets and sharded clusters using session.startTransaction().
+Section E: Redis/Cassandra & Cross-Topic (27–28)
+Q27. Redis SETEX key seconds value does:
+A) Sets a key if it doesn’t exist
+B) Sets a key with expiry in seconds
+C) Returns TTL of a key
+D) Renames a key with expiry
+Answer: B
+Explanation: SETEX sets value and expiration atomically (common for caching/session).
+Q28. Cassandra partition keys are crucial because they:
+A) Control how data is sharded across the cluster
+B) Enable full ACID transactions across tables
+C) Determine index order only
+D) Are optional for writes
+Answer: A
+Explanation: Partition keys decide which node stores the data; modeling starts from query patterns and partition keys.
+Section F: Scenario-Based (29–30)
+Q29. You need to store product catalogs with flexible attributes (varying per product) and run filters by attributes. Best choice?
+A) Relational DB with strict schema
+B) Document DB like MongoDB
+C) Key-Value store like Redis
+D) Graph DB
+Answer: B
+Explanation: Flexible JSON documents and secondary indexes suit catalogs with variable attributes.
+Q30. You’re building real-time analytics on high-volume event streams (append-heavy, time-series). Which approach fits best?
+A) MongoDB capped collections or time-series collections; or column-family store like Cassandra
+B) Graph database only
+C) Pure key-value without TTL
+D) Text indexes everywhere
+Answer: A
+Explanation: MongoDB has time-series collections optimized for metrics;
+ Cassandra excels at high-throughput time-series writes.