DRDO RAC Exam Details 2026

Initially, the applications received will be shortlisted for the recruitment process. The shortlisting will be done on the basis of DRDO RAC Scientist B Eligibility and GATE score. The basic eligibility criteria like nationality, age limit, and required educational qualifications will be scrutinized. The shortlisting will be done by following the 1:25 ratio. In the case of IIT and NIT graduate engineers, 80% of aggregate marks will be required in the EQ degree.

Take NIC Scientist B free mock test to brush up on your exam preparation.

The admit card will be released for the eligible candidates on the official website of DRDO RAC. The candidates will be intimated regarding their shortlisting and admit card via SMS. The descriptive paper will follow a similar pattern and difficulty level as that of the UPSC ESE/IES Mains Examination. Accordingly, the descriptive paper will be conducted across two sessions or papers. Each paper will carry 300 marks and the duration will be 3 hours for each paper. The candidates can check the UPSC IES Exam Pattern (Mains) for more details. For the final merit list, 80% of the weightage will be given to the marks scored in this exam.

The candidates will be shortlisted for interview by following the 1:5 ratio. The personal interview will have a weightage of 20% for the preparation of the final merit list. The candidates need to qualify for the interview in order to get considered in the final merit list. The marks of the descriptive test will not be considered if the interview stage is not qualified.

The candidates will be shortlisted directly for the personal interview on the basis of GATE score. The shortlisting will be done as per the 1:5 ratio. For the final merit list, 80% of the weightage will be given to the GATE score. The information regarding the shortlisting will be made available on the DRDO RAC Official website. The candidates will also be intimated on the SMS as the admit card for the interview will get released.

The personal interview that will take place is most likely to take place in Delhi or any other place as decided by DRDO/RAC. The interview marks will carry a weight of 20% for the merit list.The candidate can download the Testbook App to learn more about such exams.

If you are preparing for the exam then you can download DRDO RAC Exam Previous Year Papers here!

Also, Check related articles about DRDO RAC here:

DRDO Scientist B Eligibility

DRDO Scientist B Job Profile

DRDO RAC Exam Pattern

DRDO RAC Exam Date

As you can see the nature of the paper is descriptive, so there is no negative marking, you will be getting 3 hours for each paper. Candidates will be attempting papers related to their field of study. The difficulty of the examination will be moderately tough. The total marks allotted to the examination are 600. In the below-mentioned table, we have listed down the complete details of it for your better understanding.

| Paper | Duration | Marks | Descriptive Type Paper 1 |

| --- | --- | --- | --- |

| 3 hours | 300 Marks | Descriptive Type Paper 2 | 3 hours |

| 300 Marks | Total | 6 Hours | |

| 600 Marks | | | |

Now that you have gone through the exam pattern, we shall now go through some of the important topics according to your specialization that you need to focus on. We have listed down the important topics under each specialization subject. Go through your specialization subject and note down the list of important topics you need to cover in order to clear the examination.

Below given is the list of topics and descriptive Syllabus of topics related to the Mechanical Engineering branch :

| Topic | Descriptive Syllabus |

| --- | --- |

| Power Plant Engineering | |

| Rankine & Brayton cycles with regeneration & reheat, Fuels & their properties, Flue gas analysis, Boilers, steam turbines, & other power plant components like condensers, air ejectors, electrostatic precipitators, & cooling towers, their theory & design, types, & applications. | |

| Turbo Machinery | |

| Reciprocating & Rotary pumps, Pelton wheel, Kaplan & Francis Turbines, velocity diagrams, Impulse & Reaction principles, Steam & Gas Turbines, Theory of Jet Propulsion, Pulse-jet & Ram Jet Engines, Reciprocating & Rotary Compressors, Theory & Applications | |

| Renewable Sources of Energy | |

| Solar Radiation, Solar Thermal Energy collection, Flat Plate & focusing collectors their materials & performance. Solar Thermal Energy Storage, Applications, heating, cooling & Power Generation; Solar Photovoltaic Conversion; Harnessing of Wind Energy, Bio-mass & Tidal Energy, Methods & Applications, Working principles of Fuel Cells. | |

