Juniper Networks Pre Silicon Verification Engineer Interview Questions and Answers for Experienced

Q1. Regarding Java memory management
Add your answer

Q1. Regarding RMI process
Add your answer

Dsa and pointer and logical .

Tree and LL and graphs.

Q1. How will you solved problems
Ans. 
I approach problems methodically by breaking them down, analyzing root causes, brainstorming solutions, and testing them.
• Break down the problem into smaller, manageable parts

• Analyze the root causes of the problem

• Brainstorm potential solutions

• Test and iterate on the solutions until the problem is resolved
Answered by AI
Add your answer
Q2. How will you manage workload
Ans. 
I will manage workload by prioritizing tasks, setting realistic deadlines, delegating when necessary, and regularly reviewing progress.
• Prioritize tasks based on deadlines and importance

• Set realistic deadlines and milestones

• Delegate tasks to team members when necessary

• Regularly review progress and adjust workload as needed
Answered by AI
Add your answer

Q1. Basically related to SIP Protocol. IMS call flows . CLOUD Knowledge
Add your answer
Q2. Deployment Process IMS ARCHITECTURE LTE ARCHITECTURE
Add your answer
Q3. DIAMETER PROTOCOL SDP PROTOCOL
Add your answer

Q1. Basics concepts in dot net
Add your answer

Q1. Salary discussion only
Add your answer

Checked general aptitude

Multiple coding rounds each tougher than the last

Q1. Mostly related to Python and Kubernetes
Add your answer

Q1. Mostly related to salaries
Add your answer

Q1. Reverse linked list using the recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q2. Find max number in the linked list using stack.
Ans. 
To find max number in linked list using stack.
• Create an empty stack.

• Traverse the linked list and push each element onto the stack.

• Pop elements from the stack and compare with max value.

• Return the max value.
Answered by AI
Add your answer

Hacker rank codinv problems level medium

Q1. Coding round again D and S
Add your answer

Q1. System design tech dummies
Add your answer

Q1. Common questions , why we should hire you , achievements
Add your answer

Aptitude relates questions... It was modratley difficult

Q1. Twchnical rouns. Qas easy... Asked questions oc C and some. Projects
Add your answer
Q2. Reverse linked list using recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q3. What is difference between mutex semaphore?
Ans. 
Mutex is a locking mechanism to ensure exclusive access to a shared resource, while semaphore is a signaling mechanism to control access to a shared resource.
• Mutex allows only one thread to access the shared resource at a time, while semaphore can allow multiple threads to access the shared resource simultaneously.

• Mutex is binary, meaning it has only two states - locked and unlocked, while semaphore can have multiple s...read more
Answered by AI
Add your answer