Which of the following is a non-linear data structure?
Correct answer B. Tree
Subject / 609 questions
Programming MCQs
Page 14 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 14 of 31
Which statement best distinguishes a static data structure from a dynamic one?
Correct answer A. A static structure has a size fixed when it is created, while a dynamic one can grow or shrink at run time
What is the time complexity of accessing the element at a given index in an array?
Correct answer C. O(1)
Advertisement
If an algorithm takes 3n² + 5n + 20 steps for an input of size n, what is its Big-O complexity?
Correct answer D. O(n²)
Which growth rate is the slowest for large values of n?
Correct answer C. O(log n)
What does the space complexity of an algorithm measure?
Correct answer A. How the memory it needs grows with the input size
Which notation gives an asymptotic lower bound on an algorithm’s running time?
Correct answer B. Big-Omega (Ω)
What is the time complexity of searching for a value in an unsorted array of n elements?
Correct answer D. O(n)
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
Advertisement
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
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
Advertisement
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)
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