| Fluid Mechanics | Basic Concepts & Properties of Fluids, Manometry, Fluid Statics, Buoyancy, Equations of Motion, Bernoulli’s equation & applications, Viscous flow of incompressible fluids, Laminar & Turbulent flows, Flow through pipes & head losses in pipes. |

| IC Engines, Refrigeration & Air conditioning | Basic Concepts & Properties of Fluids, Manometry, Fluid Statics, Buoyancy, Equations of Motion, Bernoulli’s equation & applications, Viscous flow of incompressible fluids, Laminar & Turbulent flows, Flow through pipes & head losses in pipes. |

| Thermodynamics & Heat transfer | Thermodynamic systems & processes; properties of pure substance; Zeroth, First & Second Laws of Thermodynamics; Entropy, Irreversibility, & availability; analysis of thermodynamic cycles related to energy conversion: Rankine, Otto, Diesel, & Dual Cycles; ideal & real gases; compressibility factor; Gas mixtures. Modes of heat transfer, Steady & unsteady heat conduction, Thermal resistance, Fins, Free & forced convection, Correlations for convective heat transfer, Radiative heat transfer, Radiation heat transfer co-efficient; boiling & condensation, Heat exchanger performance analysis |

Below given is the list of topics and descriptive Syllabus of topics related to the Mechanical Engineering branch :

| Topic | Descriptive Syllabus |

| --- | --- |

| Engineering Materials | |

| Basic Crystallography, Alloys and Phase diagrams, Heat Treatment, Ferrous and Non-Ferrous Metals, Nonmetallic materials, Basics of Nano-materials, Mechanical Properties and Testing, Corrosion prevention and control | |

| Manufacturing, Industrial & Maintenance Engineering | Metal casting-Metal forming, Metal Joining, Machining, and machine tool operations, Limits, fits and tolerances, Metrology and inspection, computer Integrated manufacturing, FMS, Production planning and Control, Inventory control, and operations research - CPM-PERT. Failure concepts and characteristics-Reliability, Failure analysis, Machine Vibration, Data acquisition, Fault Detection, Vibration Monitoring, Field Balancing of Rotors, Noise Monitoring, Wear and Debris Analysis, Signature Analysis, NDT Techniques in Condition Monitoring. |

| Engineering Mechanics | |

| Analysis of System of Forces, Friction, Centroid and Centre of Gravity, Dynamics; Stresses and Strains-Compound Stresses and Strains, Bending Moment and Shear Force Diagrams, Theory of Bending Stresses- Slope and deflection-Torsion, Thin and thick, Cylinders, Spheres. | |

| Mechanisms & Machines | |

| Types of Kinematics Pair, Mobility, Inversions, Kinematic Analysis, Velocity and Acceleration Analysis of Planar Mechanisms, CAMs with uniform acceleration and retardation, cycloidal motion, oscillating followers; Vibrations –Free and forced vibration of undamped and damped SDOF systems, Transmissibility Ratio, Vibration Isolation, Critical Speed of Shafts. Gears – Geometry of tooth profiles, Law of gearing, Involute profile, Interference, Helical, Spiral and Worm Gears, Gear Trains- Simple, compound and Epicyclic; Dynamic Analysis – Slider – crank mechanisms, turning moment computations, balancing of Revolving & Reciprocating masses, Gyroscopes –Effect of Gyroscopic couple on automobiles, ships, and aircraft, Governors. | |

If you are checking DRDO RAC Scientist B Exam Pattern Details, also check DRDO MTS Exam Pattern details here

Below given is the list of topics and descriptive Syllabus of topics related to the Computer science and Engineering branch :

| Topic | Descriptive Syllabus |

| --- | --- |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. <br> Number representation and computer arithmetic (fixed and floating-point) |

| Topic | |

| Descriptive Syllabus | |

| Discrete Mathematics | |

