Google News
logo
Hazelcast - Quiz(MCQ)

Hazelcast : Hazelcast is a unified real-time data platform based on Java that combines a fast data store with stream processing. It is also the name of the company developing the product. The Hazelcast company is funded by venture capital and headquartered in Palo Alto, California.

In a Hazelcast grid, data is evenly distributed among the nodes of a computer cluster, allowing for horizontal scaling of processing and available storage. Backups are also distributed among nodes to protect against failure of any single node. Hazelcast provides central, predictable scaling of applications through in-memory access to frequently used data and across an elastically scalable data grid. These techniques reduce the query load on databases and improve speed.

A)
A file system
B)
In-memory data grid
C)
An operating system
D)
A database management system

Correct Answer :   In-memory data grid


Explanation : Hazelcast is an open-source, distributed, in-memory data grid designed for high availability and scalability.

A)
Java and C#
B)
PHP and Perl
C)
SQL and Power BI
D)
Python and Ruby

Correct Answer :   Java and C#


Explanation : Hazelcast is primarily written in Java and provides client libraries for C#.

A)
Yes
B)
No
C)
Can Not Say
D)
None of the above

Correct Answer :   Yes


Explanation : Yes, Hazelcast is open-source.

A)
Hazelcast is a centralized cache.
B)
Hazelcast is a distributed cache.
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Hazelcast is a distributed cache.


Explanation : Hazelcast is a distributed cache.

A)
Increased security
B)
Enhanced data visualization
C)
Reduced network traffic
D)
Improved database performance

Correct Answer :   Reduced network traffic


Explanation : Hazelcast’s distributed caching reduces network traffic by keeping frequently accessed data in memory, reducing the need to access the database.

A)
Set
B)
Map
C)
Queue
D)
Tree

Correct Answer :   Tree


Explanation : Hazelcast supports Map, Queue, and Set data structures, but not Tree.

A)
True
B)
False
C)
Can Not Say
D)
None of the above

Correct Answer :   True


Explanation : Hazelcast can be operated in isolation (as a single node) or in cluster mode (as numerous nodes).

A)
XML-based Configuration
B)
Programmatic Configuration
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Both (A) and (B)


Explanation : Hazelcast offers both programmatic and XML-based configurations.

A)
To improve caching
B)
To improve security
C)
To avoid dependencies
D)
All of the above

Correct Answer :   To avoid dependencies


Explanation : To eliminate dependencies, Hazelcast employs JDK-based logging by default.

A)
Object service gateway initiated
B)
Open service gateway initiative
C)
Object source gateway initialized
D)
None of the above

Correct Answer :   Open service gateway initiative


Explanation : OSGI stands for open-service gateway initiative.

A)
Java Serialization
B)
Custom Serializers
C)
Hazelcast JSON Serialization
D)
Hazelcast Portable Serialization

Correct Answer :   Java Serialization


Explanation : Java Serialization is the default serialization in Hazelcast.

A)
True
B)
False
C)
Can Not Say
D)
None of the above

Correct Answer :   True


Explanation : True, Partial start means that the cluster starts with an incomplete member set.

A)
Clear client
B)
Smart client
C)
Unisocket client
D)
None of the above

Correct Answer :   Unisocket client


Explanation : A Hazelcast client that connects to a single member of a Hazelcast cluster is known as a unisocket client.

A)
Clear client
B)
Smart client
C)
Unisocket client
D)
None of the above

Correct Answer :   Smart client


Explanation : A smart client is a Hazelcast client that connects to a Hazelcast cluster using a known set of cluster members' addresses.

A)
50 nodes
B)
100 nodes
C)
200 nodes
D)
Unlimited

Correct Answer :   Unlimited


Explanation : Hazelcast can support an unlimited number of nodes in a cluster, depending on the resources available.

16 .
In Hazelcast, which of the following data types is a distributed data structure that may hold many values for a single key?
A)
List
B)
RingBuffer
C)
MultiMap
D)
ReplicatedMap

