Detailed Syllabus for DRDO Scientist B Recruitment 2020 (Computer Science Paper-1 & Paper-2)

DRDO invited online applications from graduate engineers and postgraduates in science for Scientist 'B' Posts including students who are appearing or have appeared in their final year examination through RAC. Candidates can apply for 167 vacancies in various departments. The application for DRDO Scientist 'B' posts will begin from 29th May 2020. The online application for DRDO recruitment will close on 10th July 2020.

For recruitment through GATE 2020/2019/2018 along with a Descriptive Exam which will be followed by a Personal Interview. The syllabus has been announced by DRDO for Descriptive Exam in three branches: Electronics, Computer Science, Computer Science.

In this article get the syllabus of DRDO Scientist B 2020 recruitment syllabus for Computer Science Branch in detail for PAPER-1 and PAPER-2.

DRDO Scientist B Recruitment 2020 Notification PDF

DRDO Scientist B Recruitment 2020: Apply Online

Details of Descriptive Examination

The written examination will be of the descriptive type, consisting of two papers of 300 marks each, to be conducted in two sessions of the duration of three hours each.
The syllabus of the Descriptive Examination(downloadable from the RAC website) is similar to the Engineering Services Examination (Main) in the relevant discipline conducted by the Union Public Service Commission (UPSC).
The Descriptive Examination will be administered in a paper-based format.
Tentatively, the Descriptive Examination will be conducted at DRDO centres in seven cities (Bengaluru, Chennai, Delhi, Hyderabad, Kanpur, Kolkata, and Pune) as well as at other common centres, if the need arises.
Candidates are required to indicate their first and second preference of examination centre in the online application form among the listed centres.
The Descriptive Examination is likely to be held in October 2020

Syllabus of descriptive Exam for Computer Science Engineering syllabus is as follows:

PAPER – I

Engineering Mathematics:

Linear Algebra:
- Matrices, Determinants
- System of linear equations
- Eigenvalues and eigenvectors
- LU decomposition
- Orthonormal bases
- Transforms – Fourier, DCT, wavelets.
Calculus:
- Limits, continuity, differentiability, maxima and minima, mean value theorem, integration
- Vector calculus – gradient, divergence, curl, integral theorems
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

Discrete Mathematics:

Propositional and first order logic. Sets, relations, functions, partial orders and lattices, groups
Graphs: connectivity, matching, coloring.
Combinatorics: counting, recurrence relations, generating functions

Digital Logic:

Boolean algebra. Combinational and sequential circuits
Minimization
Number representation and computer arithmetic (fixed and floating point)

Computer Organization and Architecture:

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

Programming and 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

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

PAPER – II

Compiler design:

Lexical analysis, parsing, syntax‐directed translation
Runtime environments, intermediate code generation

Operating System:

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

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

Databases:

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

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

Security of Cyber Systems:

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

AI and Machine Learning:

Classification and clustering techniques, dimensionality reduction: PCA, SVD. Correlation and regression analysis
Training and test data: over fitting, under fitting
Search. Ontology
Decision trees.
Artificial Neural networks: activation function, multi‐layer perceptron, deep learning
Application of artificial neural networks