| Propositional and first-order logic. Sets, relations, functions, partial orders and lattices, groups. <br> Graphs: connectivity, matching, coloring. <br> Combinatorics: counting, recurrence relations, generating functions | Programming & Data Structures Programming in C |

| Functions, structures, memory management, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Object-oriented programming basics. | |

| Computer Organization & Architecture | Machine instructions and addressing modes. Assembly language. ALU, data path, and control unit. <br> Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage. I/O interface (interrupt and DMA modes). RISC, CISC, parallel architectures |

| Algorithms | |

| Searching, sorting, hashing. Asymptotic worst case, time and space complexity. Algorithm design techniques: greedy, dynamic programming, and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. | |

| Engineering Mathematics | Linear Algebra: Matrices, Determinants, a system of linear equations, eigenvalues and eigenvectors, LU decomposition, orthonormal bases, Transforms – Fourier, DCT, wavelets. <br> Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration. Vector calculus – gradient, divergence, curl, integral theorems. <br> Probability: Random variables, probability distributions – uniform, normal, exponential, Poisson, binomial. Mean, median, mode, standard deviation. Conditional probability and Bayes theorem. Information theory: Shannon entropy, information, conditional information |

| Linear Algebra | |

| Calculus | |

| Probability | |

| Digital Logic | Boolean algebra. Combinational and sequential circuits. Minimization. |

Number representation and computer arithmetic (fixed and floating-point)

Below given is the list of topics and descriptive Syllabus of topics related to the Computer science and Engineering branch :

| Topic | Descriptive Syllabus |

| --- | --- |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

| Topic | |

| Descriptive Syllabus | |

| Databases ER‐model | |

| ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints. Normal forms. File organization, indexing (eg, B and B+ trees). Transactions and concurrency controls. | |

| AI & Machine Learning | |

| Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis. Training and test data: overfitting, underfitting. Search. Ontology. Decision trees. Artificial Neural networks: activation function, multi‐layer perceptron, deep learning. <br> Application of artificial neural networks | Security of Cyber-Systems |

| Cybersecurity principles, Kerberos, RADIUS, secure protocols (IPSec, SSH, SSL), basics of public key and private key cryptography, hash functions, blockchains, digital signatures, certificates. <br> Firewalls, intrusion detection systems, basics of IoT security, and Cloud security. <br> Threats, vulnerabilities, malicious software. Attacks: buffer overflow, DoS, DDoS, SQL injection, web application attacks | |

| Compiler design | |

| Lexical analysis, parsing, syntax‐directed translation. <br> Runtime environments, intermediate code generation. | |

| Theory of Computation | |

| Regular expressions and finite automata. Context‐free grammars and push‐down automata. Regular and context‐free languages, pumping lemma. Turing machines and undecidability. | |

| Operating System | Processes, threads, inter‐process communication, concurrency and synchronization, deadlocks. <br> CPU scheduling. Memory management and virtual memory. File systems. Virtual machines and hypervisors. Secure operating systems. |

| Computer Networks | |

| Concept of layering, OSI model. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4 / IPv6, routers, and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. | |

Below given is the list of topics and descriptive Syllabus of related to the Electrical & Communication branch :

| Topic | Descriptive Syllabus |

| --- | --- |

| Basic Electronics Engineering | |

| Basics of semiconductors; Diode/Transistor basics and characteristics; Diodes for different uses; Junction & Field Effect Transistors (BJTs, JFETs, MOSFETs); Transistor amplifiers of different types, oscillators, and other circuits; Basics of Integrated Circuits (ICs); Bipolar, MOS and CMOS ICs; Basics of linear ICs, operational amplifiers and their applications-linear/non-linear; Optical sources/detectors; Basics of Optoelectronics and its applications. | |

| Materials Science | Electrical Engineering materials; Crystal structure & defects; Ceramic materials-structures, composites, processing and uses; Insulating laminates for electronics, structures, properties and uses; Magnetic materials, basics, classification, ferrites, Ferro/para-magnetic materials and components; Nano materials-basics, preparation, purification, sintering, nanoparticles and uses; Nano-optical/magnetic/electronic materials and uses; Superconductivity, uses. |