Correct Answer :   MultiMap


Explaination : In Hazelcast, Multimap data types are a distributed data structure that may hold many values for a single key.

A)
2
B)
3
C)
4
D)
5

Correct Answer :   2


Explanation : In terms of partitioning strategies, Hazelcast has two sorts of distributed objects:

* Partitioned Data structure
* Non-partitioned Data structure

A)
Partitioned data structures are those in which a single partition stores the whole instance.
B)
Partitioned data structures are data structures in which each partition holds a portion of the instance.
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Partitioned data structures are data structures in which each partition holds a portion of the instance.


Explanation : Partitioned data structures are data structures in which each partition holds a portion of the instance.

A)
Partitioned Data structures
B)
Non-partitioned Data structures
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Partitioned Data structures


Explanation : The following are the partitioned Hazelcast data structures :

* Map
* MultiMap
* Cache (Hazelcast JCache implementation)
* Event Journal

A)
Full start
B)
Partial start
C)
Force start
D)
All of the above

Correct Answer :   Force start


Explanation : "Force start" implies that the cluster will be started even if not all members are present or accessible.

A)
To provide security for the cluster
B)
To manage the data in the cache
C)
To distribute the data across the cluster
D)
To manage the nodes in the cluster

Correct Answer :   To manage the nodes in the cluster


Explanation : The Hazelcast cluster manager is responsible for managing the nodes in the cluster, including adding and removing nodes as needed.

A)
Random
B)
LRU (Least Recently Used)
C)
FIFO (First In First Out)
D)
LFU (Least Frequently Used)

Correct Answer :   LRU (Least Recently Used)


Explanation : Hazelcast’s default eviction policy is LRU, which removes the least recently used items from the cache when it reaches its maximum size.

A)
There is no difference between the two interfaces.
B)
IMap is a key-value store, while ICache is a data structure.
C)
ICache provides more advanced caching features than IMap.
D)
IMap provides a distributed cache, while ICache provides a distributed map.

Correct Answer :   IMap is a key-value store, while ICache is a data structure.


Explanation : IMap is a distributed key-value store, while ICache is a distributed data structure that provides caching functionality.

A)
IExecutorService and IMap are the same interface with different names.
B)
IExecutorService provides a distributed key-value store, while IMap is a distributed thread pool.
C)
IExecutorService provides a distributed thread pool, while IMap is a distributed key-value store.
D)
None of the above.

Correct Answer :   IExecutorService provides a distributed thread pool, while IMap is a distributed key-value store.


Explanation : IExecutorService provides a distributed thread pool, allowing the execution of tasks across a Hazelcast cluster, while IMap provides a distributed key-value store.

A)
Non-Partitioned data structures are those in which a single partition stores the whole instance.
B)
Non-Partitioned data structures are data structures in which each partition holds a portion of the instance.
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Non-Partitioned data structures are those in which a single partition stores the whole instance.


Explanation : Non-partitioned data structures are those in which a single partition stores the whole instance.

A)
Partitioned Data structures
B)
Non-partitioned Data structures
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Non-partitioned Data structures


Explanation : The following are the Non-partitioned Hazelcast data structures :

* Queue
* Set
* List
* Ringbuffer
* FencedLock
* ISemaphore
* IAtomicLong
* IAtomicReference
* FlakeIdGenerator
* ICountdownLatch
* Cardinality Estimator
* PN Counter

A)
End
B)
Finish
C)
Delete
D)
Destroy

Correct Answer :   Destroy


Explanation : You can use the destroy method to destroy a Hazelcast distributed object.

A)
Round-robin allocation strategy
B)
NUMA-aware allocation strategy
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Round-robin allocation strategy


Explanation : The round-robin allocation strategy is the default allocation strategy in Hazelcast.

A)
1
B)
2
C)
3
D)
4

Correct Answer :   2


Explanation : Hazelcast supports two allocation strategies:

