A two-dimensional array A of 4-byte integers is stored in row-major order starting at address 1000, with indices starting at 0. What is the address of A?
Correct answer C. 1260
Subject / 421 questions
Programming MCQs
Page 5 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 5 of 22
A two-dimensional array A of 4-byte elements is stored in column-major order starting at address 1000, with indices starting at 0. What is the address of A?
Correct answer A. 1212
An array A of 2-byte elements is stored in row-major order with base address 200, and indices start at 1. What is the address of A?
Correct answer B. 218
Advertisement
What is the worst-case time complexity of inserting an element at the beginning of an array that holds n elements and has spare capacity?
Correct answer C. O(n)
What is the average time complexity of deleting an element from a random position in an array while keeping the remaining elements contiguous?
Correct answer B. O(n)
Why does a dynamic array such as C++ std::vector achieve amortised O(1) time for appending elements?
Correct answer C. It grows its capacity geometrically, so expensive reallocations happen rarely
In a singly linked list, what does each node contain?
Correct answer C. Data and a pointer to the next node
What is the time complexity of inserting a new node at the head of a singly linked list?
Correct answer D. O(1)
Given a pointer to a node in a doubly linked list, what is the time complexity of deleting that node?
Correct answer D. O(1)
Advertisement
In a circular singly linked list, what does the last node point to?
Correct answer D. The first node
In a B+ tree, what is the minimum occupancy rule for every node other than the root?
Correct answer B. It must be at least half full
How many clustered indexes can a single table have in SQL Server, and why?
Correct answer D. One, because the clustered index defines the physical order of the data rows
A column has a hash index and a B-tree index available. Which query condition can use the B-tree index but not the hash index?
Correct answer B. WHERE salary BETWEEN 3000 AND 5000
Why must a secondary index, built on a key that is not the file’s sort order, be a dense index?
Correct answer C. Because the records are not sorted on that key, so every key value needs its own index entry
A money transfer debits one account, and the system crashes before the matching credit is applied. Which ACID property requires that the debit be undone?
Correct answer A. Atomicity
Advertisement
A bank transfer commits and the customer is told it succeeded. Seconds later the server loses power. After restart the transfer is still recorded. Which ACID property guarantees this?
Correct answer D. Durability
In the transaction state model, what is the state of a transaction after its final statement has executed but before its commit has completed?
Correct answer B. Partially committed
Which SQL isolation level is the lowest one that prevents dirty reads, meaning reading data written by a transaction that has not yet committed?
Correct answer B. Read Committed
Which pair of operations from two different transactions T1 and T2 does NOT conflict?
Correct answer B. R1(X) and R2(X)
Schedule S is R1(A), W2(A), R2(B), W1(B). What does its precedence graph show?
Correct answer B. Edges T1 -> T2 and T2 -> T1, so S is not conflict serializable