NIELIT Scientist B Recruitment 2020 previous year question paper are proved very sound material to prepare for the exam. Thousand of candidates are going to prepare for the NIC Scientist B Recruitment 2020. They do really hard work to get success in the examination. They manage their time and stress according to the exam schedule and the exam syllabus. We suggest them to go through the exam syllabus properly and plan their study schedule accordingly. Such kind of plan let them take towards success. The NIC scientist B previous year question papers are really handful to the candidates.
NIELIT Scientist B Recruitment 2020 – Previous Year Question Paper
The NIC scientist B recruitment syllabus, exam pattern and previous year question paper are available in this page.
The NIELIT scientist B old paper provide the students a incredible confidence about the syllabus. Students must solve the old papers as this practice will make them sound against the exam syllabus.The solved question papers are helpful to understand the exam pattern. Students can familiar with the negative marking.
|NIELIT Scientist B Eligibility||Check Here|
|NIELIT Scientist B Age Limit||Check Here|
|NIELIT Scientist B complete details||Check Here|
The continuous practice of the model papers and the previous year papers make them understand the concept of negative marking. Therefore, go through the below links and download the NIC scientist B previous year question papers and start to prepare for the exam.
|Date of Exam||Post||Question Paper|
|01&02 Dec 2018||Scientist B||Question Paper|
|10 February 2019||Scientist C||Question Paper|
|10 February 2019||Scientist D||Question Paper|
|17 December ,2017||Scientist B||Question Paper|
|17 December ,2017||Scientific/Technical Assistant-A||Question Paper|
|15 October ,2017||Scientific Officer-SB (Electronics)||Question Paper|
|15 October ,2017||Scientific Assistant ‘A’ (Electronics)||Question Paper|
|15 October ,2017||Scientific Assistant ‘A’ (IT)||Question Paper|
|15 October ,2017||Scientific Assistant ‘A’ (CS)||Question Paper|
|15 October ,2017||Tradesman ‘B’ (Electronics Mechanic)||Question Paper|
|22 July ,2017||Scientist -B (BE/ B.Tech. in Computer Science or Computer Engg )||Question Paper|
|22 July ,2017||Scientist -B (BE/ B.Tech. in Information Technology )||Question Paper|
|22 July ,2017||Scientist -B (BE/ B.Tech. in Electronics & Communication OR Electronics & Telecommunication )||Question Paper|
|4 December ,2016||Scientist -B (BE/ B.Tech. in Computer Science or Computer Engg )||Question Paper|
|4 December ,2016||Scientist -B (BE/ B.Tech. in Information Technology )||Question Paper|
|4 December ,2016||Scientist -B (BE/ B.Tech. in Electronics & Communication OR Electronics & Telecommunication )||Question Paper|
|4 December ,2016||Scientist -B (M.Sc. (Physics) OR M. Sc. (Electronics/Applied Electronics) )||Question Paper|
|12-13 March ,2016||Scientist -B||Question Paper|
|12-13 March ,2016||Senior Technical Assistant||Question Paper|
|12-13 March ,2016||Scientist -D||Question Paper|
|12-13 March ,2016||Scientist -C||Question Paper|
|12-13 March ,2016||Technical Assistant||Question Paper|
|12-13 March ,2016||Junior Technical Assistant||Question Paper|
|12-13 March ,2016||Administrative officer||Question Paper|
|12-13 March ,2016||Assistant Director(Admin)||Question Paper|
NIELIT scientist B previous year question paper — Exam Pattern
- The written exam will OMR based and contain objective type questions.
- Candidates have to face 120 objective type question.
- The total duration of the exam is 180 minutes. The marks will segregate as per below details. Please go through the details..
- 78 Question is related to computer science.
- 42 questions is related to Generic Area.
- Each and every question carry 1 mark along a 0.25 negative mark means there is a deduction of 0.25 mark for each wrong answer.
- The minimum qualifying percentage is a follows :-
- For General Candidate — 50 %
- For OBC Candidate — 40%
- For SC/ST Candidate — 30%
NIELIT Scientist B Recruitment 2020 — Syllabus
1.1. Engineering Mathematics
Mathematical Logic: Propositional Logic; First Order Logic:
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniforms, normal, exponential, Poisson, Binomial.
Set Theory & Algebra: Sets, Relations, Functions, Groups, Partial Orders, Lattice, Boolean Algebra.
Combinatorics: Permutations, Combinations, Counting, Summation, generating functions, recurrence relations, asymptotics.
Graph Theory: Connectivity, spanning trees, Cut vertices & edges, covering, matching, independent sets, Colouring, Planarity, Isomorphism.
Linear Algebra: Algebra of Matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical Methods: LU decomposition for systems of linear equations, numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, Maxima & Minima.
1.2 NIC Scientist B Syllabus — Computer Science/ Computer Engg
Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits, Number representation and computer arithmetic (fixed and floating point).
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.
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.
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, Object Oriented Programming Concepts- Object, Class, Inheritance, Polymorphism, Abstraction and Encapsulation.
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.
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
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, 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. 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.
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), Basic concepts of hubs, switches, gateways, and routers. \ Wireless technologies, Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.