20-Week Peer-Learning Schedule (Placement Preparation)

-

 

20-Week Peer-Learning Schedule (Placement Preparation)

(3 sessions per week, 60 sessions total)

Phase 1 – Foundation (Weeks 1–5)

Goal: Build basics in aptitude, programming, and communication.

Week 1

  • Mon: Orientation + Placement Roadmap (process explained)

  • Wed: Aptitude – Number Systems & Simplifications

  • Fri: Programming Basics (Intro to C/Java/Python, variables, I/O, loops)

Week 2

  • Mon: Aptitude – Percentages, Ratios & Proportions

  • Wed: Aptitude – Time, Speed & Distance

  • Fri: Programming – Functions, Arrays & Strings (practice problems)

Week 3

  • Mon: Aptitude – Time & Work, Pipes & Cisterns

  • Wed: Logical Reasoning – Seating Arrangements & Puzzles

  • Fri: OOP Basics (Class, Object, Inheritance)

Week 4

  • Mon: Aptitude – Data Interpretation (Tables, Graphs, Charts)

  • Wed: Aptitude – Average, Mixtures & Alligations

  • Fri: Data Structures – Stack & Queue

Week 5

  • Mon: Resume Building (format, keywords, common mistakes)

  • Wed: Programming – Searching & Sorting Basics (Linear, Binary, Bubble, Selection, Insertion)

  • Fri: Communication Skills Workshop (Self-introduction, clear speaking)

Phase 2 – Core CS & Intermediate Aptitude (Weeks 6–10)

Goal: Strengthen technical skills + medium-level aptitude + HR prep.

Week 6

  • Mon: Aptitude – Permutations & Combinations

  • Wed: Aptitude – Probability (basic problems)

  • Fri: Data Structures – Linked List (Singly, Doubly)

Week 7

  • Mon: DBMS – Introduction & ER Diagrams

  • Wed: DBMS – SQL Queries (SELECT, WHERE, GROUP BY, Joins)

  • Fri: DBMS – Transactions, Normalization

Week 8

  • Mon: Aptitude – Profit & Loss, Simple/Compound Interest

  • Wed: Aptitude – Logarithms & Surds

  • Fri: Data Structures – Trees (Binary Trees, Traversals)

Week 9

  • Mon: Operating Systems – Processes & Scheduling

  • Wed: Operating Systems – Memory Management, Deadlocks

  • Fri: Mock HR Interview (Tell me about yourself, Strengths/Weaknesses)

Week 10

  • Mon: Computer Networks – OSI Model, TCP/IP

  • Wed: Computer Networks – IP Addressing, Routing Basics

  • Fri: Group Discussion – Do’s & Don’ts + Practice Session

Phase 3 – Advanced CS + Interview Prep (Weeks 11–15)

Goal: Advanced problem solving, technical depth, and placement-oriented drills.

Week 11

  • Mon: Aptitude – Coding-Decoding, Series, Blood Relations

  • Wed: Aptitude – Syllogisms & Analytical Reasoning

  • Fri: Algorithms – Recursion & Divide and Conquer

Week 12

  • Mon: Algorithms – Greedy Algorithms (Activity Selection, Huffman Coding basics)

  • Wed: Algorithms – Dynamic Programming (Knapsack, Fibonacci, LIS)

  • Fri: DBMS & SQL – Advanced Queries + Case Studies

Week 13

  • Mon: Software Engineering – SDLC, Agile, Testing Concepts

  • Wed: Aptitude – Data Sufficiency & Advanced DI

  • Fri: Mock Technical Interview (Core CS + Coding)

Week 14

  • Mon: Verbal Ability – Reading Comprehension Practice

  • Wed: Verbal Ability – Error Detection & Sentence Correction

  • Fri: Communication Workshop – Handling Nervousness, Confidence Building

Week 15

  • Mon: Operating Systems – Threads, Synchronization, Virtual Memory

  • Wed: Computer Networks – Switching, Congestion, Security Basics

  • Fri: Full Coding Test Simulation (LeetCode/HackerRank style)

Phase 4 – Final Placement Drill (Weeks 16–20)

Goal: Simulate real placement tests & interviews → practice + polish.

