Final Exam: Developer
- 1 Video | 32s
- Includes Assessment
- Earns a Badge
Final Exam: Developer will test your knowledge and application of the topics presented throughout the Developer track of the Skillsoft Aspire Developer to App Architect Journey.
WHAT YOU WILL LEARN
explain depth-first, in-order traversal in a binary treeexplain depth-first, pre-order traversal in a binary treesummarize depth-first traversal in a binary treeexplain what is meant by the topological sorting of graph nodesrecognize how the recursive algorithm to count nodes workswrite code to implement bubble sortcreate a task to be executed within a Java thread by implementing the Runnable interfaceimplement semaphores in a multi-threaded Java application where each thread is treated equallyuse the tryLock() method of a ReentrantLock to prevent a potentially long wait for a resourceidentify the behavior of producer and consumer threads when working with a shared bounded bufferwrite code to implement the count nodes algorithmrecognize directed and undirected graphs and their use casesdefine the adjacency list representation of a graphidentify a sequential execution plan as well as its limitationswrite code to implement insertion sortdescribe the original binary tree and its mirrordefine the insertion sort algorithmsdescribe how a graph can be represented as an adjacency matrixdescribe how an ExecutorService instance can be shut down while still allowing submitted tasks to runexplain depth-first, post-order traversal in a binary treeenable atomic operations on integer variables using an AtomicInteger objectidentify when the shortest path to a node needs to be updatedrecognize how the maximum depth of a binary tree is calculatedrecognize the behavior of producer and consumer threads when working with a shared bounded bufferexplain the array implementation of a binary heaprecognize the situations where a race condition could occur in Javause the join() method to synchronize one thread with the execution of anotherimplement the mirroring of a binary treerecognize the trade-offs involved in choosing sorting algorithmsintroduce a ReentrantLock in your program to enable exclusive access to a shared resource
recognize the options available to monitor the execution of a task using a Future objectexplain weighted graphs and their use casessummarize breadth-first traversal in a binary treecompare the graceful and immediate shutdown of an ExecutorService instancedescribe how lookup works in a binary search treerecognize the conditions under which concurrent threads may become deadlocked and how this can be preventedrecognize the characteristics of binary treescontrast the algorithms for shortest path in unweighted and weighted graphsrecall the conditions under which concurrent threads could encounter a deadlock in Javaexplain how insertion works in a binary search treerecognize the effects of updates to shared variables in a multi-threaded Java applicationsdistinguish between the graceful and immediate shutdown of an ExecutorService instanceexplain the common operations to be performed on a priority queueexplain the shortest path algorithm for unweighted graphsdescribe a multi-threaded approach to tackling multiple tasksdescribe the binary search algorithmrecognize how to insert and to remove works on a binary heapcalculate the maximum depth of a binary treeuse semaphores in a multi-threaded Java application where different threads require varying levels of permits to access a shared resourcedefine a producer task that can run concurrently with a consumer using a shared queueperform operations on an adjacency matrix graphdefine a task to be executed within a Java thread by implementing the Runnable interfaceidentify use cases for semaphores and describe how they can be usedrecognize the effect of the start() method in kicking off Java threadsdescribe how a binary heap data structure functionsexplain the bubble sort algorithmdefine the structure and components of a graphdefine the quick sort algorithmsummarize the heapify operation on a binary heapdescribe the selection sort algorithm
IN THIS COURSE
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platformDigital badges are yours to keep, forever.
YOU MIGHT ALSO LIKE
COURSE Final Exam: DevOps Developer
COURSE Final Exam: AI Developer