i
Synopsys
Filter interviews by
I applied via Referral and was interviewed before Aug 2020. There were 4 interview rounds.
The left view of a binary tree shows the nodes that are visible when the tree is viewed from the left side.
Traverse the tree recursively from left to right
Print the first node encountered at each level
Example: For tree with root node A, left view is A, B, D, G
C++ is an extension of C with object-oriented programming features.
C++ supports classes and objects while C does not.
C++ has better support for polymorphism and inheritance.
C++ has a standard template library (STL) for data structures and algorithms.
C++ allows function overloading while C does not.
C++ has exception handling while C does not.
To find the middle of a linked list, use two pointers - one moving at twice the speed of the other.
Use two pointers - slow and fast
Slow pointer moves one node at a time, fast pointer moves two nodes at a time
When fast pointer reaches the end, slow pointer will be at the middle
Semaphores, OSI layers, deadlock and ACID protocols in DBMS
Semaphores are used for process synchronization and communication
OSI model has 7 layers: Physical, Data Link, Network, Transport, Session, Presentation, Application
Deadlock protocols prevent processes from entering a deadlock state
ACID protocols ensure database transactions are reliable and consistent
Boundary traversal of a binary tree is the process of visiting the nodes on the boundary of the tree.
Start with the root node and traverse the left boundary nodes from top to bottom.
Traverse the leaf nodes from left to right.
Traverse the right boundary nodes from bottom to top.
Exclude the leaf nodes that are already traversed in the second step.
Repeat the above steps for all the subtrees of the binary tree.
Linear data structures have a sequential arrangement of elements while non-linear data structures have a hierarchical arrangement.
Linear data structures have a fixed number of elements and are easy to traverse.
Non-linear data structures have an arbitrary number of elements and are difficult to traverse.
Arrays, linked lists, and stacks are examples of linear data structures.
Trees, graphs, and heaps are examples of non-l
Steps for client server connection request.
Client sends a connection request to the server.
Server receives the request and sends a response.
Client receives the response and establishes a connection.
Connection is maintained until terminated by either party.
Producer and consumer problem is a synchronization problem in computer science where multiple processes share a common resource.
It occurs when multiple processes try to access a shared resource simultaneously.
The producer produces data and the consumer consumes it.
The problem is to ensure that the producer does not produce data when the buffer is full and the consumer does not consume data when the buffer is empty.
Exam...
Processes are independent programs while threads are lightweight processes within a program.
Processes have their own memory space while threads share memory space.
Processes communicate through inter-process communication while threads communicate directly.
Processes are slower to create and terminate than threads.
Examples of processes are web browsers, word processors, etc. while examples of threads are spell checkers,
Top trending discussions
posted on 5 Dec 2017
I applied via Campus Placement and was interviewed in Dec 2017. There was 0 interview round.
I applied via Approached by Company and was interviewed before Apr 2022. There were 2 interview rounds.
Basic programming and Algorithms. data structures theory and implementation
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
Use bitwise operations to count the set bits in each number from 1 to N.
Keep track of the total set bits and return the result modulo 1e9+7.
Optimize the solution to handle large values of N efficiently.
Consider using dynamic programming or precomputing values for faster computation.
Round duration - 30 mins
Round difficulty - Easy
This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?
Tip 1 : Do participate in all the coding contests, long challenges held by codechef, codeforces
Tip 2 : Practice all kinds of problems on leetcode, gfg, coding ninjas
Tip 3 : When you are writing a written exam for a particular company, make sure you get to know about the company in detail.
Tip 1 : Make your resume short and sweet(mostly 1 page, max 2 pages) is preferred.
Tip 2 : Make sure your resume is crisp rather than descriptive
Tip 3 : Do not lie on your resume
posted on 10 Jan 2024
I applied via LinkedIn and was interviewed in Jul 2023. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
UDP is preferred over TCP in this project due to its low latency and lightweight nature.
UDP is a connectionless protocol, which means it does not establish a direct connection between the sender and receiver.
UDP is faster than TCP as it does not have the overhead of establishing and maintaining a connection.
UDP is suitable for applications where real-time data transmission is crucial, such as video streaming or online ...
To clear the 7th bit in a 32-bit register, perform a bitwise AND operation with a mask that has all bits set to 1 except the 7th bit.
Create a mask with the 7th bit set to 0 and all other bits set to 1
Perform a bitwise AND operation between the register and the mask
Store the result back in the register
I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.
Phases of compiler include lexical analysis, syntax analysis, semantic analysis, code generation, and optimization.
Lexical analysis: breaking down input into tokens
Syntax analysis: checking if tokens form valid syntax
Semantic analysis: checking if syntax is semantically correct
Code generation: generating machine code from input
Optimization: improving generated code performance
C is preferred over C++ for certain applications due to its simplicity and efficiency.
C is a simpler language compared to C++ and has a smaller runtime footprint.
C is often used for low-level programming, embedded systems, and operating systems.
C allows for more control over memory management and can be faster in certain scenarios.
C++ introduces additional features like object-oriented programming and templates, which
Classes are blueprints for creating objects, while structures are similar but with different default access levels.
Classes and structures are used to define the structure and behavior of objects in object-oriented programming.
Classes are reference types and are allocated on the heap, while structures are value types and are allocated on the stack.
Memory allocation for classes is managed by garbage collection, while mem...
I appeared for an interview before May 2016.
R&D Engineer
159
salaries
| ₹7.1 L/yr - ₹27.7 L/yr |
Staff Engineer
109
salaries
| ₹22 L/yr - ₹54.2 L/yr |
Senior R&D Engineer
103
salaries
| ₹15 L/yr - ₹40 L/yr |
Applications Engineer
62
salaries
| ₹10 L/yr - ₹25.6 L/yr |
Security Consultant
62
salaries
| ₹5.8 L/yr - ₹21.1 L/yr |
Intel
Apar Industries
TDK India Private Limited
Molex