Week 16

  • Mon: Resume Peer Review (students exchange resumes & give feedback)

  • Wed: Aptitude – Mixed Practice Test (Quant + Reasoning)

  • Fri: Coding Test – Arrays & Strings

Week 17

  • Mon: Coding Test – Linked List, Stack & Queue Problems

  • Wed: Coding Test – Trees & Graphs Problems

  • Fri: Mock GD Round (current affairs/tech topics)

Week 18

  • Mon: Aptitude Grand Test (Quant + DI + Reasoning)

  • Wed: Technical Grand Test (CS basics + coding Qs)

  • Fri: HR Round Simulation (panel style, peer feedback)

Week 19

  • Mon: Emerging Tech – AI, Data Science, Cloud, Cybersecurity (overview)

  • Wed: Mock Interview Marathon – Round 1 (students interview each other, role-play)

  • Fri: Mock Interview Marathon – Round 2 (HR + Technical mix)

Week 20

  • Mon: Final Full Placement Simulation – Written Test (Aptitude + Coding)

  • Wed: Final Full Placement Simulation – GD + HR

  • Fri: Closing Session – Feedback, Roadmap, Motivation

Execution Rules

  • Rotate student presenters → everyone teaches at least 2–3 sessions.

  • Each session = 25 min teaching + 15 min Q&A/Activity + 5 min summary.

  • Keep Google Meet/Zoom + shared docs for notes, questions, and practice problems.


==========================================================================

Comments

Post a Comment

Popular posts from this blog

Artificial Intelligence - UNIT - 1 Topic - 1 : Introduction to AI (Artificial Intelligence)

-
Image
  1.1 What is Artificial Intelligence? Definition : Artificial Intelligence (AI) is the branch of computer science that aims to create machines that can mimic human intelligence and behavior. Popular Definitions : "AI is the science and engineering of making intelligent machines." – John McCarthy (Father of AI) "AI is the study of how to make computers do things which, at the moment, people do better." – Elaine Rich 1.2 Goals of Artificial Intelligence (AI) The main goal of AI is to create machines that can think and act like humans. These systems are designed to perform tasks that usually require human intelligence. The key goals include: Thinking and Reasoning: AI should be able to solve problems and make decisions by thinking logically, just like a person would. Learning from Experience: AI systems should improve over time by learning from data and past experiences, similar to how humans learn. ...
Read more

Career Guide - B.Tech Students

-
  ✅ 1. Introduction In today’s uncertain tech world, many B.Tech students fear layoffs and job insecurity. But with the right planning and skillset, you can build a stable, high-demand career in IT. This guide will show you future-proof technologies, smart career strategies, and practical steps to follow. Whether you're in your 1st year or final year, there's a clear path to success. Let’s explore how to turn your fear into confidence and create a strong, unstoppable career in tech. 👉 Lesson: Jobs aren’t lost. Low-value skillsets are. 🔮 2. Future-Proof Technologies & Career Domains (2025–2030) These are the top domains with strong demand and future growth : Technology/Field Why It’s Hot Learning Difficulty Jobs Availability 💡 AI/ML Powers automation, LLMs, etc. High 🔥🔥🔥 🌐 Full Stack Web Dev Always in demand Medium 🔥🔥 📊 Data Science/Analytics Every industry needs insights High 🔥🔥🔥 🛡️ Cybersecurity Security threats rising Medium 🔥🔥🔥 🌍 Cloud C...
Read more

OBJECT ORIENTED PROGRAMMING THROUGH JAVA : Unit - 3 : Topic - 1 : Arrays

-
Image
1. Introduction to Arrays Definition An array in Java is a collection of variables of the same data type stored at contiguous memory locations . It allows us to store multiple values in a single variable, instead of declaring separate variables for each value. Arrays are fixed-size (the size must be defined at the time of creation). Each element in an array is accessed using an index . Array indexing in Java starts from 0 . Why Arrays? To handle large amounts of data efficiently. Easy traversal using loops. Better performance as elements are stored in continuous memory. Key features of Arrays Store Primitives and Objects: Java arrays can hold both primitive types (like int, char, boolean, etc.) and objects (like String, Integer, etc.) Contiguous Memory Allocation When we use arrays of primitive types, the elements are stored in contiguous locations. For non primitive types, references of items are stored at contiguous locations. Zero-based Indexing: The first e...
Read more