Final MCQ DT

Seat No -
Total number of questions : 60
1000218_T1 DATABASE TECHNOLOGIES

Time : 1hr
Max Marks : 50
N.B
1) All questions are Multiple Choice Questions having single correct option.
2) Attempt any 50 questions out of 60.
3) Use of calculator is allowed.
4) Each question carries 1 Mark.
5) Specially abled students are allowed 20 minutes extra for examination.
6) Do not use pencils to darken answer.
7) Use only black/blue ball point pen to darken the appropriate circle.
8) No change will be allowed once the answer is marked on OMR Sheet.
9) Rough work shall not be done on OMR sheet or on question paper.
10) Darken ONLY ONE CIRCLE for each answer.
Q.no 1. Using _______ is more useful than a single application talking to multiple
databases
A : Services
B : Functions
C : Commands
D : Procedures
Q.no 2. The number of replicas is often called the _______
A : quorum
B : replication factor
C : read quorum
D : write quorum
Q.no 3. It is essential to test expectations about programmer productivity and/or
performance before committing to using a ___________
A : NOSQL technology
B : object oriented technology
C : relational technology
D : procedure oriented technology
Q.no 4. When is it best to use a NoSQL database?
A : When providing confidentiality, integrity, and availability is crucial
B : When the data is predictable
C : When dealing with large data sets.
D : When high level of consistency is needed.
Q.no 5. While using key-value stores, lots of thought has to be given to the design
of the __________
A : Key
B : Value
C : Table
D : Structure
Q.no 6. Polyglot persistence can apply across ______
A : an enterprise
B : within a single application
C : Both
D : None
Q.no 7. Which database need careful migration due to the implicit schema in any
code that accesses the data
A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
Q.no 8. Document database is most suitable for
A : Storing Session Information
B : User Profiles, Preferences
C : Content Management Systems
D : Shopping Cart Data
Q.no 9. Which is not column family stores?
A : Hbase
B : Cassandra
C : CouchDB
D : Amazon SimpleDB
Q.no 10. ___________________ is an aggregate ignorant data model
A : Document Database
B : Key Value Database
C : Relational Database
D : Column Database
Q.no 11. NoSQL databases are most often referred to as:
A : Relational
B : Distributed
C : Object-oriented
D : Network
Q.no 12. The first stage of map-reduce is
A : Reduce
B : Read
C : Scan
D : Map
Q.no 13. ______ is not the property in CAP theorem
A : Partition tolerance
B : Accessibility
C : Consistency
D : Availability
Q.no 14. XML databases can also be called as _____
A : Graph Database
B : Document database
C : RDBMS
D : Key oriented
Q.no 15. _____ conflicts occur when two clients try to write the same data at the
same time
A : read-read
B : read-write
C : write-read
D : write-write
Q.no 16. Schemaless databases can use the same migration techniques as
databases with _______ schemas
A : conceptual schema
B : strong schema
C : physical schema
D : logical schema
Q.no 17. Replication comes with an inevitable dark side _______
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
Q.no 18. To provide high availability and data consistency, in a production

sharded cluster, each shard is a ___________
A : replica set
B : cluster
C : partition
D : set
Q.no 19. For which of the following problem spaces key-value stores are not the
best solution
A : Shopping Cart Data
B : Storing Session Information
C : Relationships among Data
D : User Profiles
Q.no 20. _____ don’t advertise any internal structure, so they are more like key-
value stores with a hierarchic key.
A : Files
B : RDBMS
C : Applications
D : Functions
Q.no 21. A ____ is a function whose input is a single aggregate and whose output is
a bunch of key-value pairs
A : Reduce
B : Map
C : Task
D : Framework
Q.no 22. Key-Value database is useful for

A : Content Management Systems
B : E-Commerce Applications
C : Query by Data
D : Storing Session Information
Q.no 23. ___________ databases make traversal along the relationships very cheap
A : Relational
B : Graph
C : Key Value
D : Document
Q.no 24. What it is an aggregate model?
A : Model takes the information that we want to store and divides it into tuples
B : Collection of related objects that we wish to treat as a unit
C : It captures set of values
D : Model that takes tuple as input and returns tuple as output
Q.no 25. Which of the following is not a primary classification for NoSQL
architectures?
A : Key / Value based
B : Column based
C : Table based
D : Graph based
Q.no 26. A vector stamp is
A : Set of stamps
B : Set of Counters
C : Set of nodes
D : Set of systems
Q.no 27. NoSQL supports ____________.

A : Horizontal scaling, complex design, fine controlled availability
B : Horizontal scaling, simple design, fine controlled availability
C : Vertical scaling, simple design, fine controlled availability
D : Vertical scaling, simple design, low control availability
Q.no 28. NoSQL databases is used mainly for handling large volumes of
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
Q.no 29. In Neo4j which building block consists of meta-data and attributes
A : Nodes
B : Properties
C : Relationship
D : Labels
Q.no 30. Term database in RDBMS is equivalent to term _______ in Cassandra
A : keyspace
B : cluster
C : column family
D : column
Q.no 31. ______ consistency means that at some point the system will become
consistent once all the writes have propagated to all the nodes.
A : read
B : write
C : eventual
D : logical
Q.no 32. If the NoSQL database takes on the responsibility of allocating data to
shards and ensuring that data access goes to the right shard then it is called as
A : self-sharding
B : automatic-sharding
C : auto-sharding
D : right-sharding
Q.no 33. DBDeploy maintains a table in the database, named ______ , where all the
changes made to the database are stored.
A : LogChange
B : ChangeLog
C : Log_Change
D : Change_Log
Q.no 34. For which of the following problem spaces document are not the best
solution
A : Web Analytics or Real-Time Analytics
C : Event Logging
D : Queries against Varying Aggregate Structure
Q.no 35. If the result of a map-reduce computation is widely used, it can be stored
as
A : Stored Procedure
B : Function
C : Materialized View
D : Batch File
Q.no 36. During which phase, the old schema and the new schema are maintained
in parallel and are available for all the application using the database?
A : translation
B : transmission
C : transition
D : transportation
Q.no 37. MongoDB implements replication, providing high availability using

_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
Q.no 38. Map reduce operations can be composed into ______ where the output of
one reduce is the input to another operations map.
A : Functions
B : Pipelines
C : Procedures
D : Tasks
Q.no 39. By using _______, the result set will get trimmed from the top
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP
Q.no 40. Graph databases are
A : aggregate oriented
B : object oriented
C : relationship oriented
D : procedure oriented
Q.no 41. Cassandra puts the standard and super column families into ________
A : cluster
B : keyspace
C : row
D : column
Q.no 42. Which of the following is not a type of consistency in NoSQL?
A : Physical consistency
B : Logical consistency
C : Replication consistency
D : Eventual consistency
Q.no 43. Sharding a database across many server instances can be achieved with
_______________
A : LAN
B : SAN
C : MAN
D : PAN
Q.no 44. The concern that led to the growth of NOSQL databases was
A : rapid acess to lots of data
B : rapid access to few data
C : rapid access to application functionalities
D : rapid access to application components
Q.no 45. Which field is always the first field in the document?
A : _id
B : Ob_id
C : id
D : _id_
Q.no 46. In cassandra DEL command is used to delete ___________
A : row
B : column
C : entire column family
D : column or entire column family
Q.no 47. What is the aim of NoSQL?
A : NoSQL provides an alternative to SQL databases to store textual data.
B : NoSQL databases does not allow scaling data.
C : NoSQL is suitable for storing only structured data.
D : NoSQL is a new data format to store large datasets.
Q.no 48. For which of the following database, the aggregate is opaque to the
database
A : Graph Database
C : Column Database
D : Document Database
Q.no 49. Keeping all working data in _____ provides a performance advantage,
since there is not disk I/O to deal with when an event is processed.
A : files
B : database
C : memory
D : application
Q.no 50. In Column Family database, data can be structured as
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented
Q.no 51. _______ often have data warehouse systems, BI, and analytics systems that
may need data from polyglot data sources.
A : Single Application
B : Enterprise
C : Single database
D : All of the above
Q.no 52. ____________ supports changing data storage technologies as needs and
technology evolve.
A : Additional databases
B : Partitioning data
C : Partitioning functions
D : Service encapsulation
Q.no 53. The _____ is a opaque string that indicates the version of the resource.
A : Counter
B : Stamp
C : Bucket
D : etag
Q.no 54. Which of the following is not a Document Database?
A : HamsterDB
B : MongoDB
C : CouchDB
D : OrientDB
Q.no 55. You do not need to contact all replicants to preserve _______ consistency
with replication; you just need a large enough quorum.
A : read
B : write
C : strong
D : eventual
Q.no 56. _______ allows teams/people to coordinate their modifications of a
complex interconnected system, with the ability to explore past states.
A : Data
B : System State
C : Counters
D : Version Control
Q.no 57. When the columns in a cloumn family are simple columns, the column
family is known as _________ column family.
A : Simple column family
B : Standard column family
C : Single column family
D : Super column family
Q.no 58. Term ‘row’ in RDBMS is equivalent to term _______ in Riak
A : Bucket
B : Key_value
C : Key
D : Value
Q.no 59. The process where Multiple reducers operating on the partitions in
parallel, with the final results merged together is called as
A : Shuffling
B : Partitioning
C : Reducing
D : Clustering
Q.no 60. _________ is not the tool used for upgrading the database
A : DBDeploy
B : DBMaintain
C : Liquibase
D : DBManagement
Q.no 1. TWO broad reasons for considering a NOSQL database
A : handling storage and compexity
B : user friendly applications and durability of data
C : programmer productivity and data access performance
D : None
Q.no 2. A _____ column consists of a name and a value which is a map of columns.
A : simple
B : single
C : super
D : standard
Q.no 3. In map-reduce, partitioning allows reduce functions to run in ______
A : Parallel
B : Sequence
C : Random
Q.no 4. CQL stands for ______________
A : Column-family Query Language
B : Cluster Query Language
C : Column Query Language
D : Cassandra Query Language
Q.no 5. Overall design of the database is called as _________.
A : Database abstraction
B : Database schema
C : Database object
D : Database instance
Q.no 6. __________________ databases are more likely to run on a single server rather
than distributed across clusters.
A : Wide-Column
B : Key-Value
C : Graph
D : Document
Q.no 7. A _______ is designed to persist the memory image optimized for rapid
recovery of the state.
A : Snapshot
B : Event Log
C : Memory
D : data
Q.no 8. Which of the following is not a characteristics of NoSQL database
A : They are open source
B : No fixed schema
C : Designed to run on single machine
D : They do not use the relational model
Q.no 9. The simplest form of version stamp is
A : Counter
B : Stamp
C : Unique Identification
D : None
Q.no 10. __________ is about using different data storage technologies to handle
varying data storage needs.
A : Polyglot Persistence
B : Scaling
C : Replication
D : Distribution
Q.no 11. In graph databases, traversing the joins or relationships is ________
A : slow
B : medium
C : fast
D : very fast
Q.no 12. Which of the following is not a suitable use case for graph database?
A : Update all or a subset of entities
B : Social Network
C : Location-based services
D : Recommendation engines
Q.no 13. Neo4j saves data structured in ___________
A : table
B : graph
C : column
D : document
Q.no 14. Most applications, particularly nonstrategic ones, should stick with
_______ technology, at least until the NOSQL ecosystem becomes more mature.
A : object oriented
B : procedural
C : functional
D : relational
best solution

