D.E. Shaw Placement Papers: Test Pattern, Syllabus, and Questions

D.E. Shaw’s online test spans five sections in 60 minutes, with 0.25 negative marking and a dynamic programming coding problem pitched above standard campus aptitude difficulty.

The firm’s Hyderabad office handles software development and systems engineering for a global investment and technology organisation (deshaw.com/who-we-are). The test reflects that context: it is designed to identify engineers who can reason through layered, multi-step problems under time pressure, not to screen at the volume of standard IT services aptitude tests.

This guide covers the topic-wise syllabus and worked sample questions for each section. For the full selection process, including rounds, eligibility criteria, and the two technical interview rounds, see the D.E. Shaw campus recruitment guide.

D.E. Shaw Online Test at a Glance

Section	Topics covered	Character
Quantitative Aptitude	Percentages, profit and loss, time-speed-distance, boats and streams, time and work, permutations, probability, data interpretation, mixtures	Moderate to tough; multi-step
Verbal Ability	Reading comprehension, sentence completion, synonyms and antonyms, fill in the blanks	Speed-dependent
Logical Reasoning	Coding-decoding, series completion, seating arrangements, blood relations, analytical puzzles, syllogisms	Puzzle-heavy
Technical MCQs	Data structures, DBMS, OOP, operating systems, networking, algorithm complexity	GATE-adjacent depth
Coding	Dynamic programming, arrays, sorting, recursion with memoisation	1-2 problems; any language

Total test duration: 60 minutes. Negative marking: 0.25 marks deducted per incorrect answer.

Test structure, section weights, and negative marking above are compiled from campus placement paper reports across 2023 to 2026 drives; D.E. Shaw does not publish an official test specification.

The test does not permit returning to an earlier section once that section’s time is up. Candidates who have not practised full-length timed tests before sitting the actual screen tend to lose marks in the verbal section through mismanaged time rather than lack of knowledge.

Quantitative Aptitude Syllabus

Based on placement paper analysis, the quant section distributes across ten topic areas:

• Percentages and profit and loss: percentage-change scenarios layered with profit and loss
• Time, speed, and distance: boats and streams, trains, and multi-speed problems
• Time and work: two or more workers completing tasks at different rates
• Permutations and combinations: word arrangements, selection from groups, circular arrangements
• Probability: basic and conditional probability, sometimes combined with permutations
• Data interpretation: bar charts, tables, pie charts — inference questions, not just reading values
• Number systems: HCF, LCM, and divisibility rules
• Mixtures and allegations: alligation method, three-component blending problems
• Ratios and proportions: direct and inverse proportion under varied conditions
• Sequences and series: arithmetic, geometric, and mixed-ratio progressions

Most quant questions require two to three logical steps. The difficulty is closer to analytics-firm tests like the ZS Associates online test than to standard IT services aptitude screens.

Accuracy outweighs speed in this section. A wrong answer costs a quarter mark, which means attempting a 50-50 guess on a hard quant problem has a negative expected value. Target about 80 percent of questions with high confidence rather than attempting everything at low accuracy.

Logical Reasoning and Verbal Ability Syllabus

Logical Reasoning

The reasoning section emphasises analytical puzzles over pattern memorisation. Topics covered:

• Coding-decoding: letter and number substitution patterns
• Series completion: number and letter series with non-obvious rules
• Seating arrangements: linear and circular, with multiple constraints simultaneously
• Blood relations: multi-generation family trees
• Analytical puzzles: multi-variable constraint satisfaction problems
• Syllogisms: Venn diagram logic and deductive inference

The distinguishing feature of D.E. Shaw’s reasoning questions is that many puzzles have multiple constraint layers. Solving one constraint does not resolve the others. Students who have only practised series completion and coding-decoding, but not complex arrangement puzzles, typically find this section harder than the quant section.

Verbal Ability

The verbal section is the shortest in relative difficulty and the most speed-dependent. Topics:

• Reading comprehension: short passages with inference and vocabulary questions
• Sentence correction: grammatical and usage errors
• Synonyms and antonyms: context-sensitive usage, not pure definition recall
• Fill in the blanks: sentence completion with two or three blank slots
• Para jumbles: rearranging sentences into coherent paragraphs

Elimination technique and reading speed matter more here than vocabulary lists. Students with any standardised English test background (CAT verbal, IELTS) will find this section the least time-intensive of the five.

Technical MCQs: Core CS Topics

The technical section tests core CS subjects at a depth closer to GATE preparation than to standard placement aptitude. Topics:

• Data structures: arrays, linked lists, trees (BST, AVL, heap), graphs, stacks, queues — including time and space complexity for operations
• DBMS: SQL queries, normalisation (1NF through BCNF), transactions and ACID properties, indexing strategies
• Object-oriented programming: classes and objects, inheritance, polymorphism, encapsulation, method overloading versus overriding in C++ and Java
• Operating systems: process scheduling algorithms (FCFS, SJF, Round Robin, Priority), memory management (paging, segmentation), deadlock detection and prevention
• Networking: OSI model layers, TCP/IP protocol stack, common application protocols (HTTP, DNS, FTP), subnetting basics
• Algorithm complexity: Big-O analysis, best and worst case reasoning, space-time trade-offs in standard algorithms