* Round-robin allocation strategy
* NUMA-aware allocation strategy

A)
LRU
B)
LFU
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Both (A) and (B)


Explanation : Hazelcast JCache has two well-known eviction policies: LRU and LFU.

A)
Deadlock detection
B)
Automatic lock expiration
C)
Support for both pessimistic and optimistic locking
D)
All of the above

Correct Answer :   All of the above


Explanation : Hazelcast’s distributed locking system supports automatic lock expiration, both pessimistic and optimistic locking, and deadlock detection.

A)
To monitor the cluster’s health
B)
To synchronize data across the cluster
C)
To allow nodes to communicate with each other
D)
To provide real-time notifications of data changes

Correct Answer :   To provide real-time notifications of data changes


Explanation : The Hazelcast event system provides real-time notifications of data changes across the cluster, allowing applications to react immediately to changes.

A)
To synchronize data between clusters
B)
To provide high availability for the cluster
C)
To distribute data across the cluster
D)
To provide real-time notifications of data changes

Correct Answer :   To synchronize data between clusters


Explanation : Hazelcast’s WAN replication allows data to be synchronized between geographically distributed clusters, providing improved availability and disaster recovery capabilities.

A)
To provide full-text search capabilities
B)
To allow SQL queries to be run on the data
C)
To provide filtering and aggregation capabilities
D)
All of the above

Correct Answer :   All of the above


Explanation : Hazelcast’s query system allows SQL queries to be run on the data, provides full-text search capabilities, and supports filtering and aggregation.

A)
To optimize data transmission across the network
B)
To convert data to a format that can be stored in memory
C)
To convert data between different programming languages
D)
All of the above

Correct Answer :   All of the above


Explanation : Hazelcast’s serialization system converts data to a format that can be stored in memory, converts data between different programming languages, and optimizes data transmission across the network.

A)
Get
B)
obtain
C)
getMap
D)
obtainMap

Correct Answer :   getMap


Explanation : To obtain the map, use the getMap function.

A)
Zero
B)
One
C)
Two
D)
Many

Correct Answer :   One


Explanation : By default, distributed maps have one backup.

A)
Synchronous
B)
Asynchronous
C)
Can Not Say
D)
None of the above

Correct Answer :   Synchronous


Explanation : By default, backup operations are synchronous.

A)
Synchronous
B)
Asynchronous
C)
Can Not Say
D)
None of the above

Correct Answer :   Asynchronous


Explanation : Sync backup operations have a blocking penalty, which may result in latency concerns, whereas Asynchronous backup operations do not.

A)
Yes
B)
No
C)
Can Not Say
D)
None of the above

Correct Answer :   Yes


Explanation : Backups increase memory use since they are also retained in memory.

A)
Sync
B)
Async
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Both (A) and (B)


Explanation : At the same time, a map can have both sync and async backups.

A)
5
B)
4
C)
3
D)
2

Correct Answer :   2


Explanation : Hazelcast JCache provides two different methods for cache configuration:

* declaratively: using hazelcast.xml/yaml or hazelcast-client.xml/yaml
* programmatically: the typical Hazelcast way, using the Config API

43 .
In which of the following transaction type the commit log is recorded locally, but it is transferred to another cluster member?
A)
One_phase
B)
Two_phase
C)
Three_phase
D)
None of the above

Correct Answer :   Two_phase


Explaination : In the two_phase transaction type the commit log is recorded locally, but it is transferred to another cluster member.

A)
One_phase
B)
Two_phase
C)
Can Not Say
D)
None of the above

Correct Answer :   One_phase


Explanation : It is advised that you use ONE PHASE as the transaction type if you desire greater performance, and TWO PHASE if system dependability is more essential than performance.

A)
2
B)
3
C)
4
D)
5

Correct Answer :   2


Explanation : Hazelcast support two types of transactions: One_phase and Two_phase.

A)
To replicate data across the cluster
B)
To provide a global view of the data
C)
To provide a distributed key-value store
D)
To provide synchronization between nodes