| Basic Electrical Engineering | DC circuits ohm’s & Kirchoff’s laws, mesh and nodal analysis, circuit theorems; Electromagnetism, Faraday’s & Lenz’s laws, induced EMF and its uses; Single-phase AC circuits; Transformers, efficiency; Basics-DC machines, induction machines, and synchronous machines; Electrical power sources- basics: hydroelectric, thermal, nuclear, wind, solar; Basics of batteries and their uses. |

| Network Theory | |

| Network graphs & matrices; Wye-Delta transformation; Linear constant coefficient differential equations- time-domain analysis of RLC circuits; Solution of network equations using Laplace transforms- frequency domain analysis of RLC circuits; 2-port network parameters-driving point & transfer functions; State equations for networks; Steady state sinusoidal analysis. | |

| Electronic Measurements & Instrumentation | |

| Principles of measurement, accuracy, precision, and standards; Analog and Digital systems for measurement, measuring instruments for different applications; Static/dynamic characteristics of measurement systems, errors, statistical analysis, and curve fitting; Measurement systems for non-electrical quantities; Basics of telemetry; Different types of transducers and displays; Data acquisition system basics. | |

| Analog & Digital Circuits | |

| Small signal equivalent circuits of diodes, BJTS, and FETs; Diode circuits for different uses; Biasing & stability of BJT & JFET amplifier circuits; Analysis/design of amplifier- single/multi-stage; Feedback& uses; Active filters, timers, multipliers, waveshaping, A/D-D/A converters; Boolean Algebra& uses; Logic gates, Digital IC families, Combinatorial/sequential circuits; Basics of multiplexers, counters/registers/ memories /microprocessors, design& applications. | |

Below given is the list of topics and descriptive Syllabus of topics related to the Electrical & Communication branch :

| Topic | Descriptive Syllabus |

| --- | --- |

| Advanced Electronics Topics | |

| VLSI technology: Processing, lithography, interconnects, packaging, testing; VLSI design: Principles, MUX/ROM/PLA-based design, Moore & Mealy circuit design; Pipeline concepts & functions; Design for testability, examples; DSP: Discrete-time signals/systems, uses; Digital filters: FIR/IIR types, design, speech/audio/radar signal processing uses; Microprocessors & microcontrollers, basics, interrupts, DMA, instruction sets, interfacing; Controllers & uses; Embedded systems. | |

| Electro Magnetics | Elements of vector calculus, Maxwell’s equations-basic concepts; Gauss’, Stokes’ theorems; Wave propagation through different media; Transmission Lines-different types, basics, Smith’s chart, impedance matching/transformation, S-parameters, pulse excitation, uses; Waveguides-basics, rectangular types, modes, cut-off frequency, dispersion, dielectric types; Antennas-radiation pattern, monopoles/dipoles, gain, arrays-active/passive, theory, uses. |

| Advanced Communication Topics | Communication networks: Principles/ practices/ technologies/ uses/ OSI model/ security; Basic packet multiplexed streams/ scheduling; Cellular networks, types, analysis, protocols (TCP/TCPIP); Microwave & satellite communication: Terrestrial/ space type LOS systems, block schematics link calculations, system design; Communication satellites, orbits, characteristics, systems, uses; Fibreoptic communication systems, block schematics, link calculations, system design |

| Analog & Digital Communication Systems | |

| Random signals, noise, probability theory, information theory; Analog versus digital communication & applications: Systems- AM, FM, transmitters/receivers, theory/practice/ standards, SNR comparison; Digital communication basics: Sampling, quantizing, coding, PCM, DPCM, multiplexing-audio/video; Digital modulation: ASK, FSK, PSK; Multiple access: TDMA, FDMA, CDMA; Optical communication: fiber optics, theory, practice/standards. | |

