Cadence India campus loops for Software Engineer and QA / Design tracks stress C/C++ depth, OS memory concepts and resume honesty. Notes below are from public GeeksforGeeks candidate reports.
Round-wise process at a glance
Round
Typical format
What clears you
Resume shortlist
Role-fit CV screen
Relevant C++/projects (or VLSI for Design)
OA (many SWE drives)
~20 C++/Java MCQs + 2 medium coding
Correct answers you can defend later
OA answer review (reported)
F2F why you marked each answer
Confidence without guessing
Technical
OOP, DSA, DBMS, OS, C++
Depth that grows from easy to hard
Behavioural + HR
Situational workplace scenarios
Calm situational answers
Technical interview experience 1 - Software Engineer, Pune on-campus
Technical interview experience 1
Candidate profile: Software Engineer, Pune, India on-campus. Source: GeeksforGeeks Cadence SWE On-Campus.
Round 0 - Resume shortlisting
Large applicant pool filtered to role-relevant CVs first
Round 1.1 - Aptitude + coding test
20 MCQs grounded in C++ and Java fundamentals
2 coding questions, medium difficulty (GFG-practice level cited)
Round 1.2 - Face-to-face interrogation of Round 1.1 answers
Every candidate from 1.1 asked why they answered specific MCQs/coding choices
Interviewers clarify concepts when answers were wrong
Tip from candidate: only attempt questions you are 100% sure about - wrong guesses hurt later
Round 2 - Technical interview
Progressive difficulty on OOP, DSA, DBMS, OS, C++
Reported prompts: project limitations on resume; max and second-max salaries from employee table; OOP pillars; page fault and paging; segmentation; more core OS + SQL
Result: Shortlisted to final round
Round 3 - Behavioural + HR
Casual: day so far, family background
Scenario-based workplace behavioural tests
Confidence and situational handling decided internship offer in this account
Takeaways
What decided it: Accurate OA answers you can defend in person, plus OS memory (paging/segmentation) and SQL aggregates under deepening technicals
Common fail: Speed-guessing MCQs, then failing when the panel re-litigates each marked answer
How to practise: Re-solve every OA mock answer aloud; drill paging/segmentation and SQL aggregates; easy-to-hard OOP ladder
Candidate profile: C++ software developer loop (reported multi-round, Noida). Themes from GeeksforGeeks Cadence C++ experience and FreshersNow SDE write-ups.
Early rounds - Coding + C++ fundamentals
Modified array/interval problems; triplet sum variants
Singleton pattern, private constructors, inheritance and polymorphism depth
Storage classes, pointer questions
Later rounds - Puzzles + stream processing
Classic GFG-style puzzles alongside DSA
Reverse words in a stream with special-character handling without leaning on library stacks
Typical fitment with senior leadership on communication and problem-solving approach
Key takeaways: Senior Cadence C++ loops expect custom implementations and language depth beyond passing the OA once.
HR interview experience
HR interview experience
Soft close after technicals: family/day experience, workplace scenarios, creative prompts (brick uses, Titanic). Interviewers look for critical thinking and communication, not memorised scripts.
Tip: Say “I don’t know” on unfamiliar topics rather than wasting panel time - explicitly advised in the QA write-up.
Sample answers for high-frequency questions
Q. Paging vs segmentation? A. Paging: fixed-size frames/pages, simple allocation, internal fragmentation possible. Segmentation: variable logical segments (code/data/stack), matches programmer view, external fragmentation risk. Page fault = referenced page not in memory.
Q. malloc vs calloc vs new? A.malloc allocates uninitialised bytes; calloc zero-initialises and takes count×size; both need free. C++ new constructs objects, typed, uses constructors; pair with delete.
Q. Count set bits. A. Brian Kernighan: while n: n &= n-1; count++. O(number of set bits). Or hardware popcount / loop mask.
Q. Second highest salary / marks (SQL). A.SELECT MAX(marks) FROM t WHERE marks < (SELECT MAX(marks) FROM t) or ORDER BY marks DESC LIMIT 1 OFFSET 1 (dialect-dependent). Discuss NULLs and ties.
Q. Three ants on a triangle - collision probability? A. Each ant picks one of two directions independently → 2³ = 8 equally likely outcomes. No collision only if all go clockwise or all go counter-clockwise (2 cases). Collision probability = 6/8 = 3/4.
Dense prep checklist
C++ memory model: new/delete, malloc/calloc, static, volatile, vtable
These links are research inputs we used to map round structure and recurring questions - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for Cadence.
