Final Exam: Lead Developer
- 1 Video | 32s
- Includes Assessment
- Earns a Badge
Final Exam: Lead Developer will test your knowledge and application of the topics presented throughout the Lead Developer track of the Skillsoft Aspire Apprentice Developer to Journeyman Developer Journey.
WHAT YOU WILL LEARN
recognize how type parameters can be applied not only to classes, but also to specific methods inside classesdescribe important methods of the List interface and how the .addall, .removeall, and .retainall methods worktraverse a doubly linked list from the last element to the firstdescribe how the overridden version of .equals can be used to control list equality operationsdescribe the two limitations of an arrayrecognize how the @Deprecated annotation can be used to flag the instantiation of objects of deprecated classes at compile-timedemonstrate that the @SafeVarargs annotation is purely indicative and does not perform any run time or compile checksdemonstrate various relationships between base and derived classes in the presence of type parametersdescribe when you can use the .sublist method to get a part of a listdescribe how different implementations of the Set interface differ in their notions of set orderanalyze algorithms with logarithmic time complexityrecognize exactly what counts as a functional interface and what does notanalyze compiled bytecode to see how Java uses type erasure to ensure type safety and prevent code bloatdescribe how the .get, .set, .add, .indexof, and .lastindexof methods workpop elements from and peek into a stack implemented using linked listscreate a TreeSet and sort it using various custom comparatorsdifferentiate between ArrayLists and LinkedLists and the use cases where they are suitabledescribe how you can create a custom comparatoruse upper bounded wildcards to specify that a type parameter must be a sub-class of a certain typeanalyze algorithms with cubic time complexitypop elements from a stack implemented using arraysdefine a method, override it, and then mark that overridden version with the @Override annotationdequeue elements in a queue implemented using arraysuse the built-in classes in Java for queues and stacksrecognize how using type parameters can ensure both type safety and code reuserecognize what streams are and some of the methods you can invoke on themdescribe how you can iterate over lists using ListIteratorcreate a HashSet object and invoke multiple methods on it, and also correctly override the .hashCode and .equals method of the contained classrecognize the different types of sets and how they all extend the Set, Collection, and Iterable interfacesapply default values to an element in annotation and also experiment with unnamed elements
demonstrate that predicates can be used to transform one stream object into anotherchange the target policy to control exactly what code elements an annotation can be applied todemonstrate that custom objects can be keys or values in maps, but that in order to ensure that there are no duplicates you have to override the .hashCode and .equals methods of those contained objects correctlyapply terminal operations on predicatesdifferentiate between methods used to compute set union, difference, intersection, and equality operationsrecognize how the Iterable and Iterator interfaces can be accessed using loops to avoid run-time errors from going over the limits of a listdequeue elements in a queue implemented as a circular queuerecognize how maps work and that they are very similar to their set counterpartsdifferentiate between bounded and unbounded type parametersanalyze algorithms with constant time complexityinsert a new node at the head, count the number of nodes in a linked listrecognize how type parameters may exist only in the base class, or only in the derived class, or in bothdescribes the is-a relationship of an ArrayList with Collection, Iterable, and Listrecognize use-cases where a base class specifies one type parameter and the derived class specifies multiple type parametersdelete a node from a linked list and rewire the listdescribe how you can use the .copy function to take values from one list and put them in anothercount nodes and delete nodes in a circular linked listpush new elements on to the stack implemented using arraysanalyze algorithms with quadratic time complexityincorporate constraints, known as bounds, on type parametersanalyze algorithms with linear time complexityinsert a new node at the tail of the linked listapply the @Override annotation to detect typographical errors in method names at compile-time rather than at run-timesearch for a node with specific data in a linked listenumerate different scenarios in which the @SuppressWarnings annotation can be appliedpush new elements on to a stack implemented using linked listenqueue elements in a queue implemented using arraysrecognize different aspects of specifying and using type parametersenqueue elements in a queue implemented as a circular queuedescribe how varargs are defined and used
IN THIS COURSE
1.Lead Developer33sUP NEXT
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.