i
Ceremorphic
Filter interviews by
Designing an asynchronous FIFO involves creating a buffer with separate read and write pointers to allow for independent data transfers.
Use dual-port RAM to store data with separate read and write ports.
Implement logic to handle read and write pointer movements independently.
Include control logic to manage data flow and prevent overflow or underflow.
Consider using gray code for pointer encoding to avoid metastability i
Basic gates can be implemented using multiplexers (mux) by selecting the appropriate inputs based on the control signal.
AND gate can be implemented using a 2:1 mux with one input tied to 0 and the other input connected to the control signal.
OR gate can be implemented using a 2:1 mux with one input tied to 1 and the other input connected to the control signal.
NOT gate can be implemented using a 2:1 mux with one input ti...
This is only for freshers
A synchronous FIFO is a buffer that stores data in a first-in, first-out order with synchronized read and write operations.
The FIFO should have a read pointer and a write pointer
The read and write pointers should be synchronized to the same clock signal
When the FIFO is full, the write pointer should stop advancing
When the FIFO is empty, the read pointer should stop advancing
The FIFO should have a flag to indicate when
Ceremorphic interview questions for popular designations
I applied via Campus Placement and was interviewed before May 2023. There were 2 interview rounds.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Jan 2024. There was 1 interview round.
C Programming for strings and functions and structures
I applied via Campus Placement
posted on 17 Apr 2022
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Dec 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Nov 2020. There were 5 interview rounds.
Recursion is a programming technique where a function calls itself to solve a problem.
Recursion involves breaking down a problem into smaller sub-problems and solving them recursively.
It is important to have a base case to prevent infinite recursion.
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
A recursive function to print Fibonacci series can be written by calling th...
based on 6 interviews
Interview experience
based on 24 reviews
Rating in categories
Software Engineer
10
salaries
| ₹12 L/yr - ₹21.5 L/yr |
Senior Engineer
7
salaries
| ₹15 L/yr - ₹26 L/yr |
Machine Learning Engineer
7
salaries
| ₹13.2 L/yr - ₹20 L/yr |
Engineer
6
salaries
| ₹10 L/yr - ₹19.4 L/yr |
Digital Design Engineer
5
salaries
| ₹15 L/yr - ₹30 L/yr |
Accord Synergy
E2E Networks
Avantel
ECI Telecom