D : User Profiles
B : Accessibility
C : Consistency
D : Availability
A : Hbase
B : Cassandra
C : CouchDB
D : Amazon SimpleDB
A : Reduce
B : Map
C : Task
D : Framework
A : Graph Database
C : RDBMS
D : Key oriented
databases
A : Services
B : Functions
C : Commands
D : Procedures
A : an enterprise
C : Both
D : None
of the __________
A : Key
B : Value
C : Table
D : Structure

D : Column Database
Q.no 26. Once polyglot persistence is being used in the application, _________ needs
careful consideration
A : deployment complexity
B : storage complexity
C : functional complexity
D : replication complexity
Q.no 27. __________ is an effective platform for analyzing historic information,

since you can replicate any past state in the event log.
A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS
Q.no 28. ________ stores are used to store information about networks, such as
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph
Q.no 29. ______ approach/approaches lock data records to prevent conflicts
A : behavioral
B : pessimistic
C : optimistic
D : pessimistic and optimistic

Q.no 30. Adding more data storage increases _______
A : Inconsistency
B : Complexity in storage
C : Complexity in programming and operations
D : Complexity in durability
Q.no 31. In Distributed key-value store implementations of Riak ___________________

model for consistency is implemented
A : Version Stamps
B : Eventually consistency
C : Session consistency
D : Replication consistency
Q.no 32. Master -slave replication is most helpful for scaling when you have a
_____ intensive dataset.
A : write
B : read
C : write and read
D : update
Q.no 33. The technique which migrate data over time is known as _________.
A : incremental migration
B : database migration
C : schema migration
D : data migration
Q.no 34. All kinds of NOSQL systems are better suited to _______
A : non clustered data
B : nonuniform data
C : uniform data
D : clustered data
A : keyspace
B : cluster
C : column family
D : column
A : Functions
B : Pipelines
C : Procedures
D : Tasks
B : object oriented


_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
A : _id
B : Ob_id
C : id
D : _id_
A : translation
B : transmission
C : transition
D : transportation
as
B : Function
D : Batch File
_______________
A : LAN
B : SAN
C : MAN
D : PAN
A : LogChange
B : ChangeLog
C : Log_Change
D : Change_Log
A : read
B : write
C : eventual
D : logical
A : cluster
B : keyspace
C : row
D : column
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP

A : files
B : database
C : memory
D : application
Q.no 51. In Riak, we can use the _____________ in the POST request to specify the
data type.
A : JSON
B : Content-Type
C : XML
D : Bucket
Q.no 52. MATCH (n) DETACH DELETE n, this command in Neo4j is used for
A : Delete a single node
B : Delete a node with its relationship
C : Delete all nodes and relationships
D : Delete relationships only
Q.no 53. Using event sourcing an event can be broadcasted to multiple systems,
each of which can build a different _____________ for different purposes
A : Application file
B : Application database
C : Application counter
D : Application state
Q.no 54. An integration database is
A : A database with multiple applications, storing their data in common database.
B : A database with single applications storing the data in different database.
C : A database with multiple applications, storing their data in different database.
D : A database with single application and single database.
Q.no 55. Which of the following is not a reason that NoSQL has become a popular
solution for some organizations?
A : Better scalability
B : Improved ability to keep data consistent
C : Faster access to data than relational database management systems (RDBMS)
D : More easily allows for data to be held across multiple servers
Q.no 56. Materialized views can be updated through _____ operations
A : combinational map-reduce
B : Partitioning map-reduce
C : Reducers
D : Incremental map-reduce
Q.no 57. Which of the given is the simplest distribution option
A : sharding
B : replication
C : sharding and replication
D : no distribution
Q.no 58. Which of the following is not a key value database?
A : MemcachedDB
B : HamsterDB
C : BerkeleyDB
D : Terrastore
Q.no 59. What is not a disadvantage of integration database?
A : A structure that’s designed to integrate many applications can be too complex.
B : Different applications have different structural and performance needs.
C : An application want to make changes to its data storage, it needs to coordinate with
all the other applications using the database
D : Improves communication because all the applications are operating on a consistent

set of persistent data
Q.no 60. Term table in RDBMS is equivalent to term _______ in MongoDB
A : Collection
B : Document
C : Schema
D : Instance
C : Query by Data
D : None

A : quorum
C : read quorum
D : write quorum

B : Database schema
C : Database object
A : Parallel
B : Sequence
C : Random
Q.no 8. Schemaless databases can use the same migration techniques as databases
with _______ schemas
B : strong schema
C : physical schema
D : logical schema
A : Reduce
B : Read
C : Scan
D : Map
architectures?
B : Column based
C : Table based
D : Graph based
A : simple
B : single
C : super
D : standard
Q.no 12. __________________ databases are more likely to run on a single server
rather than distributed across clusters.
A : Wide-Column
B : Key-Value
C : Graph
D : Document
A : Files
B : RDBMS
C : Applications
D : Functions

A : replica set
B : cluster
C : partition
D : set
same time
A : read-read
B : read-write
C : write-read
D : write-write
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
A : Relational
B : Graph
C : Key Value
D : Document
A : Relational
B : Distributed
C : Object-oriented
D : Network
A : Reduce
B : Map
C : Task
D : Framework
A : an enterprise
C : Both
D : None
A : object oriented
B : procedural
C : functional
D : relational
A : Snapshot
B : Event Log
C : Memory
D : data
A : self-sharding
C : auto-sharding
D : right-sharding
A : Nodes
B : Properties
C : Relationship
D : Labels

A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph
solution
C : Event Logging
A : behavioral
B : pessimistic
C : optimistic
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented
A : Set of stamps
B : Set of Counters
C : Set of nodes
D : Set of systems
database
A : Graph Database
C : Column Database
A : row
B : column
B : nonuniform data
C : uniform data
D : clustered data
A : Functions
B : Pipelines
C : Procedures
D : Tasks
A : files
B : database
C : memory
D : application
A : _id
B : Ob_id
C : id
D : _id_

A : Version Stamps
A : write
B : read
C : write and read
D : update
D : data migration
A : cluster
B : keyspace
C : row
D : column
A : translation
B : transmission
C : transition
D : transportation
A : keyspace
B : cluster
C : column family
D : column
B : object oriented
Q.no 51. In MongoDB, If we have three nodes in the replica set and specify w as
majority
A : the write will have to complete writing to all three nodes before it is reported as a
success.
B : the write will have to complete at a minimum of two nodes before it is reported as a
success
C : the write will have to complete at a minimum of one node before it is reported as a
success
D : the write will have to complete followed by at least one read
Q.no 52. Which of the following is a reason why relational databases have a fixed
schema?
A : The database can apply its own validations upon that data to ensure that different
applications don’t manipulate data in an inconsistent way
B : Need to dig into the application code to see the database schema
C : Cannot decide how to store and retrieve data efficiently
D : Allow storage of large amount of data
Q.no 53. What do you mean by impedance mismatch?
A : The difference between the relational model and in-memory data structure
B : The difference between the relational model and tuples structure
C : The difference between the relational models and the table structure
D : The difference between the relational models and application database
technology evolve.
B : Enterprise
C : Single database
Q.no 56. Which of the following avoids loading all writes onto a single point of
failure.
A : Data Replication
B : Transactional Replication
C : Master-slave replication
D : Peer-to-peer replication
Q.no 57. Which of the following is not a advantage of schema less binding
A : Easily store whatever you need
B : Easily change your data storage as you learn more about your project
C : Easily add new things as you discover them you have to
D : Have to figure out in advance what you need to store
A : Shuffling
B : Partitioning
C : Reducing
D : Clustering
Q.no 59. In Cassandra, what do you mean by ‘Skinny rows’
A : A row having many columns, with each row having very different columns
B : A row having few columns with the same columns used across the many different
rows.
C : A row having many columns, with each row having same columns
D : A row having few columns with different columns used across the many different
rows
A : Counter
B : Stamp
C : Bucket
D : etag
A : Graph Database
C : RDBMS
D : Key oriented
C : Query by Data
databases
A : Services
B : Functions
C : Commands
D : Procedures
A : table
B : graph
C : column
D : document
of the __________
A : Key
B : Value
C : Table
D : Structure
D : Column Database

