NIC Scientist B Syllabus 2020 & Exam Pattern

NIC Scientist B Syllabus 2020

NIC Scientist B Syllabus 2020: National Informatics Centre (NIC) has Published Notification Regarding Scientist B & Scientific/Technical Assistant A Vacancy. A Total of 495 Vacancy For Above Post. NIC Scientist and Scientific/Technical Assistant Online Form 2020 started on 26th February 2020 and will end on 30th April 2020. Here Applicants Will get Full Details Above NIC Scientist B Syllabus 2020 PDF.

NIC Recruitment 2020

Job Recruitment Board National Informatics Centre
Notification No. NIELIT/NIC/2020/1
Post Scientist – ‘B’ and Scientific/Technical Assistant – ‘A’
Vacancies 495
Job Location  anywhere in India
Job Type Central Govt Jobs
Application Mode Online
Admit Card Update Soon
Last Date 30-04-2020

NIC Scientist B Exam Pattern 2020

Subject Syllabus Questions Duration
Technical Area (Computer Science) Computer-related topics: Computer Science/Computer Engineering 78
3 hours
Generic area Logical Reasoning, Analytical Reasoning Capabilities,
Quantitative and Qualitative abilities and General Aptitude.
42
Total Questions 120  
  • Scheme of written examination shall be Objective type and OMR Based.
  • 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 categories.
    • 40% for OBC categories.
    • 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.

NIC Scientist B Syllabus 2020

SI 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,
  • Superposition 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,
  • 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
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,
  • webserver,
  • 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,
  • Blockchain,
  • AI, etc..
15 Cloud Technology:

  • Compute,
  • Network,
  • Storage Management Technologies,
  • Edge Computing etc.

NIC Scientist B Syllabus 2020 Important Links

  • NIC Scientist and Scientific/Technical Assistant Online Form 2020: Apply Now
  • NIC Technical Assistant Syllabus 2020 PDF Download
  • NIC 497 Scientist – ‘B’ and Scientific/Technical Assistant – ‘A’ Vacancy Notification: Download
  • NIC Official Website: Click Here

NIC Scientist B Syllabus 2020 & Exam Pattern PDF Download

Updated: April 24, 2020 — 9:22 pm

The Author

Admin

Making the World a Better Place

Leave a Reply

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

This site uses Akismet to reduce spam. Learn how your comment data is processed.