DeltaX

DeltaX Round 1 Online Technical MCQ Test – 100 Questions with

Answers

Data Structures (20 questions)

1. What is the worst-case time complexity of accessing an element in a hash table?
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
2. Which data structure uses LIFO (Last In, First Out)?
A. Queue
B. Stack
C. Linked List
D. Graph

A. ⌊log₂(N)⌋
3. What’s the height of a full binary tree with N nodes?

B. N/2

D. ⌊√N⌋
C. N–1

4. Which traversal visits the nodes in the order Left → Root → Right?
A. Preorder
B. Inorder
C. Postorder
D. Level-order
5. In a min-heap, the root is:
A. the maximum element
B. the minimum element
C. always at index 0
D. not guaranteed
6. A self-balancing BST:
A. keeps height ≤ O(log n)
B. is always skewed
C. is always full
D. never allows duplicates
7. To find the nth Fibonacci number using DP (bottom-up), the time complexity is:
A. O(2ⁿ)
B. O(n)
C. O(n log n)
D. O(log n)
8. Which data structure is ideal for implementing undo functionality?
A. Queue
B. Hash Table

BY:
coding_error1
 C. Stack
D. Heap
9. Worst-case complexity of binary search on a sorted array of size n:
A. O(log n)
B. O(n)
C. O(n log n)
D. O(1)
10. A Trie is commonly used for:
A. numeric computations
B. storing sequences
C. managing game states
D. efficient string prefix searches
11. Joining two disjoint sets is best supported by which technique?
A. Path compression
B. Depth-first search
C. Kruskal's algorithm
D. Bellman-Ford
12. What is the complexity of inserting at the end of an array-backed list (amortized)?
A. O(1)
B. O(n)
C. O(log n)
D. O(n²)
13. Which structure is best for BFS traversal?
A. Stack
B. Queue
C. Heap
D. Hash set
14. Removing the root from a max-heap takes how much time?
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
15. A circular linked list is best for:
A. FIFO queues
B. Undo-redo stacks
C. Round-robin scheduling
D. Priority queues
16. The auxiliary space for Merge Sort is:
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
17. In a skip list, average search time is:
A. O(n)
B. O(log n)
C. O(n log n)
D. O(1)
18. Which data structure supports fast deletion in the middle if you have a pointer?
A. Array
B. Single Linked List

BY:
coding_error1
 C. Doubly Linked List
D. Binary Tree
19. The amortized cost of push/pop in a dynamic array (vector) is:
A. O(n)
B. O(1)
C. O(log n)
D. O(n²)
20. What’s the complexity of searching a balanced BST (like AVL)?
A. O(n)
B. O(log n)
C. O(n log n)
D. O(1)

□ Programming & Algorithms (20 questions)

21. In Java, String s = "abc"; s += "d"; This is:
A. Mutable concat
B. Interned String
C. Using StringBuilder implicitly
D. Amortized O(n)
22. What’s the output of printf("%d", 7/2); in C?
A. 3.5
B. 3
C. 4
D. Undefined
23. nullptr in C++ replaces which old keyword?
A. null
B. NULL
C. 0
D. false
24. In Python, what's the type of (1,2,3)?
A. List
B. Tuple
C. Set
D. Dictionary
25. A stable sorting algorithm guarantees?
A. O(n²) runtime
B. Keeping equal keys’ original order
C. Using O(1) space
D. Parallel sorting
26. In C, stack memory is freed by:
A. malloc()
B. garbage collector
C. scope exit
D. free()
27. Runtime of std::sort() in C++ STL is?
A. O(n²)

BY:
coding_error1
 B. O(n log n)
C. O(n)
D. O(log n)
28. Which operator is short-circuiting in C/Java?
A. &
B. &&
C. |
D. ==
29. What does volatile in Java signal?
A. Immutable
B. Multithreading visibility
C. Never changed
D. Local storage
30. What’s returned by arr[10] in C if arr of size 5?
A. Compiler error
B. Runtime error
C. Garbage
D. Always 0
31. Which is not a valid Python keyword?
A. yield
B. with
C. future
D. async
32. Recursion: factorial has how many stack frames for n?
A. O(1)
B. O(n)
C. O(log n)
D. O(2ⁿ)
33. In C++, which is a smart pointer?
A. raw_ptr
B. managed_ptr
C. unique_ptr
D. array_ptr
34. A && B is only evaluated if:
A. A is true
B. A is false
C. B is true
D. None
35. C++ header to use stoi()?
A. <string>
B. <cstring>
C. <cstdlib>
D. <sstream>
36. In Python, list slicing a[1:5] excludes:
A. a[1]
B. a[4]
C. a[5]
D. None
37. Which algorithm is best for shortest-path in weighted graphs w/ negative edges?
A. Dijkstra

BY:
coding_error1
 B. Bellman–Ford
C. BFS
D. Prim
38. O(n!) algorithm used for?
A. Sorting
B. Traveling Salesman
C. BST
D. DFS
39. %p in printf prints:
A. INT
B. String
C. Pointer value
D. Long
40. In C, expressions ending with ; are:
A. Macros
B. Statements
C. Declarations
D. Undefined