B : Scaling
C : Replication
D : Distribution
best solution
D : User Profiles
A : Counter
B : Stamp
D : None
B : Social Network
A : slow
B : medium
C : fast
D : very fast
B : Accessibility
C : Consistency
D : Availability
A : Hbase
B : Cassandra
C : CouchDB
D : Amazon SimpleDB
A : Parallel
B : Sequence
C : Random

A : Relational
B : Graph
C : Key Value
D : Document
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
A : Wide-Column
B : Key-Value
C : Graph
D : Document
D : None
architectures?
B : Column based
C : Table based
D : Graph based
A : quorum
C : read quorum
D : write quorum
B : strong schema
C : physical schema
D : logical schema
A : Relational
B : Distributed
C : Object-oriented
D : Network
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP
A : Inconsistency

_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
database
A : Graph Database
C : Column Database
A : self-sharding
C : auto-sharding
D : right-sharding
_______________
A : LAN
B : SAN
C : MAN
D : PAN
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented
as
B : Function
D : Batch File
A : LogChange
B : ChangeLog
C : Log_Change
D : Change_Log
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph

A : Set of stamps
B : Set of Counters
C : Set of nodes
D : Set of systems
A : read
B : write
C : eventual
D : logical
A : behavioral
B : pessimistic
C : optimistic
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS
solution
C : Event Logging
A : Nodes
B : Properties
C : Relationship
D : Labels
A : row
B : column
A : files
B : database
C : memory
D : application
B : nonuniform data
C : uniform data
D : clustered data

A : Version Stamps
A : Collection
B : Document
C : Schema
D : Instance
A : Bucket
B : Key_value
C : Key
D : Value
Q.no 55. ________ storage is/can be used to enhance legacy storage.
A : Single
B : Functional
C : Supplemental
D : Random
A : DBDeploy
B : DBMaintain
C : Liquibase
D : DBManagement
A : read
B : write
C : strong
D : eventual

A : MemcachedDB
B : HamsterDB
C : BerkeleyDB
D : Terrastore
B : Database schema
C : Database object
Q.no 2. Most applications, particularly nonstrategic ones, should stick with _______
technology, at least until the NOSQL ecosystem becomes more mature.
A : object oriented
B : procedural
C : functional
D : relational
A : an enterprise
C : Both
D : None
A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
A : Reduce
B : Read
C : Scan
D : Map
Q.no 6. To provide high availability and data consistency, in a production sharded

cluster, each shard is a ___________
A : replica set
B : cluster
C : partition
D : set
databases
A : Services
B : Functions
C : Commands
D : Procedures
of the __________
A : Key
B : Value
C : Table
D : Structure
A : table
B : graph
C : column
D : document
same time
A : read-read
B : read-write
C : write-read
D : write-write
A : Graph Database
C : RDBMS
D : Key oriented
A : simple
B : single
C : super
D : standard
A : Reduce
B : Map
C : Task
D : Framework
A : Snapshot
B : Event Log
C : Memory
D : data

A : Files
B : RDBMS
C : Applications
D : Functions
C : Query by Data
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility

D : None
architectures?
B : Column based
C : Table based
D : Graph based
B : Social Network
A : translation
B : transmission
C : transition
D : transportation
A : _id
B : Ob_id
C : id
D : _id_
D : data migration
A : keyspace
B : cluster
C : column family
D : column
A : Functions
B : Pipelines
C : Procedures
D : Tasks
A : write
B : read
C : write and read
D : update
B : object oriented
A : Inconsistency
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP
A : cluster
B : keyspace
C : row
D : column
solution

C : Event Logging
A : LogChange
B : ChangeLog
C : Log_Change
D : Change_Log

_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
A : self-sharding
C : auto-sharding
D : right-sharding

A : Version Stamps
A : row
B : column
A : Nodes
B : Properties
C : Relationship
D : Labels
database
A : Graph Database
C : Column Database
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented

A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS
A : read
B : write
C : eventual
D : logical
A : files
B : database
C : memory
D : application
as
B : Function
D : Batch File

A : Data
B : System State
C : Counters
D : Version Control
B : Enterprise
C : Single database
technology evolve.
A : Counter
B : Stamp
C : Bucket
D : etag
data type.
A : JSON
B : Content-Type
C : XML
D : Bucket
A : Shuffling
B : Partitioning
C : Reducing
D : Clustering
Q.no 58. Which of the given is the simplest distribution option
A : sharding
B : replication
C : sharding and replication
D : no distribution
failure.
A : HamsterDB
B : MongoDB
C : CouchDB
D : OrientDB
A : Parallel
B : Sequence
C : Random
B : Accessibility
C : Consistency
D : Availability
A : quorum
C : read quorum
D : write quorum
D : Column Database
A : Relational
B : Distributed
C : Object-oriented
D : Network
best solution
D : User Profiles
B : strong schema
C : physical schema
D : logical schema
A : Hbase
B : Cassandra
C : CouchDB
D : Amazon SimpleDB
A : Relational
B : Graph
C : Key Value
D : Document
B : Database schema
C : Database object
A : slow
B : medium
C : fast
D : very fast
B : Scaling
C : Replication
D : Distribution

A : Counter
B : Stamp
D : None
A : Wide-Column
B : Key-Value
C : Graph
D : Document
architectures?
B : Column based
C : Table based
D : Graph based
A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
D : None
of the __________
A : Key
B : Value
C : Table
D : Structure

A : table
B : graph
C : column
D : document
A : object oriented
B : procedural
C : functional
D : relational
same time
A : read-read
B : read-write
C : write-read
D : write-write
A : simple
B : single
C : super
D : standard
A : Reduce
B : Map
C : Task
D : Framework
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
A : write
B : read
C : write and read
D : update
A : Set of stamps
B : Set of Counters
C : Set of nodes
D : Set of systems
A : Inconsistency
A : behavioral
B : pessimistic
C : optimistic

A : Functions
B : Pipelines
C : Procedures
D : Tasks
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
A : keyspace
B : cluster
C : column family
D : column
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph
A : _id
B : Ob_id
C : id
D : _id_
D : data migration

A : translation
B : transmission
C : transition
D : transportation
B : object oriented
B : nonuniform data
C : uniform data
D : clustered data
_______________
A : LAN
B : SAN
C : MAN
D : PAN
A : files
B : database
C : memory
D : application
A : Nodes
B : Properties
C : Relationship
D : Labels

A : Version Stamps
as
B : Function
D : Batch File
solution
C : Event Logging

A : read
B : write
C : eventual
D : logical
A : row
B : column

A : Bucket
B : Key_value
C : Key
D : Value
rows.
rows
A : DBDeploy
B : DBMaintain
C : Liquibase
D : DBManagement
A : MemcachedDB
B : HamsterDB
C : BerkeleyDB
D : Terrastore
majority
success.
success
success

A : quorum
C : read quorum
D : write quorum

C : Query by Data
A : Snapshot
B : Event Log
C : Memory
D : data
Q.no 6. To provide high availability and data consistency, in a production sharded

cluster, each shard is a ___________
A : replica set
B : cluster
C : partition
D : set
A : Reduce
B : Read
C : Scan
D : Map
A : an enterprise
C : Both
D : None
D : Column Database
A : Files
B : RDBMS
C : Applications
D : Functions
B : Social Network
B : Accessibility
C : Consistency
D : Availability
A : Graph Database
C : RDBMS
D : Key oriented
A : Parallel
B : Sequence
C : Random
databases
A : Services
B : Functions
C : Commands
D : Procedures
A : Relational
B : Graph
C : Key Value
D : Document
A : Counter
B : Stamp
D : None
D : None

same time
A : read-read
B : read-write
C : write-read
D : write-write
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
A : object oriented
B : procedural
C : functional
D : relational
A : keyspace
B : cluster
C : column family
D : column

A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS
A : Inconsistency
A : behavioral
B : pessimistic
C : optimistic
A : cluster
B : keyspace
C : row
D : column
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated

database
A : Graph Database
C : Column Database
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph
_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
A : LogChange
B : ChangeLog
C : Log_Change
D : Change_Log
A : Functions
B : Pipelines
C : Procedures
D : Tasks
A : Set of stamps
B : Set of Counters
C : Set of nodes
D : Set of systems
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP
A : self-sharding
C : auto-sharding
D : right-sharding
A : write
B : read
C : write and read
D : update
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented
D : data migration
A : _id
B : Ob_id
C : id
D : _id_
B : object oriented
as
B : Function
D : Batch File
A : Nodes
B : Properties
C : Relationship
D : Labels
data type.
A : JSON
B : Content-Type
C : XML
D : Bucket
technology evolve.
C : Reducers
B : Enterprise
C : Single database

