Verilog problems / Sequential Design
What you must build
A 4-bit stack pointer that moves up on push and down on pop, refusing to overflow past 15 or underflow past 0.
Engineers use “Push/Pop Stack Pointer” as a building block in sequential design. Interviewers ask for the same ports and the same corner cases this judge covers. Completing it in the browser is the same skill as writing synthesizable RTL at work, minus the EDA license.
if (push && !full) sp<=sp+1; else if (pop && !empty) sp<=sp-1;. Without those guards, a push at full (or pop at empty) silently wraps the pointer around — corrupting whatever memory the pointer indexes into.Port contract
The judge instantiates exactly these ports. Extra ports or a different module name fail to elaborate.
| Name | Dir | Width | Description |
|---|---|---|---|
| clk | input | 1 | Clock |
| rst | input | 1 | Sync active-high reset |
| push | input | 1 | Increment sp (ignored if full) |
| pop | input | 1 | Decrement sp (ignored if empty) |
| sp | output | 4 | Stack pointer, 0-15 |
| full | output | 1 | 1 when sp == 15 |
| empty | output | 1 | 1 when sp == 0 |
How to approach this kata
This is a medium kata: you will need sequential logic or a small FSM. Decide what is registered versus combinational before you type. Reset polarity and clock edge must match the spec; the judge will fail you on the first mismatched cycle.
Hidden tests instantiate top_module, drive the ports, and compare every sample against a golden model. They do not grade coding style. They do grade X/Z, off-by-one counters, and ignoring enables. Sign in only when you want the run saved on the leaderboard — the specification below is public.
Starter shape
Copy this skeleton into the editor (or press Reset starter). Fill the body; do not rename the module.
module top_module( input clk, input rst, input push, input pop, output reg [3:0] sp, output full, output empty ); // Your code here
Why this shows up in interviews
Push/Pop Stack Pointer sits under Sequential Design (sequential, pointer). Concept: Guard both operations against their boundary: if (push && !full) sp<=sp+1; else if (pop && !empty) sp<=sp-1; . Without those guards, a push at full (or pop at empty) silently wraps the pointer around — corrupting whatever memory the pointer indexes into.
A passing solution is synthesizable intent: no delays in the DUT, no initial blocks inside top_module, and no reference to testbench tasks. Use blocking assignments only in combinational always blocks; use non-blocking for registers clocked by clk.
Related problems
- D Flip-Flop with Asynchronous Reset — Standard D flip-flop with an active-low asynchronous reset. Reset clears q immediately, without waiting for a clock edge.
- 4-Bit Shift Register (SIPO) — Serial-in, parallel-out shift register. Each clock, shift left and load sin into the LSB. Sync active-high reset clears q.
- JK Flip-Flop — The flip-flop with no forbidden state: j=k=1 toggles instead of racing. Classic building block for counters.
- 4-Bit Up/Down Counter — A synchronous counter that increments or decrements each clock edge depending on a direction input, with a synchronous reset.
FAQ
What does this problem require?
What does the Push/Pop Stack Pointer problem ask for? A 4-bit stack pointer that moves up on push and down on pop, refusing to overflow past 15 or underflow past 0. Implement it as Verilog module top_module with the listed ports.
Combinational or sequential?
Is Push/Pop Stack Pointer combinational or sequential? Tags: sequential, pointer. Follow the clock/reset ports if they appear in the table; if there is no clock, use continuous assignment or combinational always @(*).
How does the auto-grader work?
How is Push/Pop Stack Pointer graded? A hidden SystemVerilog/Verilog testbench in the EcrioniX judge simulates your module in the browser. You pass when every directed vector matches, including the waveform contract shown on this page.