CSCD 300 practice
Practice for CSCD 300, Data Structures: linked lists, stacks, queues and deques, built for exam 2. Each room is a short lesson, then questions on it, including Java you write and run, and every right answer earns XP.
To open a room, sign in first with the GitHub account you use for EWU (Sign in, at the top right).
To start, open a unit and press its Start button, or press a Start button under Midterm 1 review or Extra practice. A module you work in then shows on this page under Your paths, with your next room at the top.
Your paths
Joined paths show here, with the next room to work on at the top.
-
References, null and the node
- References, null and the nodeContinue0 of 12 right
-
The singly linked list
- The singly linked listContinue0 of 15 right
-
The doubly linked list
- The doubly linked listContinue0 of 15 right
-
-
-
-
The deque, and what each operation costs
- The deque, and what each operation costsContinue0 of 15 right
The course, in units
Zero units in the order we teach them. Open a unit to see its modules. Each module holds its rooms, and each room is a short lesson with questions.
Exam 2 review
Seven modules. See all seven modules and their rooms on one page.
Start with References, null and the node
- References, null and the nodeEvery linked structure is nodes joined by references, and every trace question starts with knowing what a reference holds.1 roomJoined
- The singly linked listA singly linked list is reached only from its head, so every operation is a walk, a relink, or both.1 roomJoined
- The doubly linked listA doubly linked list keeps a link each way, so a node can be removed knowing only itself, if the four links change in a safe order.1 roomJoined
- The circular listA circular list has no null link, so a walk must stop by coming back to where it started.1 roomJoined
- The stackA stack hands back the newest value first, and that one promise runs undo, bracket matching, postfix and every method call.1 roomJoined
- The FIFO queueA queue hands back the oldest value first, and an array can hold one without ever shifting by letting its indexes wrap around.1 roomJoined
- The deque, and what each operation costsA deque adds and removes at both ends, which makes it a stack and a queue in one, and only some structures make all four ends cheap.1 roomJoined
- References, null and the nodePath
- References, null and the nodeRoom in References, null and the node
- The singly linked listPath
- The singly linked listRoom in The singly linked list
- The doubly linked listPath
- The doubly linked listRoom in The doubly linked list
- The circular listPath
- The circular listRoom in The circular list
- The stackPath
- The stack, from undo to the call stackRoom in The stack
- The FIFO queuePath
- The FIFO queueRoom in The FIFO queue
- The deque, and what each operation costsPath
- The deque, and what each operation costsRoom in The deque, and what each operation costs
No path or room title matches. Try one word, such as loop or header.