A : Collection
B : Document
C : Schema
D : Instance
Q.no 57. Which of the following is not a advantage of schema less binding
A : Easily store whatever you need
B : Easily change your data storage as you learn more about your project
C : Easily add new things as you discover them you have to
D : Have to figure out in advance what you need to store
A : Shuffling
B : Partitioning
C : Reducing
D : Clustering
A : Single
B : Functional
C : Supplemental
D : Random
A : Counter
B : Stamp
C : Bucket
D : etag

B : Database schema
C : Database object
Q.no 2. A ____ is a function whose input is a single aggregate and whose output is a
bunch of key-value pairs
A : Reduce
B : Map
C : Task
D : Framework
of the __________
A : Key
B : Value
C : Table
D : Structure
A : table
B : graph
C : column
D : document
A : slow
B : medium
C : fast
D : very fast
A : Relational
B : Distributed
C : Object-oriented
D : Network
A : simple
B : single
C : super
D : standard
C : Query by Data
best solution
D : User Profiles
A : Snapshot
B : Event Log
C : Memory
D : data
B : strong schema
C : physical schema
D : logical schema
A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
A : Wide-Column
B : Key-Value
C : Graph
D : Document
architectures?
B : Column based
C : Table based
D : Graph based
A : quorum
C : read quorum
D : write quorum
A : Hbase
B : Cassandra
C : CouchDB
D : Amazon SimpleDB
B : Scaling
C : Replication
D : Distribution
B : Accessibility
C : Consistency
D : Availability

A : replica set
B : cluster
C : partition
D : set
same time
A : read-read
B : read-write
C : write-read
D : write-write
A : Parallel
B : Sequence
C : Random

A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
A : keyspace
B : cluster
C : column family
D : column
solution
C : Event Logging
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph
A : read
B : write
C : eventual
D : logical
A : behavioral
B : pessimistic
C : optimistic
A : cluster
B : keyspace
C : row
D : column

database
A : Graph Database
C : Column Database
A : row
B : column
_______________
A : LAN
B : SAN
C : MAN
D : PAN
A : translation
B : transmission
C : transition
D : transportation
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
A : files
B : database
C : memory
D : application
A : Inconsistency

A : Version Stamps

A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS
B : nonuniform data
C : uniform data
D : clustered data
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented
A : self-sharding
C : auto-sharding
D : right-sharding
A : Functions
B : Pipelines
C : Procedures
D : Tasks
B : object oriented
A : HamsterDB
B : MongoDB
C : CouchDB
D : OrientDB
A : read
B : write
C : strong
D : eventual

rows.
rows
Q.no 56. Which of the following is a reason why relational databases have a fixed
schema?
A : The database can apply its own validations upon that data to ensure that different
applications don’t manipulate data in an inconsistent way
B : Need to dig into the application code to see the database schema
C : Cannot decide how to store and retrieve data efficiently
D : Allow storage of large amount of data

A : Data
B : System State
C : Counters
D : Version Control
A : DBDeploy
B : DBMaintain
C : Liquibase
D : DBManagement
failure.
B : Database schema
C : Database object
A : Reduce
B : Map
C : Task
D : Framework
A : an enterprise
C : Both
D : None
D : Column Database
A : Counter
B : Stamp
D : None
A : Graph Database
C : RDBMS
D : Key oriented
A : Reduce
B : Read
C : Scan
D : Map

A : table
B : graph
C : column
D : document
A : Relational
B : Graph
C : Key Value
D : Document
A : object oriented
B : procedural
C : functional
D : relational
databases
A : Services
B : Functions
C : Commands
D : Procedures
B : Social Network
A : slow
B : medium
C : fast
D : very fast

D : None
of the __________
A : Key
B : Value
C : Table
D : Structure
A : Files
B : RDBMS
C : Applications
D : Functions
A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
A : Hbase
B : Cassandra
C : CouchDB
D : Amazon SimpleDB
B : Accessibility
C : Consistency
D : Availability

A : replica set
B : cluster
C : partition
D : set
A : inefficiency
B : unavailability
C : inconsistency
D : inaccessibility
A : read
B : write
C : eventual
D : logical
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP
as
B : Function
D : Batch File
A : Nodes
B : Properties
C : Relationship
D : Labels
solution
C : Event Logging
A : keyspace
B : cluster
C : column family
D : column
A : _id
B : Ob_id
C : id
D : _id_
A : LogChange
B : ChangeLog
C : Log_Change
D : Change_Log
D : data migration
social connections.
A : Key-Value
B : Wide-Column
C : Document
D : Graph

A : Set of stamps
B : Set of Counters
C : Set of nodes
D : Set of systems
A : write
B : read
C : write and read
D : update

_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
database
A : Graph Database
C : Column Database
B : nonuniform data
C : uniform data
D : clustered data
A : row
B : column
A : Functions
B : Pipelines
C : Procedures
D : Tasks
_______________
A : LAN
B : SAN
C : MAN
D : PAN
A : cluster
B : keyspace
C : row
D : column
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
B : object oriented
A : self-sharding
C : auto-sharding
D : right-sharding

majority
success.
success
success
A : Counter
B : Stamp
C : Bucket
D : etag
A : Collection
B : Document
C : Schema
D : Instance
A : Bucket
B : Key_value
C : Key
D : Value

A : MemcachedDB
B : HamsterDB
C : BerkeleyDB
D : Terrastore

B : Enterprise
C : Single database
A : Single
B : Functional
C : Supplemental
D : Random
data type.
A : JSON
B : Content-Type
C : XML
D : Bucket
A : Reduce
B : Map
C : Task
D : Framework
A : Relational
B : Distributed
C : Object-oriented
D : Network
B : strong schema
C : physical schema
D : logical schema
best solution

D : User Profiles

B : Scaling
C : Replication
D : Distribution
Q.no 7. __________________ databases are more likely to run on a single server rather
than distributed across clusters.
A : Wide-Column
B : Key-Value
C : Graph
D : Document
D : Column Database
A : quorum
C : read quorum
D : write quorum
A : Snapshot
B : Event Log
C : Memory
D : data
same time
A : read-read
B : read-write
C : write-read
D : write-write
C : Query by Data
A : Parallel
B : Sequence
C : Random
architectures?
B : Column based
C : Table based
D : Graph based
A : simple
B : single
C : super
D : standard
B : Database schema
C : Database object
A : an enterprise
C : Both
D : None
databases
A : Services
B : Functions
C : Commands
D : Procedures

A : Relational
B : Distributed
C : Schemaless
D : Object-oriented
A : Graph Database
C : RDBMS
D : Key oriented
B : Social Network
of the __________
A : Key
B : Value
C : Table
D : Structure
B : Accessibility
C : Consistency
D : Availability
A : Inconsistency

A : File system
B : Event sourcing
C : NOSQL databases
D : RDBMS

A : Version Stamps
A : Row oriented
B : Table oriented
C : Two Dimensional
D : Key oriented
A : LIMIT
B : ORDER BY
C : WITH
D : SKIP
solution
C : Event Logging
A : read
B : write
C : eventual
D : logical
as
B : Function
D : Batch File
A : Nodes
B : Properties
C : Relationship
D : Labels
A : translation
B : transmission
C : transition
D : transportation
A : files
B : database
C : memory
D : application
A : keyspace
B : cluster
C : column family
D : column
A : behavioral
B : pessimistic
C : optimistic
______________ data.
A : unstructured
B : structured
C : semi-structured
D : tabulated
A : _id
B : Ob_id
C : id
D : _id_
B : object oriented
A : row
B : column
A : Functions
B : Pipelines
C : Procedures
D : Tasks
database
A : Graph Database
C : Column Database
D : data migration
_______________
A : LAN
B : SAN
C : MAN
D : PAN

_______________
A : Replica Safe
B : Version Stamp
C : Quorums
D : Replica sets
technology evolve.
rows.
rows

A : Shuffling
B : Partitioning
C : Reducing
D : Clustering
A : read
B : write
C : strong
D : eventual
A : DBDeploy
B : DBMaintain
C : Liquibase
D : DBManagement
C : Reducers
failure.
Database Technology MCQ
1. Which of the following is not a NoSQL database?
 Cassandra
 MongoDB
 SQL Server
 None of the above

View Answer
SQL Server
2. Which of the following is a nosql database type?
 SQL
 JSON
 Document databases
 None of the Above
View Answer
Document databases
3. Which of the following are the simplest NoSQL databases?
 Key-value
 Document
 Wide-column
 All of the above
View Answer
Key-value
4. What is the aim of nosql?
 NoSQL is not suitable for storing structured data.

 NoSQL databases allow storing non-structured data.
 NoSQL is a new data format to store large datasets.
 NoSQL provides an alternative to SQL databases to store textual data.
View Answer
NoSQL is a new data format to store large datasets.
5. All nosql databases are similar. true or false.
 True
 False
View Answer
False
6. Which of the following is not a strong feature for nosql databases?
 Scalability
 Relational data
 Faster data access than RDBMS.
 Data easily held across multiple servers
View Answer
Relational data
7. What are the types of nosql databases
 Document databases.
 Key-value stores
 Graph & Column-oriented databases.
 All of the above
View Answer
All of the above
8. Which of the following is not a valid NoSQL database?
 Cassandra
 Scylla
 Handhoop / Hbase
 PostgreSQL
View Answer
PostgreSQL
9. Does nosql databases prohibits the use of sql?
 Yes
 No
View Answer
No
10. What is NoSQL database?
 NoSQL is a database is an enhanced form of RDBMS.

 NoSQL is database that is built with enhancements to DBMS.
 NoSQL is a database that is built on ways and means other than table.s and columns.
 None of the Above
