Official Information: Syllabus, Dates, and Exam Pattern
Official 2026 LEEE Information
(Full syllabus with topic details is given in the next section.)
2025 LEEE and PGEE had common paper.
Official syllabus is given in the official site, but questions may be asked out of the “official syllabus”, like DBMS, OS, CN - which are pertaining to PGEE syllabus. At least this was the case in our LEEE exam, both LCD (CSD) and LED (ECD).
Yeah. If you qualify the first round just send them a mail telling that you want the interview to happen before or after whatever time you’re free.
The interview officially may take place anytime from 9 to 6 (but for some it happened at like 7, so it can get extended).
UGEE, LEEE and PGEE are on the same date, UGEE in the morning session and the rest in the afternoon session.
Official 2026 LEEE Syllabus (Full)
LEEE 2026 - Complete Official Syllabus
Engineering Mathematics (Common for CSE and ECE tracks)
Linear Algebra: Matrices, Rank, Determinants and its properties, Eigenvalues and Eigenvectors.
Calculus: Integration, Differentiation, Limits, Continuity and Differentiability, Convergence and Divergence of Series, Maxima and Minima, Mean value theorem, Partial Derivatives, Ordinary Differential Equations and Applications, Initial and Boundary Value Problems.
Probability (official list):
- Axiom of probability
- Cumulative density function (CDF)
- Probability density function / probability mass function (PDF/PMF)
- Moments of a random variable
- Function of random variables
- Distributions: Binomial, Bernoulli, Geometric, Poisson, Gaussian (Normal), Exponential
CSE Track - Technical Subjects:
Digital Logic: Boolean algebra, Logic gates, Combinational circuits (MUX, DEMUX, encoders, decoders, adders), Sequential circuits (flip-flops, registers, counters), Minimization (K-maps).
C Programming: Data types, operators, control structures (if-else, loops, switch), functions, recursion, pointers, arrays, strings, structures, file I/O, dynamic memory allocation.
Data Structures: Arrays, linked lists (singly, doubly, circular), stacks, queues, trees (BST, AVL, heap), graphs (BFS, DFS, shortest paths), hashing.
Basic Algorithms & Problem Solving: Sorting (bubble, insertion, selection, merge, quick, heap), searching, time and space complexity, Big-O notation, divide and conquer, dynamic programming, greedy algorithms, graph algorithms (Dijkstra, Prim, Kruskal), NP-completeness basics.
Discrete Mathematics & Probability Theory: Set theory, relations, functions, logic (propositional and predicate), proof techniques, combinatorics, graph theory (trees, cycles, paths, coloring), recurrence relations, generating functions.
Relational Databases (Functional dependencies, SQL): ER model, relational algebra, SQL (DDL, DML, DCL), functional dependencies, normalization (1NF, 2NF, 3NF, BCNF), transactions, ACID properties, indexing.
Computer Networks: OSI model, TCP/IP, IP addressing and subnetting, DNS, HTTP, routing algorithms, transport layer (TCP, UDP), network security basics.
Operating Systems: Process management, CPU scheduling, memory management (paging, segmentation, virtual memory), file systems, I/O management, synchronization (semaphores, monitors), deadlocks.
ECE Track - Technical Subjects:
Digital Logic: (same as CSE)
Circuit Theory and Networks: KVL, KCL, mesh and nodal analysis, Thevenin and Norton theorems, superposition, AC circuits, resonance, filters, two-port networks.
Electronic Devices and Circuits: PN junction, diodes (rectifiers, clippers, clampers), BJT (CE, CB, CC configurations, biasing), FET/MOSFET, op-amp circuits (inverting, non-inverting, integrator, differentiator), feedback amplifiers.
Signals and Systems: Continuous and discrete signals, LTI systems, convolution, Fourier series and transforms, sampling theorem, Z-transform, DTFT.
Probability Theory and Random Processes: Probability spaces, random variables, PDFs/CDFs, correlation, power spectral density, stationary processes.
Laplace and Fourier Transforms: Properties, inverse transforms, applications to circuit analysis and signal processing.
Communication Theory: AM, FM, PM modulation and demodulation, noise in communication systems, SNR, bandwidth, digital modulation (ASK, FSK, PSK, QAM), multiplexing (FDM, TDM).
Digital Signal Processing: DFT, FFT, FIR and IIR filter design, quantization, sampling.
—
Exam Pattern and Structure
Exam Pattern Summary
Written Examination Structure:
- Total Duration: 3 hours
- Total Questions: Approximately 80 (varies slightly by year)
- Total Marks: 160 marks
- Negative Marking: 25% (0.25 marks deducted per wrong answer for 1-mark questions)
Section 1 - General Aptitude:
- 30 questions, 60 marks
- Duration: 60 minutes
- Topics: Logical reasoning, quantitative aptitude, verbal ability, number patterns
- Quantitative (2025): Easy to medium - trains, clocks, SI/CI, geometry, etc.
- Verbal (2025): Long, confusing comprehension passages. Time crunch is real.
- Difficulty: Easy (comparable to BITSAT/NTSE level)
Section 2 - Subject Paper:
- Approximately 50-55 questions, 100 marks
- Duration: 120 minutes
- Mathematics: 10-15 questions (Linear Algebra, Calculus, Probability)
- Core Subject: 40-45 questions (CSE or ECE topics)
- Difficulty: GATE level (slightly easier than GATE)
Note on exam evolution: In 2023 and 2024, questions from DBMS, OS, and Computer Networks appeared in the CSE section even though these were listed under PGEE (not LEEE) syllabus. Since 2025, LEEE and PGEE share the same paper. Prepare all topics listed in the official CSE/ECE syllabus plus OS, DBMS, and CN.
Key Exam Facts from Community Sessions
- Maths section: 15 questions; includes Linear Algebra, Calculus, Probability, and basic DEs/Laplace. Described as “one of the easiest ways to fetch marks.” CSE core questions are roughly 2 the number of maths questions.
- Digital Logic: only 1-3 questions; safe to do a high-level overview rather than deep preparation.
- Difficulty: approximately 30-40% of GATE - easier, but GATE-level depth is still the right preparation target.
- Aptitude section is a speed test. Time management matters more than topic knowledge here. Practice pacing.
- PGEE vs. LEEE time difference: LEEE and PGEE receive the same aptitude paper, but PGEE gets 1.5 hours while LEEE gets only 1 hour. Factor this into your practice timing.
- Role of the written score: The written exam is only used to clear the cutoff for interview shortlisting. Once you are shortlisted, your interview performance alone determines whether you get in - the written score is no longer a factor. Unlike UGEE, a high written score alone cannot get you admitted.
- Coding questions: MCQ / output-prediction format; C language only.
- Mock test warning: The official IIITH mock test is useful only for interface familiarity and TCS ION calculator position practice - do not use it to gauge actual question difficulty, as it is unrepresentative.
- TCS ION calculator: Practice with it before the exam at TCS ION Calculator
Exam delivery: The exam is computer-based (CBT) conducted through TCS ION at multiple centres across many cities in India. Admit cards are released 10 days prior to the exam and will specify your assigned centre city.
Official 2025 timeline (complete):
| Event | Date |
|---|---|
| Application portal opens | 4th February 2025 |
| Application portal closes | 31st March 2025 |
| Admit cards released | 10th April 2025 |
| Entrance examination | 19th April 2025 (2:00 PM - 5:00 PM) |
| Exam results announced | 12th May 2025 |
| Interviews | 24th May 2025 (online) |
| Interview results | 4th June 2025 |
| Physical reporting to campus | 28th July 2025 |
Official 2026 timeline (as published):
| Event | Date |
|---|---|
| Application portal opens | 17th February 2026 |
| Application portal closes | 31st March 2026 |
| Admit cards released | 10 days prior to exam |
| Entrance examination | 2nd May 2026 |
| Exam results announced | 11th May 2026 |
| Interviews | 23rd May 2026 (online) |
| Interview results | 8th June 2025 |
| Physical reporting | Not yet announced |