# Adobe Core CS Questions with Answers

8 previously-asked core cs questions from Adobe's hiring process, each with the correct answer and a worked explanation. Written against the company's actual test pattern.

_Source: Astra (https://useastra.in). Updated 2026-09-05._

### 1. Which of the following is NOT a page replacement algorithm?

A. FIFO
B. LRU
C. Optimal
D. SJF

**Answer:** SJF

**Explanation:** FIFO, LRU, and Optimal are page replacement algorithms; SJF is a CPU scheduling algorithm.

### 2. Which normal form eliminates transitive dependency?

A. 1NF
B. 2NF
C. 3NF
D. BCNF

**Answer:** 3NF

**Explanation:** Third Normal Form removes transitive dependencies of non-key attributes.

### 3. Which relationship implies the part cannot exist without the whole?

A. Composition
B. Aggregation
C. Association
D. Inheritance

**Answer:** Composition

**Explanation:** Composition is a strong has-a relationship where the contained object cannot exist independently.

### 4. Which CPU scheduling algorithm gives the minimum average waiting time?

A. FCFS
B. SJF
C. Round Robin
D. Priority

**Answer:** SJF

**Explanation:** Shortest Job First minimises average waiting time (though it can starve long jobs).

### 5. What is the standard loopback IP address?

A. 127.0.0.1
B. 192.168.0.1
C. 0.0.0.0
D. 255.255.255.255

**Answer:** 127.0.0.1

**Explanation:** 127.0.0.1 is the loopback address that refers to the local machine.

### 6. What does a segmentation fault typically indicate?

A. Accessing invalid or protected memory
B. A syntax error
C. A division by zero
D. An empty stack

**Answer:** Accessing invalid or protected memory

**Explanation:** A segmentation fault occurs when a program accesses memory it is not allowed to, such as dereferencing a bad pointer.

### 7. Which traversal order lets you recreate the exact structure of a binary tree (with null markers)?

A. Preorder
B. Inorder
C. Postorder
D. Level order

**Answer:** Preorder

**Explanation:** Preorder (root first) with null markers uniquely reconstructs a tree; inorder alone cannot fix the root.

### 8. What is the time complexity of selection sort?

A. O(n)
B. O(n log n)
C. O(n^2)
D. O(log n)

**Answer:** O(n^2)

**Explanation:** Selection sort scans the remaining elements for the minimum each pass, giving O(n^2).

More Adobe preparation, including the full recruitment process: https://useastra.in/campus/adobe