SKILL BENCHMARK
Java Data Structures Competency (Intermediate Level)
- 15m
- 15 questions
The Java Data Structures Competency (Intermediate Level) benchmark measures your knowledge of building and working with singly linked lists, implementing code for linked lists, and assessing time complexity using big O notation. You will be evaluated on your skills in implementing the stack and queue data structures using arrays and performing common operations on a stack and a queue. A learner who scores high on this benchmark demonstrates that they have the skills to work with singly linked lists and stack and queue data structures, and can perform basic operations using arrays on those data structures.
Topics covered
- delete a node from a linked list
- dequeue elements in a queue implemented using arrays
- enqueue elements in a queue implemented using arrays
- find all nodes less than a certain value in a linked list
- implement the pop and contains operations on a linked list
- insert a new node at a specified index
- insert a new node at the head and count the number of nodes in a singly linked list
- insert a node into a linked list
- peek into a stack implemented using arrays
- perform simple operations on a stack implemented using arrays
- perform simple operations using Is Full, Is Empty, and Size on a queue implemented using arrays
- push new elements on to a stack implemented using arrays
- recall the differences between arrays and linked lists
- search for a node with specific data in a linked list
- set up the basic structure of a singly linked list node
RECENTLY ADDED COURSES
Rating 5.0 of 9 users
(9)
