NIELIT Scientist B Syllabus 2023: Check & Download NIC Group A & B Scientific and Technical Posts Exam Pattern and Topics Link: The recruitment exam for the posts of Scientist B, Scientific Officer, etc. will soon be held by the National Informatics Centre at the National Institute of Electronics and Information Technology (NIELIT). The links below provide access to the NIC Group A and B Scientific and Technical Posts Exam Pattern and Subjects.
NIELIT Scientist B Syllabus
| Board Name | National Informatics Centre – National Institute of Electronics and Information Technology (NIELIT) |
| Post Name | Scientist B/ Scientific Officer / Engineer-SB/ Technical Assistant Group A & B |
| Vacancy | 598 |
| Exam Date | will be Updated Soon |
| Syllabus | Available Now |
NIELIT Scientist B Syllabus PDF:
Scientist-‘B’:
Section A: Generic: Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative Abilities, General Aptitude.
Section B: Technical (Computer Science): 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, Inter-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, question on internals of Postgres SQL
Scientific Officer / Engineer-SB and Scientific/Technical Assistant-A:
Section A: Generic 35%: Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, 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, Encode, 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 data-path, 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, NP-hard, 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 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: IOS/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.
NIELIT Scientist B Exam Pattern:
| Multiple Choice Questions (MCQs) | Marks | Duration |
| 120 Questions | Every question will carry 1 (one) mark | 3 hours |
Note: negative marking of 0.25 mark for each wrong answer.
NIELIT Scientist B Syllabus PDF Download
NIELIT Scientist B Syllabus 2023 Tags:
nielit scientist b syllabus 2023 // nielit scientist b syllabus for ece // nic scientist b syllabus pdf // nielit scientist b syllabus cse // nielit scientist b recruitment 2023 // nielit exam syllabus for computer science // nielit scientist c syllabus
Hello Friends, I am from India. After earning my Graduate degree in Computer Application, I decided to pursue my passion for Web Designing and Content Writing. My ultimate goal is to become one of the best in my field and continue to deliver high-quality content. Further, I aim to deliver the latest information regarding recruitment to job seekers, the latest news with accuracy, which shall benefit them in every way possible.