Press "Enter" to skip to content

NIELIT Scientist B & Scientific/Technical Assistant A Syllabus

Advertisement

Section A: Generic 35% Common for All

General Intelligence: It would include questions of both verbal and non-verbal type. This component may include questions on analogies, similarities and differences, space visualization, spatial orientation, problem-solving, analysis, judgment, decision making, visual memory, discrimination, observation, relationship concepts, arithmetical reasoning and figural classification, arithmetic number series, non-verbal series, coding and decoding, statement conclusion, syllogistic reasoning, etc. The topics are, Semantic Analogy, Symbolic/Number Analogy, Figural Analogy, Semantic Classification, Symbolic/ Number Classification, Figural Classification, Semantic Series, Number Series, Figural Series, Problem Solving, Word Building, Coding & de-coding, Numerical Operations, symbolic Operations, Trends, Space Orientation, Space Visualization, Venn Diagrams, Drawing inferences, Punched hole/ pattern –folding & un-folding, Figural Pattern – folding and completion, Indexing, Address matching, Date & city matching, Classification of center codes/ roll numbers, Small & Capital letters/ numbers coding, decoding and classification, Embedded Figures, Critical thinking, Emotional Intelligence, Social Intelligence, Other sub-topics, if any.

General Awareness: Questions will be designed to test the general awareness of the environment and its application to society. Questions will also be designed to test knowledge of current events and of such matters of everyday observations and experience in their scientific aspect as may be expected of any educated person. The test will also include questions relating to India and its neighboring countries especially pertaining
History, Culture, Geography, Economic Scene, General Polity& Scientific Research.

General Awareness(सामान्य ज्ञान) Notes(handwritten and 70 pages) in Hindi: Click Here

Current Affairs Notes 2019-2020: Click Here

Quantitative Aptitude: The questions will be designed to test the ability of appropriate use of numbers and number sense of the candidate. The scope of the test will be computation of whole numbers, decimals, fractions and relationships between numbers, Percentage, Ratio & Proportion, Square roots, Averages, Interest, Profit and Loss, Discount, Partnership Business, Mixture and Alligation, Time and distance, Time & Work, Basic algebraic identities of School Algebra & Elementary surds, Graphs of Linear Equations, Triangle and its various kinds of centers, Congruence and similarity of triangles, Circle and its chords, tangents, angles subtended by chords of a circle, common tangents to two or more circles, Triangle, Quadrilaterals, Regular Polygons, Circle, Right
Prism, Right Circular Cone, Right Circular Cylinder, Sphere, Hemispheres, Rectangular Paralleled piped, Regular Right Pyramid with triangular or square base, Trigonometric ratio, Degree and Radian Measures, Standard Identities, Complementary angles, Heights and Distances, Histogram, Frequency polygon, Bar diagram & Pie chart.

 

Section B: Technical (Computer Science) 65% for Scientist B

  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. Advertisement
  9. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, intermediate and target code generation, Basics of code optimization.
  10. 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.
  11. 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 the internals of Postgres SQL.
  12. 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.
  13. 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 a public key and private key cryptography, digital signature, firewalls.
  14. Web Technologies: HTML5, CSS3, XML, the basic concept of client-server computing, web server, proxy server, web application development, MVC Architecture, web services, frontend technologies.
  15. Cyber Security and Emerging Technologies: Secure programming techniques, OWASP top 10 vulnerabilities, concepts on IoT, Blockchain, AI etc..
  16. Cloud Technology: Compute, Network, Storage Management Technologies, Edge Computing, etc.

NIELIT Scientist B & Scientific/Technical Assistant A Vacancy Details Click Here

Section B: Technical (Computer Science) 65% for Scientific/Technical Assistant -A

  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, microinstructions, 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 trees, 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. The 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 Detailed 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 a 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 & Scientific/Technical Assistant A Exam Pattern: Click Here

Advertisement

Be First to Comment

    Leave a Reply