View Answer
NoSQL is a database that is built on ways and means other than table.s and columns.
11. Is MongoDB a NoSQL database?
 Yes
 No
View Answer
Yes
12. NoSQL can be referred to as .............
 No SQL
 Only SQL
 Not Only SQL
 SQL Undefined
View Answer
Not Only SQL
13. Which of the following represent column in NoSQL __________.
 Field
 Database
 Collection
 Document
View Answer
Field
14. The core principle of nosql is ...........

 High availability
 Low availability
 both High & Low availability
 None of above
View Answer
High availability
15. ................. is a online NoSQL developed by Cloudera.
 Oozie
 Hbase
 Imphala
 HCatalog
View Answer
Hbase
16. NoSQL databases is used mainly for handling large volumes of ______________
data.
 structured
 unstructured
 semi-structured
 None of above
View Answer
unstructured
17. Which of the following is not an example of a nosql database management

system?
 HBase
 MongoDB
 CouchDB
 PostgreSQL
View Answer
PostgreSQL
18. Which of the following is a characteristic of a NoSQL database?
 Uses JSON
 Needs a schema
 Requires JOINs
 Uses tables for storage
View Answer
Uses JSON
19. NoSQL databases are most often referred to as
 Network
 Distributed
 Relational
 Object-oriented
View Answer
Relational
20. Which of the following is a reason to use an SQL database?

 It's ACID-compliant.
 It can easily store unstructured data. It's ACID-compliant.
 It can enable development in the cloud
 None of above
View Answer
It's ACID-compliant.
NoSQL MCQ
1) What is the aim of NoSQL?
 A. Not suitable for storing structured data.
 B.Allow storing non-structured data.

 C.New data format to store large datasets.
 D.An alternative to SQL databases to store textual data.
2) The core principle of nosql is __________.
 A. Low availability
 B.High availability
 C.Both A and B
 D.None of the above
3) Which architecture does NoSQL follow?
 A. Shared Memory
 B.Shared Nothing
 C.Shared Disk
 D.Shared Nothing Architecture
4) Which of the following is not a NoSQL database?

 A. MongoDB
 B.SQL Server
 C.Cassandra
 D.None of them
5) Which of the following are the simplest NoSQL databases?
 A. Document
 B.Wide column
 C.Key value
 D.All of them
6) Following represent column in NoSQL______
 A. Field
 B.Document
 C.Database
 D.Collection
7) In which year NoSQL was released
 A. 1996
 B.1997
 C.1998
 D.1999
8) Who developed by NoSQL ?
 A. Alen turing
 B.Carlo Strozzi
 C.Mayank K.
 D.None of them
9) Which of the following is a NoSQL Database Type ?
 A. SQL
 B.JSON
 C.Document databases
 D.All of the above
10) Why MongoDB is known as the best NoSQL database?
 A. Easily Scalable
 B.High Performance
 C.Rich Query language
11) List the different kinds of NoSQL data stores?
 A. Key-value store
 B.Column family store
 C.Graph store
12) Which of the following is a primary classification for nosql

architectures
 A. Document & Graph Database
 B.Key / value database

 C.column-oriented database
 D.All of the Above
Neo4j MCQ
1. Neo4j is a _____
A. Centralised database
B. Distributed database
C. End-user database
D. graph database
View Answer
Ans : D
Explanation: Neo4j is a graph database management system
2. Programming language used in Neo4J?

A. C
B. C++
C. Java
D. Python
View Answer
Ans : C
Explanation: Programming language: Java
3. Tables are represent as?

A. Graphs
B. Nodes
C. Relationships
D. Traversal
View Answer
Ans : A
Explanation: Tables are represent as Graphs in Neo4J.
4. Which of the following are an Advantages of Neo4j?

A. Flexible data model
B. Real-time insights
C. High availability
D. All of the above
View Answer
Ans : D
Explanation: All of the above are an advantages of neo4j.

5. Which of the following not true about Neo4j Property Graph Data
Model?
A. Properties are key-value pairs
B. The model does not represents data in Nodes, Relationships and Properties
C. Relationships have directions: Unidirectional and Bidirectional
D. Relationships connects nodes
View Answer
Ans : B
Explanation: The model represents data in Nodes, Relationships and Properties
6. CQL stands for?

A. Command Query Language
B. Clause Query Language
C. Cypher Query Language
D. Create Query Language
View Answer
Ans : C
Explanation: CQL stands for Cypher Query Language. Like Oracle Database has query
language SQL, Neo4j has CQL as query language.
7. Which clause is used to find the starting points through the legacy
indexes?
A. OPTIONAL MATCH
B. START
C. WHERE
D. FIND
View Answer
Ans : B
Explanation: Start : This clause is used to find the starting points through the legacy
indexes.
8. Which clause is used to delete nodes and relationships or paths etc.
from the graph?
A. DELETE
B. DROP
C. REMOVE
D. DEL
View Answer
Ans : A
Explanation: DELETE : clause is used to delete nodes and relationships or paths etc. from
the graph.
9. Neo4j supports full ACID (Atomicity, Consistency, Isolation, and

Durability) rules.
A. TRUE
B. FALSE
C. Can be true or false
D. Can not say
View Answer
Ans : A
Explanation: Neo4j supports full ACID (Atomicity, Consistency, Isolation, and Durability)
rules.
10. Which of the following is not a Neo4J CQL command?

A. Create
B. Match
C. Delete
D. Exit
View Answer
Ans : D
Explanation: Exit is not a Neo4J CQL command.

By OnlineInterviewQuestions.com
NoSQL MCQ
Take NoSQL MCQ Test & Online Quiz to Test your Knowledge
Below we have listed the few NoSQL MCQ Questions that check your basic knowledge of NoSQL. This
NoSQL MCQ Test contains 20 Multiple Choice Questions. You have to select the right answer to the question.
You can also take the online quiz from the take NoSQL Quiz Button.
Q1. Which of the following is not a NoSQL database?
A. Cassandra
B. MongoDB
C. SQL Server
D. None of the above
Q2. Which of the following is a nosql database type?
A. SQL
B. JSON
C. Document databases
D. None of the Above
Q3. Which of the following are the simplest NoSQL databases?
A. Key-value
B. Document
C. Wide-column
D. All of the above
Q4. What is the aim of nosql?

A. NoSQL is not suitable for storing structured data.
B. NoSQL databases allow storing non-structured data.
C. NoSQL is a new data format to store large datasets.
D. NoSQL provides an alternative to SQL databases to store textual data.
Q5. All nosql databases are similar. true or false.
A. True
B. False
Q6. Which of the following is not a strong feature for nosql databases?
A. Scalability
B. Relational data
C. Faster data access than RDBMS.
D. Data easily held across multiple servers
Q7. What are the types of nosql databases
A. Document databases.
B. Key-value stores
C. Graph & Column-oriented databases.
D. All of the above
Q8. Which of the following is not a valid NoSQL database?
A. Cassandra
B. Scylla
C. Handhoop / Hbase
D. PostgreSQL
Q9. Does nosql databases prohibits the use of sql?
A. Yes
B. No
Q10. What is NoSQL database?
A. NoSQL is a database is an enhanced form of RDBMS.

