Siemens EDA

Role: SDE

College: Not Specified (On-Campus)

Interview Date: Not Specified (Experience published 2024-09-23)

Interview Type: On-Campus, Full-Time

Result: Selected

Difficulty: Medium (varied slightly for different people)

Rounds: 4 rounds (1 Online Assessment and 3 rounds of online Interview)

Topics Asked: Aptitude, Technical MCQs (C/C++/Java, OS, CN, OOPS, DSA), Data Structures (Graphs, Linked List, Hashmap, LRU Cache, N-ary Tree), Algorithms (Sorting - Merge, Quick, Rat in a Maze, Graph Problem, Binary Search), Operating Systems (Scheduling algorithms, Heap and Stack memory), Computer Networks (OSI Model), OOPS (Virtual Destructor, Inheritance, Diamond Problem, Interfaces, Polymorphism, Abstract Class), C++ (extern, volatile, Malloc vs Calloc vs New, delete vs free, STL, Hashmap implementation), Java (Debugging, Diamond problem, Interfaces, Static keyword), Puzzles, Project Discussion, Behavioral.

Experience:

This experience is for an SDE role on-campus at Siemens EDA, Hyderabad. The CGPA criteria were 8, but only 9+ CGPA students were shortlisted. The process involved 4 rounds: 1 Online Assessment and 3 online interviews.

Round 1: Online Assessment (HackerEarth, 1.5 hours)
This round was video and audio proctored. It consisted of 20 MCQs and 2 coding questions. 10 MCQs were from the Aptitude Section, and 10 were Technical MCQs.

• Coding Question 1: Count pairs of natural numbers with GCD equal to a given number, with a constraint of 10^5.
• Coding Question 2: A debugging question in Java.

Around 5000 students applied, and 535 were shortlisted for the OA based on CGPA and resume.

Online Interview Round 1
The interviewer started with a virtual destructor. Questions included hands-on coding and demonstrating all types of inheritance, use of `extern` and `volatile` keywords, in-depth project discussion and demonstration, scheduling algorithms in OS, OSI Model in CN (hardware layers description), types of design patterns, and how to implement LRU cache.

• Coding Question 1: Rat in a maze variation coded on notepad.
• Coding Question 2: One Graph problem on notepad.
• Coding Question 3: A number is given which is greater than 10^18, so you can't store this number in any data type. Find the last digit of its square.

At the end, the interviewer showed the candidate's OA code and asked for an explanation. The candidate answered everything in this round.

Online Interview Round 2
This round started with project discussion, including questions about why ReactJS, why MongoDB, and why JWT were used. The candidate couldn't answer the difference between the event loop of Node.js and the browser. Other topics included payment integration on websites, internal implementation of Hashmap (ordered and unordered, collision handling), and writing a code demonstrating all four pillars of OOPS, polymorphism, and abstract classes. Questions also covered `delete` vs `free` and how `try-catch` works.

Online Interview Round 3
Questions included: What are cookies? A puzzle. Diamond problem in Java. Use of interfaces. Static keyword. Difference between auto and register. Heap and stack memory. Malloc vs calloc vs new. Use cases of merge and quick sort. Create an N-ary tree node and write create/delete functions. Write a code for run-time polymorphism.

The candidate felt this round went very smoothly and was eventually selected.