Networking (20 questions)

41. TCP is:
A. Connectionless, unreliable
B. Connection-oriented, reliable
C. Connectionless, reliable
D. Connection-oriented, unreliable
42. Port number for HTTP?
A. 20
B. 21
C. 80
D. 443
43. What does DNS do?
A. IP → MAC
B. MAC → IP
C. Domain → IP
D. IP → Domain
44. ARP resolves:
A. MAC → IP
B. IP → MAC
C. HTTP headers
D. DNS entries
45. TCP flow control uses:
A. Windows
B. SSL
C. DNS
D. Encryption

BY:
coding_error1
46. Wi-Fi uses which frequency?
A. 2.4 GHz & 5 GHz
B. 900 MHz
C. 10 GHz
D. 60 GHz
47. Which is not a network topology?
A. Star
B. Mesh
C. Ring
D. Stack
48. A subnet mask 255.255.255.0 means:
A. /24
B. /16
C. /8
D. /32
49. SSL/TLS works at which layer?
A. Application
B. Presentation
C. Transport
D. Network
50. A collision domain is broken by:
A. Hub
B. Switch
C. Router
D. Repeater
51. DHCP is for:
A. Assigning IP
B. Securing data
C. Routing packets
D. Checking connectivity
52. POP3 uses port:
A. 25
B. 110
C. 143
D. 21
53. Ping uses which protocol?
A. TCP
B. UDP
C. ICMP
D. ARP
54. HTTP status code 404 means:
A. OK
B. Forbidden
C. Not Found
D. Server Error
55. Which is a link-layer protocol?
A. IP
B. ARP
C. DNS
D. HTTP

BY:
coding_error1
56. VPN encrypted tunnel uses:
A. HTTPS
B. SSH
C. IPSec
D. FTP
57. TTL field in IP packet prevents:
A. Security attacks
B. Packet loop
C. TCP retry
D. Port scanning
58. Ethernet frame uses which addressing?
A. IP
B. MAC
C. Port
D. URL
59. What is UDP?
A. Reliable, connectionless
B. Unreliable, connectionless
C. Reliable, connection-oriented
D. Unreliable, connection-oriented
60. SMTP port is:
A. 80
B. 23
C. 25
D. 110

□ Operating Systems (20 questions)

61. Which is not a process state?
A. Ready
B. Running
C. Passing
D. Waiting
62. Virtual memory uses:
A. Hard drive
B. Registers
C. Cache
D. None
63. Mutex used for:
A. File I/O
B. Mutual exclusion
C. Dead code
D. Networking
64. Paging avoids:
A. Thrashing
B. Deadlocks

BY:
coding_error1
 C. Pointer errors
D. Parsing
65. A zombie process is:
A. terminated, parent not waited
B. infinite loop
C. memory leak
D. blocked I/O
66. Round-robin scheduling uses time slice:
A. Fixed
B. Variable
C. Infinite
D. Zero
67. Deadlock has which condition?
A. Mutual exclusion
B. Preemption
C. Single-threading
D. Priority inversion
68. OS kernel mode is:
A. User-privileged
B. System-privileged
C. Processor mode
D. Virtual
69. Thrashing occurs when:
A. CPU idle
B. Too much paging
C. Too many threads
D. Network overflow
70. Context switch cost is due to:
A. I/O only
B. Saving registers
C. Memory swap
D. Scheduling only
71. Semaphores track:
A. Critical sections
B. Resource count
C. Recursion
D. Memory lock
72. OS that runs multiple threads:
A. Single-tasking
B. Multi-threaded
C. Batch
D. Real-time
73. Thrashing means:
A. CPU compute
B. Page swapping
C. Deadlock
D. High throughput
74. Paging page table is in:
A. Registers
B. Cache

BY:
coding_error1
 C. Main memory
D. Disk
75. In virtual memory, page fault means:
A. valid page
B. page not in RAM
C. segmentation fault
D. disk failure
76. The fork() in Unix duplicates:
A. Program
B. Process
C. Thread
D. File
77. OS allocate CPU using:
A. DNS
B. Scheduler
C. Compiler
D. Cache
78. Round Robin is:
A. Priority-based
B. Time-sharing
C. Real-time
D. Batch
79. Kernel communicates via:
A. System calls
B. Interrupts
C. Exceptions
D. All
80. Long-term scheduler selects:
A. Memory pages
B. Processes to RAM
C. CPU time
D. Disks

□ DBMS (20 questions)

81. Which is ACID property?
A. Availability
B. Isolation
C. Distribution
D. Clustering
82. Primary key is:
A. Unique identifier
B. Foreign key
C. Null column
D. Index only
83. SQL: select from students where age > 18; That’s a:
A. DML

BY:
coding_error1
 B. DDL