| Computer Organization & Architecture | The basic architecture, CPU, I/O organization, memory organization, peripheral devices, trends; Hardware /software issues; Data representation& Programming; Operating systems-basics, processes, characteristics, applications; Memory management, virtual memory, file systems, protection & security; Databases, different types, characteristics, and design; Transactions and concurrency control; Elements of programming languages, typical examples. |

| Control Systems | |

| Classification of signals and systems; Application of signal and system theory; System realization; Transforms& their applications; Signal flow graphs, Routh-Hurwitz criteria, root loci, Nyquist/Bode plots; Feedback systems-open &close loop types, stability analysis, steady-state, transient, and frequency response analysis; Design of control systems, compensators, elements of lead/lag compensation, PID and industrial controllers. | |

If you are preparing for the exam then you can download DRDO RAC Exam Previous Year Papers here!

We hope you found this article on the DRDO RAC Exam pattern helpful. As mentioned above, DRDO is one of the most reputed organizations in the country. Even though the recruitment drive has only one stage of descriptive paper in their selection process. You cannot expect the written examination to be easy. We would recommend you start your exam preparation as soon as possible. Also, you can get updates regarding the upcoming Government recruitments and examinations in our Testbook App available free on the play store. You will also have access to the most exclusive offers and discounts. What are you waiting for? Download it NOW! All the best to all the aspirants, Happy Learning.

Also, Check related articles about DRDO RAC here :

DRDO RAC Exam Date

DRDO Scientist B Eligibility

DRDO RAC GATE Cut Off

DRDO Scientist B Job Profile

The aspirants should be aware that the gross salary and the in-hand salary will differ by a certain amount. This difference shows up due to the various deductions. All such deductions that the salary may be subjected to, are as follows:

• Income Tax
• Gratuity
• Employer’s Provident Fund
• Central Government employees group insurance scheme
• Professional Tax

If you are checking DRDO RAC Scientist B Salary Details, also check DRDO MTS Salary details here

Unlike any other government job, the candidates who will be working on the post of DRDO Scientist B will be entitled to numerous perks and benefits. However, the DRDO always offers some extra perks which in total are as follows:

• Merit-based promotion scheme
• House Rent Allowance (provided that accommodation is unavailable)
• Transport Allowance
• Dearness Allowance
• Leave Travel Concession
• Medical facilities
• Reimbursement of expenditures on newspapers/periodicals
• Higher education from prestigious academic institutions
• Foreign deputations for training/presentation/specific assignments
• Group Insurance
• Subsidized Canteen

After the induction, the candidates will have to undergo a Post Induction Training School (POINTS) course. This training course takes place at the Defence Institute Of Advanced Technology (DIAT), Pune. The trainees are referred to as Officer Trainees(OTs) and are entitled to the entire payment. The training period may last for about 5 months but may differ for various disciplines.

The DRDO follows a Flexible Complementing Scheme to ensure a merit-based promotion. Hence the DRDO also works hard to ensure the career advancement of its employees. The candidates can have a look at the hierarchy ladder that exists in the organization. The Assessment Board or the Peer Committee looks after the merit-based promotion through this ladder.

| Sr. No. | Grade |

| --- | --- |

| 1 | |

| Scientist B | 2 |

| Scientist C | 3 |

| Scientist D | 4 |

| Scientist E | 5 |

| Scientist F | 6 |

| Scientist G | 7 |

| Scientist H (Outstanding Scientist) | 8 |

| Distinguished Scientist (DS) | 9 |

| Secretary, Department of Defence R&D and Chairman | |

If you are preparing for the exam then you can download DRDO RAC Exam Previous Year Papers here!

Hopefully, this article on the DRDO Scientist B Job Profile and Salary was informative as well as motivational. In order to work for such a reputed organization and to enjoy the various perks and benefits mentioned in this article, the candidates must work hard word on their preparation. The aspirants can also download the Testbook App to find appropriate study materials for various government job exams.

Also, Check related articles about DRDO RAC here :

DRDO Scientist B Eligibility

DRDO RAC Exam Pattern

DRDO RAC Exam Date