NIELIT Scientist ‘B’, Technical Assistant ‘A’ Exam Syllabus 2020 2021 | NIELIT Scientist-‘B’ Group ‘A’ (S&T), Scientific/Technical Assistant – ‘A’ Group ‘B’ (S&T) Syllabus and Exam Pattern are given on this page. So, candidates who are searching for the NIELIT Syllabus 2020 they can collect full PDF on this page. NIELIT Scientist ‘B’, Technical Assistant ‘A’ Syllabus plays a prominent role in any exam preparation. Without having NIELIT Scientist ‘B’, Technical Assistant ‘A’ syllabus and Exam pattern nobody can know which subjects to prepare for the examination. You can check all details of NIELIT Syllabus here. Are you looking for the free download? Then go through this section.
NIELIT Scientist ‘B’, Technical Assistant ‘A’ Selection Process:
The Selection Procedure of the Exam will be as follows:
- Written Exam
- Interview & Document Verification
National Institute of Electronics & Information Technology Scientist ‘B’, Technical Assistant ‘A’ Exam Center:
Candidates shall indicate their choice of Centre for Written Examination from the cities listed below. No change of Centre will be permissible at a later date. NIELIT, however, reserves the right to direct the candidate to appear for Written Test at any location irrespective of his/her indicated choice depending upon the number of applications received and the administrative convenience.
(1) AGARTALA (2) AHMEDABAD (3) AIZAWL (4) BENGALURU (5) BHOPAL (6)BHUBANESWAR (7) CHANDIGARH (8) CHENNAI (9) DEHRADUN (10) DELHI (11) GANGTOK (12) GUWAHATI (13) HYDERABAD (14) IMPHAL (15) JAMMU (16)JAIPUR (17) KOHIMA (18) KOLKATA (19) LEH (20) LUCKNOW (21) MUMBAI (22) NAHARLAGUN (23) PATNA (24) PORT BLAIR (25) RAIPUR (26) RANCHI (27) THIRUVANANTHAPURAM (28) SHILLONG (29) VISAKHAPATNAM.
Exam Pattern for NIELIT Scientist ‘B’, Technical Assistant ‘A’ Posts:
Selection will be done through a written examination and interview for Scientist ‘B’ Post and only through written examination for Scientific/Technical Assistant – ‘A’ Post.
All eligible candidates who have successfully submitted the online application for Scientist-’B’ and Scientific/Technical Assistant – ‘A’ along with required fee & screened in, shall be called for a written examination. Written Examination shall be of 3 hours duration conducted in English medium only.
Scheme of written examination shall be Objective type and OMR Based.
The question paper for the written examination will consists of 65% questions from Technical Area and 35% from Generic Area. There shall be a total of 120 objective type Questions consisting of 78 questions from Technical Area (Computer Science) and 42 question on Generic area.
The Generic Area will comprise of Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities and General Aptitude.
Syllabus for Technical Area (Computer related topics: Computer Science/Computer Engineering) is given in Annexure ‘A’
Every question will carry 1(one) mark and there will be negative marking of 0.25 mark for each wrong answer.
The minimum percentage to qualify the written examination will be 50% for General/EWS, 40% for OBC, 30% for the SC/ST/PWD categories. The cut –off marks specified would be applicable in the overall marks (i.e., Technical/Generic Combined) as well as for each section (Technical/Generic) separately.
Only the shortlisted candidates for the post of Scientist–‘B’ (based on merit position and reservation policy etc..) who have qualified the written examination, shall be called for interview. The final selection of eligible candidates for appointment to the post of Scientist –‘B’ will be based on the combined performance of the candidates both in the written examination and in interview and verification of documents submitted by the candidates.
The weight-age of marks for written examination and interview will be in the ratio 85:15. It is mandatory to appear in the interview for selection.
The final selection of eligible candidates for appointment to the post of Scientific/Technical Assistant – ‘A’ will be based on the merit position arrived from the performance of the candidates in the written examination, reservation policy and verification of documents submitted by the candidates.
VERIFICATION OF DOCUMENTS:
Verification of requisite documents will be done at the time of the interview for the post of Scientist- ‘B’. Candidate will be interviewed only after verification of original documents to ascertain their eligibility for the post.
For Scientific/Technical Assistant – ‘A’, Verification of documents will be done before joining.
Only short- listed candidates will be called for document verification.
Mere fulfilling of requirement as laid down in the advertisement does not qualify a candidate to be called for personal interaction/interview.
INTERVIEW: Shortlisted candidates shall be intimated about the date and venue by through SMS/e-mail communications to the registered email ID/Mobile phone by NIELIT.
NIELIT Syllabus for Scientist – ‘B’ Syllabus PDF Download:
| Total Duration : 3 Hours. No of Questions : 120 | |
| Sl. No | Topic |
| Section A : Generic 35% | |
| 1. | Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, General Aptitude. |
| Section B : Technical (Computer Science) 65% | |
| 1. | Probability, Statistics and Combinatorics: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniforms, normal, Exponential, Poisson, Binomial, Permutations, Combinations, Counting, Summation, generating functions, recurrence relations, asymptotic. |
| 2. | Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits, Number representation and computer arithmetic (fixed and floating point). |
| 3. | Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (interrupt and DMA mode), instruction pipelining, Cache and main memory, Secondary storage. |
| 4. | Electrical Engineering: Power Electronics, Signals and Systems, Electromagnetic Fields, Network graph, KCL, KVL, Node and Mesh Analysis, Transient response of DC and AC Networks, Sinusoidal steady-state analysis, Resonance, Super position theorem, Maximum Power transfer theorem, Three Phase Circuits, Power and Power factor in AC Circuits. |
| 5. | 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, Super heterodyne 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. |
| 6. | Programming and Data Structures: Programming in modern languages viz., Java, .Net , Open Source (PHP), Python, GoLang, NodeJS, etc. 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. |
| 7. | 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 competent, Spanning trees, Shortest paths; Hashing, Sorting, Searching, Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concept of complexity classes-P, NP, NP-hard, NP-complete. |
| 8. | Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, intermediate and target code generation, Basics of code optimization. |
| 9. | Operating System: Processes, Threads, lnter-Process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. |
| 10. | 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, NoSQL Databases, questions on internals of Postgres SQL. |
| 11. | 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. |
| 12. | Computer Networks: ISO/OSI stack, LAN technologies, Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), IP(v6), Application layer protocols, (ICMP, DNS, SMTP, POP, FTP, HTTP, HTTPS), Basic concepts of hubs, switches, gateways and routers. Wireless technologies, Network security -basic concepts of public key and private key cryptography, digital signature, firewalls. |
| 13. | Web Technologies: HTML5, CSS3, XML, basic concept of client-server computing, web server, proxy server, web application development, MVC Architecture, web services, frontend technologies. |
| 14. | Cyber Security and Emerging Technologies: Secure programming techniques, OWASP top 10 vulnerabilities, concepts on IOT, Block chain, AI etc.. |
| 15. | Cloud Technology: Compute, Network, Storage Management Technologies, Edge Computing etc. |
NIELIT Syllabus for Syllabus for Scientific/Technical Assistant –‘A’ Syllabus PDF Download:
| Total Duration : 3 Hours. No of Questions : 120 | |
| Sl. No | Topic |
| Section A : Generic 35% | |
| 1. | Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities and General Aptitude. |
| Section B : Technical (Computer Science) 65% | |
| 1. | Probability and Statistics: Sampling theorems, Conditional Probability, Mean, Median, Mode and standard deviations, Random Variables discrete and continuous distributions, Poisson, Normal and Binomial distribution, correlation and regression analysis |
| 2. | Digital Computer Principles: Number systems- Binary, Decimal, Octal, and Hexadecimal Conversion, Arithmetic operations, Boolean expression, simplification, Postulates and theorems, Simplifications, K-map, Combinational Logic circuits – Adder, Subtractor, Multiplexer, Demultiplexer, Encoder, Decoder, Sequential circuits – SR, JK, T, D, flip flops, shift registers, Asynchronous, synchronous and Module and counters. |
| 3. | Computer Organization and Architecture: Multiprocessors and microcomputers, Machine Instructions and addressing mode. ALU and datapath, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Cache and main memory, Secondary storage, Semiconductor memory – Internal organization, SRAM, DRAM, SDRAM, Rambus Memory, ROM Technology, virtual memory, Instruction sequencing, Instruction execution, Hardwired control and microprogrammed control, micro instructions, Instruction pipelining. |
| 4. | Programming and Data Structures : Programming in C, Functions , Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search tress, Binary heaps. |
| 5. | Object Oriented Programming: Object Oriented design concept, programming in C++ and on programming languages viz., Java, .Net , Open Source (PHP), Python, GoLang, NodeJS, etc |
| 6. | 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 concept of complexity classes, N, NP, NPhard, NP-complete. |
| 7. | 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. |
| 8. | System Software: Lexical analysis, parsing, syntax directed translation, code generation and optimization, Assemblers, linkers and loaders for microprocessors, operating systems – processes, threads, inter-process communication, synchronization, deadlocks, CPU scheduling, memory management and virtual memory , file system, I/O systems, protection and security module. |
| 9. | 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 and testing, implementation, maintenance. |
| 10. | Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token Ring), flow and error control techniques, Routing algorithm, Congestion Control, TCP/UDP and sockets, IP(v4), Application layer protocol (ICMP, DNS,SMTP, POP, FTP, HTTP, HTTPS) : Basic concept of hubs, switches, gateways and routers. Network security: basic concepts of public key and private key cryptography. Hash function, Digital Signature, Firewalls, User authentication – Token based, Biometric, Remote user authentication, Intrusion detection systems, honey pots, Denial of Service. Wireless network, 2G and 3G Networks, Bluetooth |
| 11. | Web Technologies: HTML5, CSS3, XML, basic concept of client-server computing , web server, proxy server, web application development, MVC architecture, web services, frontend and backend technologies. |
Click Here for NIELIT Scientist ‘B’, Technical Assistant ‘A’ Syllabus PDF Download