C. DCL
D. TCL
84. JOIN returns:
A. Union
B. Intersection
C. Cartesian result
D. Combined rows
85. Normalization’s goal:
A. Eliminate redundancy
B. Increase join ops
C. Duplicate data
D. Denormalize
86. For fast full-text queries:
A. Hash index
B. B-Tree index
C. Full-text index
D. Primary index
87. SQL: CREATE INDEX idx ON t(col); – this is:
A. DML
B. DDL
C. DCL
D. TCL
88. Deadlock in DBMS occurs with:
A. Two writers lock same row
B. No commits
C. Select queries
D. Read-only ops
89. COMMIT does:
A. Rollback
B. Save changes permanently
C. Drop table
D. Delete index
90. A foreign key ensures:
A. Uniqueness
B. Referential integrity
C. Data visibility
D. Indexing
91. Transaction rollback results in:
A. Partial commit
B. Full commit
C. Restored to last commit
D. Data loss
92. SQL: SELECT COUNT(*) uses:
A. Scalar subquery
B. Aggregate function
C. Window function
D. Join function
93. A VIEW is:
A. Stored data

BY:
coding_error1
 B. Virtual table
C. Trigger
D. Transaction
94. SQL injection prevention:
A. Direct query
B. Prepared statements
C. String concatenation
D. Dynamic SQL
95. CAP theorem:
A. Consistency, Availability, Partition tolerance
B. Cache, ACID, Partition
C. Clustering, ACID, Performance
D. Concurrency, Availability, Partition
96. Index on (A,B) helps when query filters on:
A. B only
B. A only
C. Both A and B
D. Neither
97. Normalization form that removes transitive dependency:
A. 1NF
B. 2NF
C. 3NF
D. BCNF
98. Isolation level allowing dirty reads:
A. Serializability
B. Repeatable Read
C. Read Committed
D. Read Uncommitted
99. Clustered index defines:
A. Data order in storage
B. Secondary lookup
C. Encryption
D. None
100. DBMS language to control user permissions:
A. DDL
B. DML
C. DCL
D. TCL

DeltaX Round 1 Online Technical MCQ Test – 100 Questions with Answers

✦✦ Data Structures (20 Questions)

1. C. O(n)

A. ⌊log₂(N)⌋
2. B. Stack
3.
4. B. Inorder
5. B. the minimum element

BY:
coding_error1
 6. A. keeps height ≤ O(log n)
7. B. O(n)
8. C. Stack
9. A. O(log n)
10. D. efficient string prefix searches
11. A. Path compression
12. A. O(1)
13. B. Queue
14. B. O(log n)
15. C. Round-robin scheduling
16. C. O(n)
17. B. O(log n)
18. C. Doubly Linked List
19. B. O(1)
20. B. O(log n)

✦✦ Programming & Algorithms (20 Questions)

21. D. Amortized O(n)

22. B. 3
23. B. NULL
24. B. Tuple
25. B. Keeping equal keys’ original order
26. C. scope exit
27. B. O(n log n)
28. B. &&
29. B. Multithreading visibility
30. C. Garbage
31. C. future
32. B. O(n)
33. C. unique_ptr
34. A. A is true
35. A.
36. C. a[5]
37. B. Bellman–Ford
38. B. Traveling Salesman
39. C. Pointer value
40. B. Statements

✦✦ Networking (20 Questions)

41. B. Connection-oriented, reliable

42. C. 80
43. C. Domain → IP
44. B. IP → MAC
45. A. Windows

BY:
coding_error1
 46. A. 2.4 GHz & 5 GHz
47. D. Stack
48. A. /24
49. C. Transport
50. B. Switch
51. A. Assigning IP
52. B. 110
53. C. ICMP
54. C. Not Found
55. B. ARP
56. C. IPSec
57. B. Packet loop
58. B. MAC
59. B. Unreliable, connectionless
60. C. 25

✦✦ Operating Systems (20 Questions)

61. C. Passing
62. A. Hard drive
63. B. Mutual exclusion
64. A. Thrashing
65. A. terminated, parent not waited
66. A. Fixed
67. A. Mutual exclusion
68. B. System-privileged
69. B. Too much paging
70. B. Saving registers
71. B. Resource count
72. B. Multi-threaded
73. B. Page swapping
74. C. Main memory
75. B. page not in RAM
76. B. Process
77. B. Scheduler
78. B. Time-sharing
79. D. All
80. B. Processes to RAM

✦✦ DBMS (20 Questions)

81. B. Isolation
82. A. Unique identifier
83. A. DML
84. D. Combined rows
85. A. Eliminate redundancy

BY:
coding_error1
86. C. Full-text index
87. B. DDL
88. A. Two writers lock same row
89. B. Save changes permanently
90. B. Referential integrity
91. C. Restored to last commit
92. B. Aggregate function
93. B. Virtual table
94. B. Prepared statements
95. A. Consistency, Availability, Partition tolerance
96. C. Both A and B
97. C. 3NF
98. D. Read Uncommitted
99. A. Data order in storage
100. C. DCL

BY:
coding_error1