B. NoSQL is database that is built with enhancements to DBMS.
C. NoSQL is a database that is built on ways and means other than table.s and columns.
D. None of the Above
Q11. Is MongoDB a NoSQL database?
A. Yes
B. No
Q12. NoSQL can be referred to as .............
A. No SQL
B. Only SQL
C. Not Only SQL
D. SQL Undefined
Q13. Which of the following represent column in NoSQL __________.
A. Field
B. Database
C. Collection
D. Document
Q14. The core principle of nosql is ...........
A. High availability
B. Low availability
C. both High & Low availability
D. None of above
Q15. ................. is a online NoSQL developed by Cloudera.
A. Oozie
B. Hbase
C. Imphala
D. HCatalog
Q16. NoSQL databases is used mainly for handling large volumes of ______________
data.
A. structured
B. unstructured
C. semi-structured
D. None of above
Q17. Which of the following is not an example of a nosql database management system?
A. HBase
B. MongoDB
C. CouchDB
D. PostgreSQL
Q18. Which of the following is a characteristic of a NoSQL database?
A. Uses JSON
B. Needs a schema
C. Requires JOINs
D. Uses tables for storage
Q19. NoSQL databases are most often referred to as
A. Network
B. Distributed
C. Relational
D. Object-oriented
Q20. Which of the following is a reason to use an SQL database?
A. It's ACID-compliant.
B. It can easily store unstructured data. It's ACID-compliant.
C. It can enable development in the cloud
D. None of above
Please Visit OnlineInterviewquestions.com to download more pdfs
Dat
abaseTechnol
ogi
es
Aggr
egat
eDat
amodel
1.I
nAggr
egat
eor
ient
edf
ramewor
kofNoSQLuseroper
atesdat
aon…….
a)Uni
ts b)Rows c)Col
umnsd)Bot
hbandc
2.Aggr
egat
eisat
ermt
hatcomesf
rom…….
.
a)DataDri
venDesi
gnb)Domai
nDr
ivenDesi
gnc)Dat
aOr
ient
edDesi
gnd)Domai
n
aggr
egateDesi
gn
3.Aggr
egat
edat
abasesoper
ateson……
a)Cl
ust
erb)Rowsc)Col
umnsd)Memor
ies
4.Rel
ati
onal
dat
abasesar
e…….
.
a)Aggr
egat
eor
ient
edb)Aggr
egat
eignor
antc)Aggr
egat
emat
chi
ngd)Aggr
egat
emat
ched
5)
……dat
abasesar
eal
soaggr
egat
e-i
gnor
ant
a)Col
umnv
alueb)Documentc)Keyv
alued)Gr
aph
6.NoSQLdat
abasessacr
if
ice…….
a)
Consi
stencyb)At
omi
cit
yc)Dur
abi
l
ityd)I
sol
ati
on
7.Col
umn-
fami
l
ydat
abasesor
gani
zet
hei
rcol
umnsi
nto……
a)
Dat
afami
l
iesb)
Rowf
ami
l
iesc)Col
umnf
ami
l
iesd)Dat
abasef
ami
l
ies
8.Eachr
owi
ncol
umnf
ami
l
ydat
abasei
san……….
a)Dat
abaser
owb)Dat
abasecol
umnc)Aggr
egat
ed)Recor
d
9.………i
sacol
umnf
ami
l
ydat
abase
a)MongoDBb)
PLpgSQLc)
CouchDBd)Cassandr
a
10.Cassendr
ausest
erm wi
deandski
nnyf
or………
a)col
umnsb)
tabl
esc)
dat
abaseuni
tsd)
rows
11.Awi
der
owi
nCassandr
ahas……….
.col
umns
a)100b)
10c)
1d)1000
12.Acol
umnf
ami
l
ydat
abasedef
ines……….
.f
ori
tscol
umns
a)Keyv
aluepai
rb)Rowsc)Col
umnsd)Sor
tor
der
13.…………dat
abasesar
est
rongl
yaggr
egat
eor
ient
ed
a)Rel
ati
onalb)Obj
ector
ient
edc)Documentd)Col
umnf
ami
l
y
14.Aggr
egat
eis…….t
othedat
abase
a)Opaqueb)Rowc)Col
umnd)Cl
ust
er
15.Redi
sal
l
owsy
out
obr
eakdownt
heaggr
egat
eint
o…………
a)Rowsb)Col
umnsc)Li
stsorset
sd)Aggr
egat
es
16.I
nNoSQL,
……….
.isacol
l
ect
ionofdat
athatwei
nter
actwi
thasauni
t
a)Rowb)Col
umnc)Aggr
egat
ed)Tabl
e
17.I
naggr
egat
eor
ientdat
abasesdat
aismanagedov
er….
.
a)Cl
ust
ersb)Rowsc)Col
umnsd)Tabl
es
18.Wi
thakey
-val
uest
ore,
wecanonl
yaccessanaggr
egat
ebyl
ookupbasedoni
ts……
a)Keyb)Rowc)Col
umnd)Tabl
e
19.………i
snotacol
umnf
ami
l
ydat
abase
a)Googl
e'
sBi
gTabl
eb)C-
Stor
ec)HBased)MongoDB
20.…….
.i
snotadocument
abase
a)CouchDBb)Or
ient
DBc)Rav
enDBd)HBase
Dat
aModel
Det
ail
i
ng
1.Aggr
egat
esar
ecr
eat
edwhendat
athati
s………accessedt
oget
her
.
a)Randoml
yb)Lessf
requent
lyc)Commonl
yd)Nev
er
2.Whendat
acont
ainsmanyr
elat
ionshi
ps,
…..
areused
a)Rel
ati
onal
dat
abasesb)NoSQLdat
abasesc)Obj
ector
ient
eddat
abases.d)bandcbot
h
3.I
ngr
aphdat
abasesv
ert
icesar
ecal
l
edas….
a)Edgesb)Rel
ati
onshi
psc)Nodesd)Mat
ri
ces
4.…….
typeofGraphdat
abasesst
oresJav
aobj
ect
s,whi
char
esubcl
assesofi
tsbui
l
t-i
nty
pes,
asnodesandedges.
a)I
nfi
nit
eb)Fi
nit
ec)NoSQLd)Fl
ockDB
5.……..
typeofgr
aphdatabasesall
owsusert
oat
tachJav
aobj
ect
saspr
oper
ti
est
onodes
andedgesinaschemal
essf ashi
on
a)I
nfi
nit
eb)Fl
ockDBc)Neo4j
d)Fi
nit
e
6.NoSQLdat
abasesar
e………
a)Schemaor
ient
edb)Schemaf
oll
owi
ngc)Schemal
essd)Schemasucceedi
ng
7.……dat
aiscal
l
edasnonuni
for
m dat
a
a)dat
awher
eeachr
ecor
dhasasamesetoff
iel
ds
b)dat
awher
eeachr
ecor
dhasadi
ff
erentsetoff
iel
ds
c)dat
awher
eeachr
ecor
dhasaequal
setoff
iel
ds
d)dat
awher
eeachr
ecor
dhasanosetoff
iel
ds
8.……isasetofassumpt
ionsaboutt
hedat
a'sst
ruct
urei
nthecodet
hatmani
pul
atest
he
data.
a)Expl
i
citschemab)Schemaov
erschemac)I
mpl
i
citschemad)Met
adat
aschema
9.Mater
ial
i
zedv
iewsar
eef
fect
ivef
ordat
athati
s…….heav
il
ybutcanst
andbei
ngsomewhat
stal
e.
a)Wr
it
eb)Readc)Bot
hreadandwr
it
ed)Onl
ywr
it
e
10.….
.ar
ethet
woappr
oachesusedt
obui
l
dmat
eri
ali
zedv
iews
a)Eagerappr
oachandappl
i
cat
iondat
abaseappr
oach
b)Eagerappr
oachandcl
i
entdat
abaseappr
oach
c)Eagerappr
oachanddi
str
ibut
eddat
abaseappr
oach
d)Eagerappr
oachandcent
ral
i
zeddat
abaseappr
oach
11.Mat
eri
ali
zedv
iewscanbeusedwi
thi
nthe…….
aggr
egat
e
a)Sameb)Di
ff
erentc)Out
sided)Ot
her
12.Whichofthefol
lowi
ngi
sther
easonbehi
ndgr
aphdat
abasesar
eadv
ant
ageousov
er
rel
ati
onaldat
abases?
a)Gr
aphdat
abasesshi
ftmostoft
hewor
kofnav
igat
ingr
elat
ionshi
psf
rom quer
yti
met
o
i
nser
tti
me
b)Gr
aphdat
abasesdoesnotshi
ftmostoft
hewor
kofnav
igat
ingr
elat
ionshi
psf
rom quer
y
ti
metoi
nser
tti
me
c)Gr
aphdat
abasesshi
ftf
ewoft
hewor
kofnav
igat
ingr
elat
ionshi
psf
rom quer
yti
met
o
i
nser
tti
me
d)Graphdat
abasesshi
ftmostoft
hewor
kofnav
igat
ingr
elat
ionshi
psf
rom t
ransact
iont
ime
toi
nsertt
ime
di
str
ibut
ionModel
…
1.Repl
i
cat
iont
akest
hesamedat
aandcopi
esi
tov
er……nodes
a)Sameb)Mul
ti
plec)Equal
d)Unequal
2.Shar
dingput
sdi
ff
erentdat
aon….
.nodes
a)Sameb)Cl
i
entc)Ser
verd)Di
ff
erent
3.Runthedat
abaseonasingl
emachi
net
hathandl
esal
lther
eadsandwr
it
est
othedat
a
stor
e.I
sanexampleof…….
.
a)Si
ngl
eser
verb)Mul
ti
pleser
verc)Di
str
ibut
erser
verd)Di
str
ibut
edcl
i
ent
4.Shar
dingwi
l
lbedoneon…….
.scal
abi
l
ity
a)Hor
izont
alb)Ver
ti
cal
c)Li
neard)Nonl
i
near
5.Wi
th……….
dist
ri
but
ion,
your
epl
i
cat
edat
aacr
ossmul
ti
plenodes
a)
Peert
opeerb)Mast
er-
slav
ec)Cl
i
entser
verd)Di
str
ibut
ed
6.I
nmast
er-sl
aver
epl
i
cat
ion,
arepl
i
cat
ionpr
ocesssy
nchr
oni
zest
hesl
aveswi
tht
he……
a)Cl
i
entb)Ser
verc)Mast
erd)Peer
7.Mast
er-
slav
erepl
i
cat
ioni
smosthel
pful
forscal
i
ngwheny
ouhav
ea……….i
ntensi
ve
dat
aset
a)Wr
it
eb)Readc)Updat
ed)Del
ete
8.Repl
i
cat
ioni
smosthel
pful
forscal
i
ngwheny
ouhav
ea……….I
ntenci
vedat
aset
a)Wr
it
eb)Readc)Updat
ed)Del
ete
9.I
n………r
epl
i
cat
ional
lrepl
i
cashav
eequal
wei
ght
a)Peert
opeerb)Mast
ersl
avec)Cl
i
entser
verd)Di
str
ibut
ed
10.Bot
tl
eneckpr
obl
em ar
isesi
n…….
repl
i
cat
ion
a)Cl
i
entser
verb)Mast
ersl
avec)Peert
opeerd)Di
str
ibut
ed
11.……….
typeofconf
li
ctcanoccuri
npeert
opeerr
epl
i
cat
ion
a)Wr
it
e-wr
it
eb)Readwr
it
ec)Unr
epeat
abl
ereadd)Di
rt
yread
12.…….
typeofdat
abasesuser
epl
i
cat
ionandshar
ding
a)column-f
ami
l
ydat
abasesb)documentdat
abasesc)gr
aphdat
abasesd)r
elat
ional
databases
13.Mast
er-
slav
erepl
i
cat
ionr
educest
hechanceof
…….
conf
li
cts
a)Readb)Wr
it
ec)Updat
ed)del
ete
Consi
stency
..
1.
whi
chst
atementi
scor
rectf
rom t
hef
oll
owi
ng
a)I
nreadt
owr
it
econf
li
ctdi
ff
erentpeopl
esdel
eti
ngsamedat
ait
em atdi
ff
erentt
ime
b)I
nreadt
oreadconf
li
ctdi
ff
erentpeopl
esdel
eti
ngsamedat
ait
em atdi
ff
erentt
ime
c)I
nwr
it
etowr
it
econf
li
ctt
wopeopl
eupdat
ingt
hesamedat
ait
em att
hesamet
ime
d)I
nwr
it
etowr
it
econf
li
ctdi
ff
erentpeopl
esdel
eti
ngsamedat
ait
em atdi
ff
erentt
ime
2.A…….
appr
oachwor
ksbypr
event
ingconf
li
ctsf
rom occur
ri
ng
a)Pessi
mist
icb)Opt
imi
sti
cc)Cur
rentd)cl
i
entser
ver
3.…….
appr
oachi
nvol
vesl
ocki
ngmechani
sm
a)Pessi
mist
icb)Opt
imi
sti
cc)Cur
rentd)Cl
i
entser
ver
4.…….
.appr
oachi
nvol
vesv
ersi
oni
ng.
a)Pessi
mist
icb)Opt
imi
sti
cc)Cur
rentd)Cl
i
entser
ver
5.I
nconsi
stentr
eadi
sal
socal
l
edas…….conf
li
ct
a)Read-
readb)Read-
wri
tec)Wr
it
e-wr
it
ed)Updat
e
6.Thel
engt
hoft
imean…….
ispr
esenti
scal
l
edt
hei
nconsi
stencywi
ndow.
a)Consi
stencyb)Updat
ec)Dat
abased)I
nconsi
stency
7.I
nconsi
stencywi
ndowf
oramazonsi
mpl
eDBi
susual
l
ylesst
han……….
.
a)Hourb)Mi
nut
esc)Dayd)Second
8.I
nrepl
icat
ion,
consi
stencymeanssamedat
ait
em hast
hesamev
aluewhenr
eadf
rom
……..r
epl
i
cas.
a)di
ff
erentb)samec)oneaf
terot
herd)ev
en
9.v
ersi
onst
amps,
sti
ckysessi
onar
ethet
echni
quest
opr
ovi
de……….
.consi
stency
a)updat
eb)r
eadc)wr
it
ed)sessi
on
10.CAPt
heor
em gi
vest
het
hreepr
oper
ti
esof
…..
a)Const
ant
,Av
ail
abi
l
ity
,andPar
ti
ti
ont
oler
ance
b)Consi
stency
,Accur
ate,
andPar
ti
ti
ont
oler
ance
c)Consi
stency
,Av
ail
abi
l
ity
,andPar
ti
ti
ont
oler
ance
d)Consi
stency
,Av
ail
abi
l
ity
,andPar
ti
ti
onper
for
mance
11.NoSQLsy
stemsf
oll
owt
he
a)ACI
Db)BASEC)CAPd)ACI
ID
12.Thenumberofr
epl
i
casi
nwr
it
equor
um i
sknownas
a)r
epl
i
cat
ionuni
tb)r
epl
i
cat
ionmat
ri
xc)r
epl
i
cat
ionf
act
ord)r
epl
i
cat
ionnumber
Vi
rsi
onst
ampsandMapReduce
1.Browsingaproductcat
alog,choosi
ngabottl
eofTal
iskeratagoodpr
ice,
fil
l
ingi
ncr
edi
t
cardinf
ormati
on,andconfi
rmingt heor
derar
etheexamplesof….
.
a)Syst
em tr
ansact
ionsb)Bankt
ransact
ionsc)Busi
nesst
ransact
ionsd)Mul
ti
ple
tr
ansact
ions
2.……….
isaf
iel
dthatchangesev
eryt
imet
heunder
lyi
ngdat
aint
her
ecor
dchanges.
a)Repl
i
cat
ionf
act
orb)t
ransact
ionc)Pr
ocessst
ampd)Ver
sionst
amp
3.Count
er,
hashi
ng,
GUI
Dandt
imest
ampar
ethet
echni
quest
ocr
eat
e…….
.
a)Ver
sionst
ampsb)Ver
ti
cal
stampsc)Hor
izont
alst
andsd)Tr
ansact
ions
4.usesacombi
nat
ionofcount
erandcont
enthash.
a)Neo4j
b)MongoDBc)Rav
enDBd)CouchDB
5.…….
.i
sthesi
mpl
estf
orm ofv
ersi
onst
amp
a)Ti
mest
ampb)GUI
Dc)Count
erd)Hashi
ng
6.…….
ist
hesi
mpl
estbutpr
obl
emat
icf
orm ofv
ersi
onst
amp
a)Ti
mest
ampb)GUI
Dc)Count
erd)Hashi
ng
7.……….
.NoSQLsy
stemsi
saspeci
alf
orm ofv
ersi
onst
ampwhi
chwecal
lav
ect
orst
amp
a)peer
-t
o-peerb)Mast
er-
slav
ec)Repl
i
cat
iond)Shar
ding
8.I
nvect
orst
amp……….t
echni
quei
sused.
a)Ti
mest
ampb)GUI
Dc)Count
erd)Hashi
ng
9.Wit
h…..systems,avect
orofv
ersi
onst
ampsal
l
owsusert
odet
ectwhendi
ff
erentnodes
haveconfl
ict
ingupdat
es.
a)Cl
i
entser
veb)Cent
ral
i
zedc)Di
str
ibut
edd)Net
wor
k
10.Amapr
educepat
ter
noper
ateson…….
a)Cl
i
entb)Ser
verc)Memor
yd)Cl
ust
er
11.…………i
sapat
ter
ntoal
l
owcomput
ati
onst
obepar
all
eli
zedov
eracl
ust
er.
a)Repl
i
cat
ionb)Shar
dingc)Locki
ngd)Mapr
educe
12.…….
.vi
ewscanbeupdat
edt
hroughi
ncr
ement
almap-
reduceoper
ati
ons.
a)Mat
eri
ali
zedb)Si
mpl
ec)Compl
exd)Tr
ansact
ional
13.…….
.ar
ethet
woi
mpor
tantt
asksofMapReduceal
gor
it
hms.
a)MpReduceb)Mappi
ng,
Rel
i
abl
ec)Map,
Reduced)Map,
Rel
i
abl
e
14.…….
.numberofst
agesr
equi
redt
oper
for
m MapReduce.
a)2b)3c) d)
Par
tII
:Impl
ement
1.Akey
-val
uest
orei
sasi
mpl
e…………
a.
Linkedl
i
stb.St
ackc.Queued.Hasht
abl
e
2.……….
.i
sequi
val
entt
otabl
einRDBMS
a.Bucketb.St
ackc.Queued.Li
st
3.I
nRi
ak,
all
accesst
othedat
abasei
svi
a…….
a.f
orei
gnkeyb.secondar
ykeyc.pr
imar
ykeyd.composi
tekey
4.i
nRedi
s,aggr
egat
eisa………….
.
a.t
abl
eb.st
ruct
urec.dat
ast
ruct
ured.r
ow
5.whi
choft
hef
oll
owi
ngdat
abasesuppor
tsst
ori
ngl
i
sts,
set
sandhasht
abl
es.
a.
Riakb.Redi
sc.Hamst
erDB d.Memcached
6.Ri
akst
oreskey
sint
o…….
a.Tabl
esb.St
ruct
uresc.Bucket
sd.Pr
imar
ykey
s
7.I
nkeyv
aluedat
abases…….
.wr
it
ear
eper
for
med
a.Pessi
mist
icb.Opt
imi
sti
cc.Consi
stentd.Conf
li
ct
8.Ri
aki
sev
ent
ual
l
y……….
a.Unconsi
stentb.
Inconsi
stentc.Consi
stentd.Nev
erconsi
stent
9.I
nhowmanynumberofway
sRi
akwi
l
l………….
resol
vet
heupdat
econf
li
cts
a.2b.3c.4d.2
10.Whichoft
hef
oll
owi
ngst
atementi
scor
rectf
orr
esol
vi
ngupdat
econf
li
ctsi
ncaseofRi
ak
databases
a.ei
thert
henewestwr
it
ewi
nsandol
derwr
it
esl
oose
b.ei
thert
henewestwr
it
elooseandol
derwr
it
esl
oose
c.ei
thert
heol
derwr
it
ewi
nsandnewestwr
it
esl
oose
d.ei
thert
henewestwr
it
elooseandol
derwr
it
eswi
l
lal
sol
oose
11.I
nRi
akr
esol
vi
ngupdat
econf
li
ctsar
esetupdur
ingbucket
……
a.I
nser
ti
onb.Del
eti
onc.Updat
iond.Cr
eat
ion
12.
InRi
akt oi
mproveonwr
it
eorr
eadconf
li
cts,
usercanchanget
heal
l
owSi
bli
ngsf
lag
dur
ingbucketcr
eat
ion
a.I
nser
ti
onb.
Del
eti
onc.Updat
iond.Cr
eat
ion
13.I
nRiaktoimproveonwri
teorr
eadconf
li
cts,
usercanchanget
heal
l
owSi
bli
ngsf
lag
duri
ngbucketcr
eati
onto…….
a.t
rueb.f
alse
14.Ri
akusest
heconceptof
…….
.t
oimpl
ementt
ransact
ion
a.
Logb.Sy
stem l
ogc.Quor
um d.
Bucket
15.I
nRiak,Forexampl
en=:5(repl
i
cati
onf
actor
)w:3(numberofnodespar
ti
cipat
einwr
it
e)
thenaclustermustt
oler
atenodesbei
ngdownforwr
iteoper
ati
ons
a.4b.6 c.7 d.2
16.Ri
aksear
chal
l
owsquer
ydat
asameas………….
a.Pr
imar
yindexesb.Secondar
yindexesc.I
CAM i
ndex
ed.LUCENEi
ndex
es
17.I
nRi
akusercanuset
oCont
ent
-Ty
pei
nthe……….
requestt
ospeci
fyt
hedat
aty
pe.
a.POSTb.GET
18.
Keyv
aluedat
abasesscal
ebyusi
ng_
__t
echni
que
a.Repl
i
cat
ionb.Shar
dingc.I
ndexi
ngd.Sear
chi
ng
19.
InRiaktoensur
econsi
stencyval
ueofW (
thenumberofnodest
hewr
it
ehast
obewr
it
ten
tobef
oreiti
sconsider
edsuccessf
ul)
canbesetdur
ingbucket
……….
.
a.I
nser
ti
onb.Del
eti
onc.Updat
ingd.Cr
eat
ion
20.Documentsaresel
f-
descri
bing,
hier
archi
cal
………….
.dat
ast
ruct
ureswhi
chcanconsi
stof
maps,col
lect
ions,
andscalarval
ues.
a.t
reeb.st
ackc.queued.l
i
st
21.Tabl
einRDBMSi
sknownas………i
nMongoDB
a.Col
l
ect
ionb.Documentc.Row d.Key
22.
EachMongoDBi
nst
ancehas……….dat
abases,
andeachdat
abasecanHav
e………….
.
col
l
ecti
ons.
a.si
ngl
e,mul
ti
pleb.mul
ti
ple,
mul
ti
plec.si
ngl
e,si
ngl
edd.mul
ti
ple,
singl
e
23.Commandl
ikedb.r
unCommandgetl
ast
err
or:
1,w:
"maj
ori
ty"
})t
ell
sthedat
abasehow
str
ongist
he……neededindat
abase.
a.Dur
abi
l
ityb.At
omi
cit
yc.I
sol
ati
ond.Consi
stency
24.I
nDocumentdat
abases,
transact
ionsatt
hesi
ngl
e-documentl
evel
areknownas………….
tr
ansact
ions
a.Dur
abl
eb.Consi
stentc.I
nconsi
stentd.At
omi
c
25.……….
.suppor
tst
ransact
ionsacr
ossmul
ti
pleoper
ati
ons
a.MongoDB b.Rav
enDB c.Or
ient
DB d.CouchDB
26.Documentdat
abasest
ryt
oimpr
oveonav
ail
abi
l
itybyr
epl
i
cat
ingdat
ausi
ngt
he………….
techni
que.
a.Peert
opeerb.Mast
er-
slav
e
27.……….
documentdat
abaseal
l
owsusert
oquer
ythedat
abasebyv
iews
a.CouchDB b.Rav
enDB c.Or
ient
DB d.MongoDB
28.CouchDBdocumentdat
abaseal
l
owsusert
oquer
ythedat
abaseby
a.Tr
ansact
ionb.Roesc.t
abl
esd.v
iews
29.Documentdat
abasesscal
ebyusi
ng…….
techni
que
a.Repl
i
cat
ionb.Shar
dingc.I
ndex
ingd.Sear
chi
ng
30.Whi
cht
ypeofi
ndexesMongoDBdoesnotsuppor
t?
a.Compoundi
ndexesb.Mul
ti
keyi
ndex
esc.Geospat
ial
indexesd.Lucenei
ndexes
31.…….
aggregat
ionopti
onisusedtospeci
fyt
hespeci
fi
cfi
eldst
hatneedst
obepassedt
o
thenextst
ageoftheaggregat
ionpi
pel
ine
a.$pr
ojectb.$mat
chc.$gr
oupd.$aggr
egat
e.
32.Whi
choft
hef
oll
owi
ngl
anguagei
sMongoDBwr
it
teni
n?
a.C,
CPP,Jav
aScr
iptb.Py
thon,
DOTNET c.PERL,
Gopr
ogr
ammi
ng d.Vi
sual
Basi
c,
DOTNET
33.Acol
l
ect
ionanddocumenti
nMongoDBi
ssameas…………i
nRDBMS
a.
Tabl
eandcol
umnb.Tabl
eandr
ow c.Col
umnandr
ow d.Tabl
eandcur
sor
34.Neo4j
is……t
ypeofdat
abase
a.Documentb.Col
umnc.Cent
ral
i
zedd.Gr
aph
35.
Neo4j
isdev
elopedi
n…….
.l
anguage
a.Py
thonb.CPP C.C d.Jav
a&Scal
a
36.CQLst
andsf
or
a.CypherQueryLanguageb.Cy
pherQui
ckLanguagec.Cr
eat
eQuer
yLanguaged.
Cret
e
QuickLanguage
37..
..
..cl
ausei
susedt
odel
etenodes,
rel
ati
onshi
psi
nNeo4j
.
a.Cr
eat
eb.I
nser
tc.Del
eted.
updat
e
38.Neo4j
suppor
ts…….
.pr
oper
ti
es
a.BASEb.ACI
ID c.ACI
D d.Rul
ebased
39.Anyt
wonodescanber
elat
edbymaki
ng…….
.bet
weent
wonodes
a.i
ndexb.r
owc.ar
rowd.r
elat
ionshi
p
40.
Nodesi
nNeo4j
arecal
l
edas….
.
a.
Ent
it
iesb.Rowsc.Tabl
esd.Gr
aphs
41.Theuseofcl
ausei
stogetdat
aaboutpr
oper
ti
esandnodesf
rom t
hedat
abase
a.Mat
chb.Cr
eat
ec.Sear
chd.
[]
42.………Sy
mbol
isusedt
ocr
eat
erel
ati
onshi
psi
nNeo4j
a.(
)b.{
}c.[
]d.<>
43.I
faisthesour
cenodeandbi st
hedesti
nat
ionnodet
henfol
l
owi
ngwhi
chcommandi
s
corr
ectt
ocreater
elat
ionshi
pbet
weenDist
rtwonodesaandb?
a.[
]a-
>[]
bb.[
a]-
[:
Rel
ati
onshi
p]-
>(b)c.[
a]-
[:
Rel
ati
onshi
p]-
>(b)d.[
b]-
[:
Rel
ati
onshi
p]-
>(a)
44.The…….
.commandi
susedt
otr
ansf
orm anyl
i
stbacki
ntoi
ndi
vi
dual
rows.
a.Mat
chb.Cr
eat
ec.Rel
ated.Unwi
nd

