HP JBT study plan

Implement arrays, singly linked lists, stacks, and queues from scratch in your primary language and write insert/delete/traverse for each

Trace pointer manipulation in linked-list reversal and cycle detection by hand on paper before running the code

Compare time and space complexity of array versus linked-list operations and record a one-line justification for each

Solve 15 basic array and string manipulation problems without consulting solutions for more than 10 minutes each

Implement hash tables with separate chaining and open addressing, then measure collision behavior under different load factors

Implement binary search trees and heaps, and code insertion, deletion, and heapify from memory

Explain tree traversals (preorder, inorder, postorder, level-order) and predict output for a given tree without executing code

Solve 12 problems combining hash maps, stacks, and trees, writing the complexity analysis for each

Classify 20 given problems by the algorithmic pattern they require (two pointers, sliding window, divide and conquer, greedy, dynamic programming, backtracking)

Implement binary search and its boundary variants correctly, including lower bound and upper bound, and test against edge cases

Derive recurrence relations for three divide-and-conquer algorithms and solve them with the master theorem

Write a recursive and an iterative solution to the same problem and compare stack usage

Solve 10 dynamic programming problems, writing the state definition and transition before any code

Implement graph traversal (BFS and DFS) and one shortest-path algorithm, and trace them on a small graph by hand

Complete 30 quantitative aptitude questions on percentages, ratios, and time-speed-distance under a 45-minute timer

Review every wrong aptitude answer and write the correct method in one sentence

Diagram the process state transitions and describe context switching, scheduling, and deadlock conditions with a concrete example of each

Calculate average waiting time for FCFS, SJF, and round-robin on the same set of processes

Explain virtual memory, paging, and page-fault handling, and compute effective access time for a given hit ratio

Write SQL queries using joins, GROUP BY with HAVING, and subqueries against a self-created sample schema, and normalize a table to third normal form

Explain ACID properties, isolation levels, and the anomalies each level prevents, with a short example per anomaly

Describe the TCP/IP layering model and trace what happens from entering a URL to receiving the response, naming each protocol involved

Distinguish HTTP status code classes, common methods, and the purpose of DNS, DHCP, and NAT

Compute subnet ranges and host counts for at least 10 given CIDR blocks

Compare waterfall, iterative, and agile models and justify a model choice for two given project scenarios

Write test cases for a specified function covering boundary values and equivalence partitions, and classify each as unit, integration, or system

Complete 20 verbal ability items on synonyms, antonyms, and sentence correction, and record why each wrong option fails

Read two passages under time pressure and answer comprehension questions with line-level evidence

Take two full-length timed mock tests and score each domain separately to identify the weakest two

Re-solve every missed question from weeks 1 through 7 without notes and confirm the corrected method

Memorize the complexity of the 15 most common operations and data structures and self-quiz until 100 percent accurate

Build a final one-page formula and pattern sheet covering aptitude formulas, DP patterns, and SQL clause order