Professional Documents
Culture Documents
Java Plan
Java Plan
Java Plan
Week 2
• Day-1, 2 & 3: java Collections : Collections, Generics and interface.
• Day 4, 5: java Collections : Iterators and Methods.
• Day – 6 : Practice : Solve available practice questions and attempt
contest 1.
Week 3
• Day-1, 2 & 3: Lambda Expressions : Lambda Expressions, methods
and Syntax.
• Day 4, 5: java Stream : Introduction, implementation, and
Applications.
• Day – 6 : Practice : Solve available practice questions.
Week 4
• Day-1, 2: ArrayList : Working, Methods and Traversal.
• Day 3, 4: LinkedList : Implementation and working. Josephus
problem.
• Day 5: Stack : Implementation, Designing, and Examples.
• Day – 6 : Practice : Solve available practice questions.
Week 5
• Day-1, 2: Queue : Reverse K items, generate numbers.
• Day 3, 4: Deque : Implementation, working, designing and sample
problems.
• Day 5: Priority Queue : Implementation, working and Sample
problems.
• Day – 6 : Practice : Solve available practice questions and attempt
contest 2.
Week 6
• Day-1, 2 & 3: HashSet and LinkedHashSet : Set Interface, HashSet
and LinkedHashSet.
• Day 4, 5: TreeSet : Introduction, implementation, and Sample
Problem.
• Day – 6 : Practice : Solve available practice questions.
Week 7
• Day-1, 2 & 3: HashMap and LinkedHashMap : Map Interface,
HashMap and LinkedHashMap.
• Day 4, 5: TreeMap : Introduction, implementation, designing and
Sample Problems.
• Day – 6 : Practice : Solve available practice questions and attempt
contest 3.
Week 8
● Day-1, 2, 3: Strings in Java : String Builder, String Buffer and
sample Problems.
● Day – 4, 5, 6: Practice : Solve all the available practice
questions of loops.
Week 9
• Day-1, 2: Java Compare & Arrays : Comparable and Comparator
interface. Array functions and Methods.
• Day 3, 4 & 5: Collections class and Sorting : Collections methods,
and sorting in Java.
• Day – 6 : Practice : Solve available practice questions and attempt
contest 4.
● Day 7 onwards: Practice Must do interview questions for
Data Structures and Algorithms.
Note 1: This is a recommended plan to complete the course, but it is the
complete discretion of the candidates to choose their way of completion of
the course depending on the availability and efficiency of the course.