Correct Answer :   To provide a global view of the data


Explanation : Hazelcast’s Replicated Map provides a global view of the data stored across the cluster, allowing all nodes to access the same data regardless of where it is stored.

A)
To provide a distributed thread pool
B)
To allow nodes to communicate with each other
C)
To provide a distributed key-value store with caching capabilities
D)
None of the above

Correct Answer :   To provide a distributed key-value store with caching capabilities


Explanation : Hazelcast’s ICache interface provides a distributed key-value store with caching capabilities, allowing frequently accessed data to be stored in memory for improved performance.

A)
To provide a global view of the data
B)
To synchronize data across the cluster
C)
To cache frequently accessed data locally
D)
None of the above

Correct Answer :   To cache frequently accessed data locally


Explanation : Hazelcast’s Near Cache caches frequently accessed data locally, reducing the need for network traffic and improving performance.

A)
Yes
B)
No
C)
Can Not Say
D)
None of the above

Correct Answer :   No


Explanation : By default, Hazelcast maps have no size constraints and can grow indefinitely big.

A)
Eviction
B)
Expiration
C)
Both (A) and (B)
D)
None of the above

Correct Answer :   Expiration


Explanation : Expiration restricts the maximum lifespan of an entry saved inside the map.

A)
IP hash
B)
Round Robin
C)
Weighted Round robin
D)
None of the above

Correct Answer :   Round Robin


Explanation : The default load balancing mechanism is set to round-robin.

A)
Yes
B)
No
C)
Can Not Say
D)
None of the above

Correct Answer :   No


Explanation : Hazelcast clients are only used to access data held by the cluster's Hazelcast members. They are not in charge of storing data and do not claim ownership of it.

A)
Yes
B)
No
C)
Can Not Say
D)
None of the above

Correct Answer :   Yes


Explanation : Yes, Hazelcast supports JMX monitoring.

A)
1,00,000
B)
50,000
C)
10,000
D)
5,000

Correct Answer :   10,000


Explanation : A RingBuffer is configured with a capacity of 10,000 items by default.

A)
Put
B)
Enter
C)
Insert
D)
Add

Correct Answer :   Add


Explanation : You can insert an item in RingBuffer using the add method.

A)
Tail
B)
Head
C)
Can Not Say
D)
None of the above

Correct Answer :   Head


Explanation : The head of the Hazelcast RingBuffer data structure is where objects are overwritten or expired.

57 .
You can eliminate all map entries that match your condition, with the help of which of the following method?
A)
Delete ()
B)
Erase_all ()
C)
Delete_all ()
D)
RemoveAll()

Correct Answer :   RemoveAll()


Explaination : You can eliminate all map entries that match your condition, with the help of the removeAll() method.

A)
getMapStats()
B)
getLocalMapStats()
C)
getLocalMapStats()
D)
None of the above

Correct Answer :   getLocalMapStats()


Explanation : The getLocalMapStats() method will get you the statistics of maps in your Hazelcast.

A)
Queue
B)
RingBuffer
C)
MultiMap
D)
ReplicatedMap

Correct Answer :   Queue


Explanation : You can add an item to one cluster member and delete it from another by using the Hazelcast distributed queue.

A)
Priority
B)
Bounded
C)
Restricted
D)
None of the above

Correct Answer :   Priority


Explanation : A priority queue is a standard blocking queue that uses a comparator to arrange entries.

A)
Add
B)
Put
C)
Insert
D)
All of the above

Correct Answer :   Add


Explanation : To add items to the Hazelcast list, add methods is used.

A)
To provide built-in aggregation functions
B)
To provide filtering and transformation capabilities
C)
To allow custom aggregation functions to be written
D)
None of the above

Correct Answer :   To allow custom aggregation functions to be written


Explanation : Hazelcast’s Aggregator framework allows custom aggregation functions to be written, providing flexibility in how data is processed and analyzed.

