Blockchain CBSA Exam Practice Test Instant Access

Question 1

Ethereum is considered to be a ______________type of blockchain.

APermissionless

BPermission Based

CHybrid

DPrivate

Answer : A

Permissionless - anyone can join Anyone can run a node, run mining software/hardware, access a wallet and write data onto and transact within the blockchain (as long as they follow the rules of the bitcoin blockchain). There is no way to censor anyone, ever, on the permissionless bitcoin blockchain.

Question 2

Which of the following would create a blockchain transaction?

AUpdating a Smart Contract

BUpdating an internal State variable

CExchanging solution tokens

DAll of the above

Answer : C

Question 3

Which of the following is considered the most popular public key encryption algorithm?

ARSA

BAES

CMD5

DPGP

Answer : D

Question 4

Which of the following is NOT a requirement of an enterprise blockchain typically?

AAppend-only distributed system of record shared across business network

BCost efficient blockchain

CTransactions are endorsed by relevant participants

DEnsuring appropriate visibility; transactions are secure, authenticated & verifiable

Answer : B

Question 5

Addresses on a blockchain are derived by a process of hashing _________.

AWallet Addresses

BPrivate Keys

CIP Addresses

DMac addresses

EPublic Keys

Answer : E

Question 6

In regards to understanding the Ethereum Virtual Machine what statement is true?

AThe EVM is extremely powerful, non-turing complete and perfect for doing computational intensive thins, because of the direct access to the graphics card.

BThe EVM is extremely powerful, turing complete and perfect for doing computational intensive things, because of the direct access to the graphics card.

CWhile the EVM is Sandboxed, it isn't as powerful as the Bitcoin network, because it's not Turing Complete

DThe EVM can't access hardware layers or anything outside a blockchain node because it's sandboxed.

Answer : D

The EVM is basically a sandboxed virtual machine running on every single node. It is Turing complete and a transaction-based state machine. The nodes reach consensus by executing all transactions. Only the miner node gets the block reward, all other nodes are just checking if the miner was ''honest''.

Question 7

The ''Nothing-at-Stake'' problem that could be realized by Proof of Stake networks would be caused by what?

AIf all of the validator nodes are taken offline

BIf validator nodes reject all transactions

CValidator nodes approving all transactions on old and new software after a hard fork occurs

DAll of the above

Answer : D

Blockchain BTA Certified Blockchain Solution Architect CBSA Exam Practice Test