Questions probe implementation depth, not surface definitions. Building a max-heap from an unsorted array runs in O(n) time, not O(n log n). The test distinguishes students who know the result from those who can explain why.

Coding Section: What to Expect

The coding section has one or two problems. Dynamic programming accounts for the majority of problems seen across drives.

Common problem categories:

• Longest common subsequence and longest increasing subsequence variants
• Interval DP: matrix-chain type and parenthesisation problems
• Recursion with memoisation (top-down DP)
• Array problems: missing numbers, maximum subarray, sliding window
• Sorting with custom comparators and priority queue ordering

D.E. Shaw accepts solutions in C++, Java, or Python. O(n²) brute-force solutions typically receive partial credit or fail large test cases. The test scores correctness and time-complexity efficiency.

The coding section is what separates this test from most campus aptitude screens. Candidates who have practised LeetCode medium problems across dynamic programming, arrays, and trees find the difficulty manageable. Students targeting other CS-intensive tests will find overlapping preparation value in the Texas Instruments test guide.

Worked Sample Questions

Aptitude Questions

• Q1: 139 participants played a single-elimination tournament. How many matches were played in total?
• Answer: Each match eliminates exactly one participant. To reduce 139 participants to 1 winner, 138 must be eliminated. Total matches = 138.

---

• Q2: One typist completes a task in 2 hours; another completes the same task in 3 hours. How long do they take working together?
• Step 1: Typist A’s rate = 1/2 task per hour. Typist B’s rate = 1/3 task per hour.
• Step 2: Combined rate = 1/2 + 1/3 = 5/6 task per hour.
• Step 3: Time = 1 divided by (5/6) = 6/5 hours = 1 hour 12 minutes.

---

• Q3: How many squares of all sizes are there on a standard 8x8 chessboard?
• Solution: A k-by-k square can be placed in (9 - k) ways along each dimension. Total = 8² + 7² + 6² + 5² + 4² + 3² + 2² + 1² = 64 + 49 + 36 + 25 + 16 + 9 + 4 + 1 = 204.

---

• Q4: Find the next term in the sequence: 12, 6, 6, 9, 18, ?
• Step 1: Successive multipliers: 6/12 = 0.5, 6/6 = 1, 9/6 = 1.5, 18/9 = 2. The multipliers form an arithmetic progression increasing by 0.5.
• Step 2: Next multiplier = 2.5. Next term = 18 × 2.5 = 45.

---

• Q5: Two students scored differently on an exam. Their marks differed by 9, and the higher scorer received 56% of the combined total. Find both scores.
• Step 1: Let T = combined total. Higher score = 0.56T; lower score = 0.44T.
• Step 2: Difference = 0.56T - 0.44T = 0.12T = 9, so T = 75.
• Step 3: Higher = 0.56 × 75 = 42. Lower = 42 - 9 = 33.

Coding Sample: Missing Number in Array

• Problem: An array contains N distinct numbers drawn from the range 1 to N+1 (one number is missing). Find the missing number in O(n) time and O(1) space.
• Example input: [1, 2, 4, 5, 6]
• Expected output: 3
• Step 1: For N = 5 elements drawn from 1 to 6, the expected sum by the closed-form formula (N+1)(N+2)/2 = 6 × 7 / 2 = 21.
• Step 2: Actual sum of [1, 2, 4, 5, 6] = 18.
• Step 3: Missing number = 21 - 18 = 3.

This is the canonical O(n) solution. A hash-set approach also works but uses O(n) space; expect follow-up questions in the technical interview on the space trade-off.

Preparation Priorities

A 10-to-12 week window is realistic for a fresher with a basic algorithms foundation.

• Quant: Work through timed MCQ sets from R.S. Aggarwal or Arun Sharma. Aim for 20 questions in 20 minutes as a benchmark. The Mu Sigma placement test guide covers overlapping reasoning patterns useful for both quant and logical sections.
• Reasoning: M.K. Pandey’s Analytical Reasoning is the standard reference. Prioritise multi-constraint arrangement puzzles over simple series completion.
• Technical MCQs: Galvin’s Operating Systems covers scheduling and memory management. C++ Primer for language-level syntax. GATE-level networking notes for protocols and the OSI model.
• Coding: Target 120 to 150 LeetCode medium and hard problems across dynamic programming, trees, and graphs. Practise in timed mode — the coding section has a hard cutoff.
• Off-campus: Open roles are listed year-round on the D.E. Shaw careers page. Highlight DSA project work and competitive programming activity in the resume.

The dynamic programming problem in D.E. Shaw’s coding section is not decorative. It signals the depth of algorithmic reasoning the firm values in its engineers. If you are preparing at D.E. Shaw’s coding depth, you are already thinking at the level the programme targets.