Datastax Cassandra Administrator Certification Questions and Answer (Pratice Questions and Dumps)

Question-: While adding more than one node (v-nodes) to the cluster, you should always add them concurrently and use the allocation algorithm for the even distribution of token.
A. True
B. False

Answer: B
Exp: While adding multiple nodes to the cluster using the allocation algorithm, ensure that nodes are added one at a time. If nodes are added concurrently, then algorithm can assign the same tokens to different nodes.



Question-: What all are the benefits of adding new node to the Cassandra cluster?
A. It helps in increasing the data capacity
B. It helps in improving the traffic capacity
C. It will give more headroom for doing automated operation of the Cassandra
D. It helps in faster synchronization of data and increase the overall data consistency
E. It helps with more data storage

Answer: A,B,C,E

Explanation: Yes, by adding the new node to the Cassandra cluster has following advantages.
A. It helps in increasing the data capacity
B. It helps in improving the traffic capacity
C. It will give more headroom for doing automated operation of the Cassandra
D. It helps in faster synchronization of data and increase the overall data consistency
E. It helps with more data storage



Question-: It is a good practice that with the single token architecture you add one node at a time?
A. Ture
B. False

Answer: B
Exp: No with the single token architecture, you should try that you double the cluster size. While adding new nodes to the cluster. Suppose your cluster has 4 nodes and you want to increase the capacity then it is recommended that you add 4 new nodes to the cluster. So that there would be in total 8 nodes.

Related Questions

---

Question-: Please order the following in the form of read path for Cassandra?
1. Check partition key cache
2. Check Row Cache
3. Locate the data on disk using compression offset map
4. Fetch the data from SSTables on disk
5. Go directly to the compression offset map if a partition key is found in the partition key cache.
6. Check memtable.
7. Check Bloom filter.

A. 1,2,3,4,5,6,7
B. 6,2,7,1,5,3,4
C. 1,4,3,5,2,7,6
D. 1,7,2,4,5,3,6
E. 6,7,2,1,3,5,4



Question-: Which of the following statement is correct for the Bloom filter?
A. Each SSTable has an associated Bloom filter.
B. It is always sure that all SSTables identified by the Bloom Filter will have requested partition data.
C. Bloom filter is stored on heap, so that faster access is possible.
D. Bloom filter can grow up to 1-2 GB for per billion partitions.



Question-: Which of the following statements are valid?
A. Partition key cache “hit� save one seek during the write operations.
B. If a partition key is found in the Partition Key cache then, engine directly go to the compression offset map to fund the compressed block on disk that has the data.
C. If partition key is not found in the key cache, then partition summary will be checked.
D. Partition summary stores the sampling of partition index.
E. If partition keys are found in partition summary, partition index would be searched.
F. The compression offset map stores pointers to the exact location on disk where the desired partition data will be found.


Question-: LeveledCompactionStrategy (LCS) tends to cause data fragmentation with the read-intensive workloads?
A. True
B. False


Question-: As per the CAP theorem, Cassandra can be setup?
A. Highly consistent with Partition tolerance (CP)
B. Highly available and Partition Tolerance (AP)
C. Highly consistent and highly available (CA)



Question-: You have been given below information

- R = Consistency level for read operation
- W= Consistency level for the write operation
- N is the number of replicas
Which of the following would help in having highly or strong consistency level?
A. R + W >N
B. R + W = N
C. R + W < N
D. R + W >= N