A)
Automatic failover
B)
Real-time monitoring of cluster health
C)
Data replication between clusters
D)
None of the above

Correct Answer :   Real-time monitoring of cluster health


Explanation : Hazelcast's Management Center provides real-time monitoring of cluster health, making it easier to diagnose and fix issues as they arise.

A)
To provide a distributed thread pool
B)
To provide synchronization between nodes
C)
To allow nodes to communicate with each other
D)
None of the above

Correct Answer :   To provide synchronization between nodes


Explanation : Hazelcast’s ICountDownLatch interface provides synchronization between nodes, allowing tasks to be coordinated and executed in a specific order.

A)
To provide a global view of the data
B)
To synchronize data across the cluster
C)
Both (A) and (B)
D)
To monitor the health of nodes in the cluster

Correct Answer :   To monitor the health of nodes in the cluster


Explanation : Hazelcast’s Cluster Heartbeat monitors the health of nodes in the cluster, helping to ensure that the system remains available and responsive.

A)
Improved scalability
B)
Improved performance
C)
Improved fault tolerance
D)
All of the above

Correct Answer :   All of the above


Explanation : Hazelcast’s distributed messaging system can improve performance by reducing the need for network traffic, improve scalability by allowing messages to be distributed across multiple nodes, and improve fault tolerance by providing redundancy and failover capabilities.

A)
To provide synchronization between nodes
B)
To provide a distributed thread pool
C)
To allow nodes to communicate with each other
D)
None of the above

Correct Answer :   To provide synchronization between nodes


Explanation : Hazelcast’s IAtomicLong interface provides synchronization between nodes, allowing multiple nodes to access and modify a shared long value in a thread-safe manner.

A)
To provide synchronization between nodes
B)
To allow nodes to communicate with each other
C)
To provide a distributed thread pool
D)
None of the above

Correct Answer :   To provide a distributed thread pool


Explanation : Hazelcast’s IExecutorService interface provides a distributed thread pool, allowing tasks to be executed across multiple nodes in a coordinated manner.

A)
To provide a distributed thread pool
B)
To provide synchronization between nodes
C)
To allow nodes to communicate with each other
D)
None of the above

Correct Answer :   To provide synchronization between nodes


Explanation : Hazelcast’s ICondition interface provides synchronization between nodes, allowing threads to wait for a specific condition to be met before proceeding.

A)
To provide a distributed thread pool
B)
To allow nodes to communicate with each other
C)
To provide synchronization between nodes
D)
None of the above

Correct Answer :   To allow nodes to communicate with each other


Explanation : Hazelcast’s ITopic interface allows nodes to communicate with each other by publishing and subscribing to messages on a topic.

A)
Improved scalability
B)
Improved performance
C)
Improved fault tolerance
D)
All of the above

Correct Answer :   All of the above


Explanation : Hazelcast’s distributed semaphore can improve performance by reducing the need for network traffic, improve scalability by allowing multiple nodes to access a resource concurrently, and improve fault tolerance by providing redundancy and failover capabilities.

A)
Bounded
B)
Priority
C)
Restricted
D)
None of the above

Correct Answer :   Bounded


Explanation : A bounded queue is one that has a finite capacity.

A)
Serialised
B)
De serialised
C)
Can Not Say
D)
None of the above

Correct Answer :   Serialised


Explanation : Hazelcast saves queue entries in serialised form by default.

A)
They are optimized for high throughput
B)
They can only be used with Hazelcast’s IMap
C)
They are fully ACID-compliant
D)
None of the above

Correct Answer :   They are fully ACID-compliant


Explanation : Hazelcast’s distributed transactions are fully ACID-compliant, meaning they provide Atomicity, Consistency, Isolation, and Durability guarantees.

A)
ITopic
B)
IMap
C)
IQueue
D)
None of the above

Correct Answer :   IMap


Explanation : IMap is a distributed key-value store in Hazelcast that can be used for distributed caching.