Cerence Intern Interview Questions and Answers

Q1. Regarding flip-flops and timers
Add your answer

Easy - Medium Leetcode

Q1. Design a ridesharing service
Ans. 
A ridesharing service connecting drivers with passengers for convenient and affordable transportation.
• Allow users to request rides through a mobile app

• Match drivers with passengers based on location and destination

• Provide estimated arrival times and fare estimates

• Implement a rating system for drivers and passengers

• Offer options for shared rides to reduce costs
Answered by AI
Add your answer

Basic aptitude , c programming, digital design

Q1. Puzzels,digital design, programming
Add your answer
Q2. Implement flip flop using mux
Ans. 
Flip flop can be implemented using a multiplexer by selecting the input based on the control signal.
• Use a 2:1 multiplexer to select between the current state and the next state

• Connect the output of the multiplexer to the input of the flip flop

• Control signal determines which input is passed through the multiplexer
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was technical round and it was held on google meet around 1 pm

Q1. Maximum Sum Rectangle
You are given an M X N matrix of integers ARR. Your task is to find the maximum sum rectangle.
Maximum sum rectangle is a rectangle with the maximum value for the sum of integers pr...read more
Ans. Brute force
In this approach, we'll try to consider each rectangle that can be formed using elements of the array. To do this we fix (X1,Y1) coordinates of starting vertex and iterate through the matrix for every pair (X2,Y2) as the coordinates of ending vertex. Now we have a rectangle with coordinates (X1,Y1), (X1,Y2), (X2,Y1) and (X2,Y2).
We'll find the sum of elements within this rectangle and compare it with MAXSUM. ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was managerial round and took place around 3 pm

Q1. Infix to Postfix
You are given a string EXP which is a valid infix expression. Convert the given infix expression to postfix expression.
Infix expression is of the form a op b. Where operator is is betwe...read more
Ans. Stack
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
1. ANS ...read more
Answered Anonymously
Add your answer