Final MCQ DT

Uploaded by

Copyright:

Available Formats

Final MCQ DT

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Final MCQ DT

Uploaded by

Copyright:

Available Formats

Seat No -

Total number of questions : 60

1000218_T1 DATABASE TECHNOLOGIES

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

4) Each question carries 1 Mark.

5) Specially abled students are allowed 20 minutes extra for examination.

6) Do not use pencils to darken answer.

8) No change will be allowed once the answer is marked on OMR Sheet.

9) Rough work shall not be done on OMR sheet or on question paper.

10) Darken ONLY ONE CIRCLE for each answer.

Q.no 2. The number of replicas is often called the _______

B : object oriented technology

D : procedure oriented technology

Q.no 4. When is it best to use a NoSQL database?

A : When providing conﬁdentiality, integrity, and availability is crucial

B : When the data is predictable

C : When dealing with large data sets.

D : When high level of consistency is needed.

Q.no 6. Polyglot persistence can apply across ______

B : within a single application

Q.no 8. Document database is most suitable for

A : Storing Session Information

B : User Proﬁles, Preferences

C : Content Management Systems

D : Shopping Cart Data

Q.no 9. Which is not column family stores?

Q.no 10. ___________________ is an aggregate ignorant data model

B : Key Value Database

Q.no 11. NoSQL databases are most often referred to as:

