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
calculate the maximum depth of a binary treecompare the graceful and immediate shutdown of an ExecutorService instancecontrast the algorithms for shortest path in unweighted and weighted graphscreate a task to be executed within a Java thread by implementing the Runnable interfacedefine a producer task that can run concurrently with a consumer using a shared queuedefine a task to be executed within a Java thread by implementing the Runnable interfacedefine the adjacency list representation of a graphdefine the insertion sort algorithmsdefine the quick sort algorithmdefine the structure and components of a graphdescribe a multi-threaded approach to tackling multiple tasksdescribe how a binary heap data structure functionsdescribe how a graph can be represented as an adjacency matrixdescribe how an ExecutorService instance can be shut down while still allowing submitted tasks to rundescribe how lookup works in a binary search treedescribe the binary search algorithmdescribe the original binary tree and its mirrordescribe the selection sort algorithmdistinguish between the graceful and immediate shutdown of an ExecutorService instanceenable atomic operations on integer variables using an AtomicInteger objectexplain depth-first, in-order traversal in a binary treeexplain depth-first, post-order traversal in a binary treeexplain depth-first, pre-order traversal in a binary treeexplain how insertion works in a binary search treeexplain the array implementation of a binary heapexplain the bubble sort algorithmexplain the common operations to be performed on a priority queueexplain the shortest path algorithm for unweighted graphsexplain weighted graphs and their use casesexplain what is meant by the topological sorting of graph nodes
identify a sequential execution plan as well as its limitationsidentify the behavior of producer and consumer threads when working with a shared bounded bufferidentify use cases for semaphores and describe how they can be usedidentify when the shortest path to a node needs to be updatedimplement semaphores in a multi-threaded Java application where each thread is treated equallyimplement the mirroring of a binary treeintroduce a ReentrantLock in your program to enable exclusive access to a shared resourceperform operations on an adjacency matrix graphrecall the conditions under which concurrent threads could encounter a deadlock in Javarecognize directed and undirected graphs and their use casesrecognize how the maximum depth of a binary tree is calculatedrecognize how the recursive algorithm to count nodes worksrecognize how to insert and to remove works on a binary heaprecognize the behavior of producer and consumer threads when working with a shared bounded bufferrecognize the characteristics of binary treesrecognize the conditions under which concurrent threads may become deadlocked and how this can be preventedrecognize the effect of the start() method in kicking off Java threadsrecognize the effects of updates to shared variables in a multi-threaded Java applicationsrecognize the options available to monitor the execution of a task using a Future objectrecognize the situations where a race condition could occur in Javarecognize the trade-offs involved in choosing sorting algorithmssummarize breadth-first traversal in a binary treesummarize depth-first traversal in a binary treesummarize the heapify operation on a binary heapuse semaphores in a multi-threaded Java application where different threads require varying levels of permits to access a shared resourceuse the join() method to synchronize one thread with the execution of anotheruse the tryLock() method of a ReentrantLock to prevent a potentially long wait for a resourcewrite code to implement bubble sortwrite code to implement insertion sortwrite code to implement the count nodes 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: AI Developer
COURSE Final Exam: Senior Developer