NIC Scientist Syllabus 2023 (pdf) NIELIT Technical Assistant Exam Pattern

NIC Scientists – “B” and Scientific / Technical Assistant – “A” Exam Syllabus 2023 is available here. Candidates who had applied for NIELIT Scientists – “B” and Scientific / Technical Assistant – “A” Recruitment 2023 can check the latest Syllabus, Exam Pattern, Model Papers, Previous Papers pdf, Mock Tests from this article which is officially released by NIC. NIELIT Scientists – “B” and Scientific / Technical Assistant – “A” Notification can be Downloaded from Here. If you are Already Applied, Here is the good news for the aspirants who are searching for Scientists – “B” and Scientific / Technical Assistant – “A” Exam Syllabus 2023. In the below section contenders will get subject wise Syllabus along with Exam Pattern. So with the reference given Scientists – “B” and Scientific / Technical Assistant – “A” Syllabus, all the applicants must start their preparation because there is an enormous competition for NIC/NIELIT Jobs.

NIC NIELIT Scientists – “B” and Scientific / Technical Assistant – “A” Exam Pattern

Name of Organization	National Informatics Centre – National Institute of Electronics and Information Technology (NIC)
Post Names	Scientists – “B” and Scientific / Technical Assistant – “A”
Last Date to Apply	April 10, 2023
Date Of Written Test	To be announced
Category	Syllabus
Number of Vacancies	495
Official Website	calicut.nielit.in

NIC Scientists – “B” and Scientific / Technical Assistant – “A” Exam Pattern 2023

National Informatics Centre – National Institute of Electronics and Information Technology announced Scientists – “B” and Scientific / Technical Assistant – “A” Jobs. Nowadays there is heavy competition for any Govt Job. For all NIC Scientists – “B” and Scientific / Technical Assistant – “A” Posts, The Selection Procedure includes written test. Here we are Providing the Syllabus and Old Question Papers for easy preparation. All the Best!

The scheme of written examination shall be Objective type and OMR Based.
The written examination will consist of 65% questions from Technical Area and 35% from Generic Area.
There shall be a total of 120 questions consisting of Technical Area (Computer Science) 78 questions and Generic Area 42 questions.
Every question will carry 1(one) mark.
There will be a negative marking of 0.25 marks for each wrong answer.

NIC NIELIT Scientist Exam Pattern 2023

Type of Exam	Subject Names	Questions	Marks	Duration
OMR Based & Objective	Technical Area (Computer related topics: Computer Science/Computer Engineering)	60	60	3 Hours
OMR Based & Objective	Generic Area (Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, and General Aptitude)	60	60	3 Hours

NIELIT Technical Assistant Test Pattern 2023

Subject Names	No. of Question	Duration
Generic ( Logical Reasoning, Analytical Reasoning, Capabilities, Quantitative and Qualitative abilities, and General Aptitude)	120	3
Technical ( Probability & Statistics, Digital Computer Principles, Computer Organization &Architecture, Programming & Data Structure, Object-Oriented Programming, Algorithms, Databases, System Software, Information Systems, and Software Engineering, Computer Networks, and Web Technologies.	120	3
Total	120 Questions	3 Hours

NIC NIELIT Scientist & Technical Assistant Syllabus 2023

NIC NIELIT Scientist & Technical Assistant Syllabus 2023: NIC NIELIT Scientist & Technical AssistantSyllabus PDF is available here for the candidates who going for the NIC NIELIT Scientist & Technical Assistantexam. Candidates who want to get good marks in the exScientist & Technical Assistantation are requested to download NIC NIELIT Scientist & Technical Assistant Syllabus PDF which is available here. Each and every topic if NIC NIELIT Scientist & Technical Assistant syllabus is updated clearly.

Syllabus for Scientist – ‘B’

Section A : Generic 35%

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.

Here Schools360.in Team Provides you FREE Download links of NIC NIELIT Scientist & Technical Assistant Exam Pattern & Syllabus 2023. Candidates those Applied for the mentioned NIC NIELIT Scientist & Technical Assistant Notification can Start preparing with this Material. We hope you all Satisfy and get success in future.

Syllabus for Scientific/Technical Assistant –‘A’

Section A : Generic 35%

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 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 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.