NIELIT Exam Syllabus 2020 For Scientist and Technical Assistant

NIELIT Exam Syllabus 2020 For Scientist and Technical Assistant

NIELIT Exam Syllabus 2020 For Scientist and Technical Assistant: National Institute of Electronics and Information Technology (NIELIT) invites the Application for Scientist and Assistant Scientist Online Form 2020. NIELIT Examination will be held for the selection of candidates for Scientist and Assistant Scientist.

Interested Candidates who apply for this Examination should get prepared for examination. For the Preparation of the NIELIT Examination they need detailed syllabus of the examination for Scientist and Assistant Scientist. Interested Candidates Get Syllabus of Examination in this post and give their best in the Examinations. Follow our Website SarkariExamNews.in for more and Latest Updates Regularly.

Overview of NIELIT Exam Syllabus 2020

Exam NameNIELIT
Conducting BodyNational Institute of Electronics & Information Technology
PositionScientist-B and Scientific/Technical Assistant-A
Total Vacancies495
Exam ModeMCQ and OMR Based
Exam DateYet to be announced
Official Websitenielit.gov.in

NIELIT Exam Pattern 2020

NIELIT Exam Pattern 2020 for Scientific “B”

SectionNumber of Questions
Generic (Reasoning and Aptitude)42
Computer Science78
Total Questions120

Note:

  • (a) The total time duration of the NIELIT Written Exam is 3 Hours.
  • (b) The exam is of objective type and OMR based.
  • (c) 1 mark will be awarded for every correct answer and 0.25 marks will be deducted for every incorrect answer.

NIELIT Exam Pattern 2020 for Scientific/Technical Assistant “A”

SectionNumber of Questions
Generic (Reasoning and Aptitude)42
Principles of Computer Science78
Total Questions120

Note:

  • The total time duration for the NIELIT Exam is 3 hours.
  • The exam is of objective type and OMR based.
  • 1 mark will be awarded for every correct answer and 0.25 marks will be deducted for every incorrect answer.

NIELIT Exam Syllabus 2020

NIELIT Exam Syllabus 2020 For Scientist – ‘B’

NIELIT Exam Syllabus for Scientist B divided in two parts first one is generic (general section) weightage of 35% and Technical Section with weightage 65%.

Section A : Generic 35%
Logical Reasoning,
Analytical Reasoning Capabilities,
Quantitative and Qualitative abilities,
General Aptitude.

Section B : Technical (Computer Science) 65%

TopicDetailed Syllabus
Probability, Statistics and CombinatoricsConditional Probability, Random Variables; Mean, Median, Mode and Standard Deviation. Distributions: uniforms, normal, Exponential, Poisson, Binomial, Counting. Summation, generating functions, Permutations, Combinations, Recurrence relations, Asymptotic.
Digital LogicLogic functions, Minimization, Design and synthesis of combinational and sequential circuits. Number representation and computer arithmetic (fixed and floating-point).
Computer Organization and ArchitectureMachine instructions and addressing modes, ALU and data-path. CPU control design, Memory interface, I/O interface (interrupt and DMA mode), instruction pipe lining. Cache and main memory, Secondary Storage.
Electrical EngineeringPower 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, Superposition theorem. Maximum Power transfer theorem, Three Phase Circuits, Power and Power factor in AC Circuits.

Analog and Digital CommunicationAuto correlation 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.
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. The basic concept of complexity classes – P, NP, NP-hard, NP-complete.
Programming and Data StructuresProgramming 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.
Compiler DesignLexical analysis, Parsing, Syntax directed translation. Runtime environments, intermediate and target code generation, Basics of code optimization.
Operating SystemProcesses, Threads, Inter-Process communication, Concurrency, Synchronization. Deadlock, CPU scheduling, Memory management and virtual memory. File systems, I/O systems, Protection and security.
DatabasesER-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 the internals of Postgres SQL.
Information Systems and Software EngineeringInformation 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 NetworksISO/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.
Web TechnologiesHTML5, CSS3, XML, Basic concept of client-server computing, web server, proxy server, web application development, MVC Architecture, web services, frontend technologies.
Cyber Security and Emerging TechnologiesSecure programming techniques, OWASP top 10 vulnerabilities, concepts on IoT, Blockchain, AI etc.
Cloud TechnologyCompute, Network, Storage Management Technologies, Edge Computing etc.

NIELIT Exam Syllabus 2020 for Scientific/Technical Assistant –‘A’

NIELIT Exam Syllabus for Scientific/Technical Assistant –‘A’ divided in two parts first one is generic (general section) weightage of 35% and Technical Section with weightage 65%.

Section A : Generic 35%
Logical Reasoning,
Analytical Reasoning Capabilities,
Quantitative and Qualitative abilities,
General Aptitude.

Section B : Technical (Computer Science) 65%

TopicDetailed Syllabus
Probability, Statistics and CombinatoricsSampling theorems, Conditional Probability, Mean, Median, Mode and standard deviations, Random Variables discrete and continuous distributions, Poisson, Normal and Binomial distribution, correlation and regression analysis.
Digital Computer PrinciplesNumber 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.
Computer Organization and ArchitectureMultiprocessors 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, microinstructions, Instruction pipelining.
Programming and Data StructuresProgramming in C, Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Object-Oriented ProgrammingObject-Oriented design concept, programming in C++ and on programming languages viz., Java, .Net, Open Source (PHP), Python, GoLang, NodeJS, etc.
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.
Programming and Data StructuresProgramming 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.
System SoftwareLexical 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.
Network securityBasic concepts of public key and private key cryptography. Hash function, Digital Signature, Firewalls, User authentication, Intrusion detection systems, honey pots, Denial of Service. Wireless network, 2G and 3G Networks, Bluetooth.
DatabasesER-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 EngineeringInformation 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.
Computer NetworksISO/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.
Web TechnologiesHTML5, CSS3, XML, basic concept of client-server computing; Web server, proxy server, web application development, MVC architecture, web services, frontend and backend technologies.

NIELIT Exam Syllabus 2020 for Scientist and Scientific/Technical Assistant in Pdf

FAQ: NIELIT Exam Syllabus 2020

Q: When is the NIELIT exam 2020 for Scientist and Scientific/Technical Assistant going to be conducted?

Ans: NIELIT Exam Date 2020 is yet to be announced by the officials. However, the tentative date for the same was April 2020 but due to Corona Outbreak and lock-down, it will be rescheduled. For more details we are updates if any updates come.

Q: From Where can I get the previous year question papers of NIELIT?

Ans: You can download the previous year question papers of NIELIT from the official website. Here is the direct link: previous year question papers of NIELIT

Q: What is the syllabus for Scientific Asst in Computer Science section?

Ans: As per NIELIT, the syllabus for Scientific Assistant-A under the Principles of Computer Science section is given as:
·      Probability and Statistics
·      Digital Computer Principles
·      Computer Organization and Architecture
·      Programming and Data Structures
·      Object-Oriented Programming
·      Algorithms
·      Databases
·      System Software
·      Information Systems and Software Engineering
·      Computer Networks
·      Web Technologies

We hope this detailed article on NIELIT Exam Syllabus 2020 helps you.

Leave a Reply

Your email address will not be published. Required fields are marked *