NIELIT Scientist B Syllabus

The National Institute of Electronics and Information Technology (NIELIT) is an autonomous Scientific Society that comes under the hold of the Ministry of Electronics & Information Technology, Government of India. And it offers a remarkable career opportunity for all the tech graduates, on behalf of Standardisation Testing & Quality Certification Directorate (STQC), for the particular posts – Scientist ‘B’ and Scientific Assistant ‘A’. You can scroll down the article to know everything about the NIELIT Scientist B and Scientific Assistant-‘A’ Recruitment in detail (as per previous years’ information).

Eligibility Criteria:

The eligibility criteria that you need to satisfy to apply for the NIELIT exam are provided below:

1. Age Limit: The maximum age should not be more than 30 years for both the posts – Scientist B as of December 31, of the exam year.
2. Educational Qualifications:

Post

Academic Qualification

Scientist B, Group – A

B.E or B. Tech or (DOEACC) B-Level or AMIE or Graduate-IETE or M.Sc. or  MCA or M.E or M.Tech in the field as mentioned below: Field (Single or in combination): Electronics, Electronics & Communication or Electronics and Telecommunication,  Communication, Electronics, and Instrumentation, Industrial Electronics, Power Electronics, Electrical Engineering,  Instrumentation, Computer Science or Computer Science and Engineering or Computer Engineering or Computer,  Computer & Networking Security, Computer Application, Software Systems or Software Engineering,  Information Technology, Information Technology Management, Computer, Management, Information Science or  Information Science and Engineering

You can also check additional details such as age relaxation, etc. from the official website.

Selection Process and Exam Pattern:

• The Written Examination will be Objective type (OMR based) consisting of questions from Technical and Generic Areas.
• The duration of the written test will be 3 hours.
• There will be a total of 120 objective-type Questions consisting of 65% of questions from the Technical Area of the respective stream and 35% of questions from the Generic Area.
• Every Question will carry a 1 (one) mark and there will be a negative marking of 0.25 mark for each wrong answer.
• The cut-off marks for qualifying for the written examination will be 50% for General and EWS Category candidates, 40% for OBC candidates, and 30% for SC/ST/PWD candidates.
• The cut-off marks specified would be applicable in overall marks ( i.e Technical and Generic Combined) as well as for each section/area (Technical/ Generic) Separately.
• The Generic Area will comprise Logical, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, and General Awareness and Aptitude.

Syllabus:

The important topics that you need to cover to score well in the exam are provided below:

Technical Area: For Computer Science / Computer Engineering (65% Weightage)

Engineering Mathematics:

• Mathematical Logic: Propositional Logic; First-Order Logic. Probability;· Conditional Probability; Mean, Median, Mode, and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
  
• Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
  
• Combinatory: Permutations; Combinations; Counting; Summation; generating· functions; recurrence relations.
  
• Graph Theory: Connectivity, spanning trees, Cutting vertices & edges, covering, matching, independent sets, Coloring, Planarity, Isomorphism. 
  
• Linear Algebra: Algebra of matrices, determinants, Systems of linear equations, Eigenvalues, and Eigenvectors.
  
• Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear. algebraic equations by Secant, Bisection, and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.
  
• Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Computer Science and Engineering:

• Digital Logic: Logic functions, Minimization, Design, and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating-point).
  
• Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
  
• Analog and Digital Communication: Autocorrelation and power spectral density, properties of white noise, filtering of random signals through LTI systems, amplitude modulation and demodulation, angle modulation and demodulation, spectra of AM and FM, Superheterodyne receivers, circuits for analog communications, Information theory, entropy, mutual information, and channel capacity theorem, Digital communications, PCM, DPCM, digital modulation schemes, amplitude, phase, and frequency-shift keying (ASK, PSK, FSK), QAM, MAP, and ML decoding, matched filter receiver, calculation of bandwidth, SNR, and BER for digital modulation; Fundamentals of error correction, Hamming codes; Timing and frequency synchronization, inter-symbol interference and its mitigation; Basics of TDMA, FDMA, and CDMA.
  
• Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.Object-Oriented Programming Concepts- Object, Class, Inheritance, Polymorphism, Abstraction, and Encapsulation.
  
• Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes- P, NP, NP-hard, NP-complete.
  
• Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
  
• Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
  
• Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, Protection, and security.
  
• Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions, and concurrency control.
  
• Information Systems and Software Engineering: information gathering, requirement, and feasibility analysis, data flow diagrams, process specifications, input-output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance. 
  
• Computer Networks: ISO/OSI stack, LAN Technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP, Sockets, IP(v4), IP(v6), Basic concepts of switches, gateways, and routers, Application layer protocols (DNS, SMTP, POP, FTP, HTTP), Firewalls, Network Security – Basic concepts of public key and private key cryptography, digital signature, firewalls 

Before applying, Candidates are advised to go through the advertisement/notification carefully in detail for determining their eligibility as per laid down criteria for the post.

• The candidate can apply only for one stream (Electronics and Communication/ Computer Science) of his/her choice.
• Admission at all the stages of the recruitment process will be purely provisional subject to satisfying the prescribed eligibility conditions.
• Candidates can apply ONLINE at https://recruit-delhi.nielit.gov.in and no other means/mode of application will be accepted. Candidates are required to have valid e-mail identification and an active mobile number. The procedure/steps for filling up applications online are available at https://recruit-delhi.nielit.gov.in under ‘Instructions for filling Application‟ on the Main Page.
• The application shall be treated as complete only if all the steps are completed successfully. In case a candidate is not able to submit the fee successfully by the closing date and time, or the application is otherwise incomplete, his/her candidature will summarily be rejected.
• The candidate has to specify the choice of the Stream in the Online application for which he/she wishes to apply.
• Applicants are required to make sure that “Application Status” in their application is “Submitted Successfully” after submission of the application, otherwise the application will be treated as incomplete and summarily rejected.