Q.no 12. The ﬁrst stage of map-reduce is

Q.no 13. ______ is not the property in CAP theorem

Q.no 14. XML databases can also be called as _____

Q.no 17. Replication comes with an inevitable dark side _______

Q.no 18. To provide high availability and data consistency, in a production

A : Shopping Cart Data

B : Storing Session Information

C : Relationships among Data

Q.no 22. Key-Value database is useful for

D : Storing Session Information

Q.no 24. What it is an aggregate model?

B : Collection of related objects that we wish to treat as a unit

C : It captures set of values

D : Model that takes tuple as input and returns tuple as output

A : Key / Value based

Q.no 26. A vector stamp is

Q.no 27. NoSQL supports ____________.

B : Horizontal scaling, simple design, ﬁne controlled availability

C : Vertical scaling, simple design, ﬁne controlled availability

D : Vertical scaling, simple design, low control availability

Q.no 30. Term database in RDBMS is equivalent to term _______ in Cassandra

A : Web Analytics or Real-Time Analytics

D : Queries against Varying Aggregate Structure

Q.no 37. MongoDB implements replication, providing high availability using

Q.no 40. Graph databases are

Q.no 42. Which of the following is not a type of consistency in NoSQL?

A : rapid acess to lots of data

B : rapid access to few data

C : rapid access to application functionalities