NIELIT Recruitment 2020, Post Scientist,
Scientific/Technical Assistant, Exams Syllabus and Exams Pattern. NIELIT
(National Institute of Electronics & Information Technology Recruitment
2020. Post Scientist, Scientific/Technical Assistant, Govt. Engineering Jobs
Important Dates
Name of
the Post: Scientist
B & Scientific/ Technical Asst Post A
Advt. No. 01/2020
Total
Post – 495
Place Jobs -
Calicut
Experience- No
Experience
Qualification
- Degree (Engg),
M.Sc/ MCA/ ME / M.Tech/ M.Phil/ B.E. /B.Tech / M.Sc./ MS/ MCA
Application
Fee
For other
category: Rs. 800/-
For
SC/ST/PWD/Women candidates: Nil
Payment
Mode: Online
NIELIT Recruitment 2020 - Scientist, Scientific/Technical Assistant Exams Syllabus, & Pattern |
Important Dates
Starting
Date to Apply Online: 26-02-2020 at 10:00 AM
Last Date to
apply Online: 26-03-2020 by 05:00 PM
Age Limit
(as on 26-03-2020)
Maximum Age
for UR/ EWS: 30 Years
Maximum Age
for SC/ ST: 35 Years
Maximum Age
for OBC (NCL): 33 Years
Maximum Age
for PWD (SC/ ST): 45 Years
Maximum Age
for PWD (OBC – NCL): 43 Years
Application
fee- General and all
others Rs.800/- per application per post (including taxes) SC/ST/ PWD/
Women candidates - Nil
1.
Scientist-‘B’ Group ‘A’ (S&T )
Total
vacancy - 288
Level-10:
(Rs.56100- Rs.177500)
Qualification
- A Pass in Bachelor Degree in Engineering OR Bachelor in Technology OR
Department of Electronics and Accreditation of Computer Courses OR Associate
Member of Institute of Engineers OR Graduate Institute of Electronics and
Telecommunication Engineers OR Master Degree in Science (MSc) OR Master Degree
in Computer Application OR Master Degree in Engineering /Technology (ME
/M. Tech) Master
Degree in Philosophy (M Phil) in the field as mentioned below:- Field (single
or in combination amongst the below only): Electronics, Electronics and
Communication, Computer Sciences, Communication, Computer and Networking
Security, Computer Application, Software System, Information Technology,
Information Technology Management, Informatics, Computer Management, Cyberlaw,
Electronics and Instrumentation.
2.
Scientific/Technical Assistant - ‘A’ Group ‘B’ (S&T )
Total Vacancy
– 207
Level-6 :
(Rs.35400- Rs.112400)
Qualification
- A Pass in M.Sc./MS/MCA/B.E./B.Tech in any one or in a combination of below the mentioned field as mentioned below:- Field (single or in combination amongst
the below only): Electronics, Electronics, and Communication, Electronics &
telecommunications, Computer Sciences, Computer, and Networking Security,
Software System, Information Technology, Informatics.
2.
Scientific/Technical Assistant - ‘A’ Group ‘B’ (S&T )
Total Vacancy
– 207
Level-6 :
(Rs.35400- Rs.112400)
Qualification
- A Pass in M.Sc./MS/MCA/B.E./B.Tech in any one or in a combination of below the mentioned field as mentioned below:- Field (single or in combination amongst
the below only): Electronics, Electronics, and Communication, Electronics &
telecommunications, Computer Sciences, Computer, and Networking Security, Software
System, Information Technology, Informatics.
NIELIT Recruitment 2020 Selection Process
Scientist
‘B’ Post - Written examination and interview
Scientific/Technical
Assistant - ‘A’ Post- written examination
Written
Examination Time- 3 hours
Medium of
Exams - English medium only.
Written
examination- Objective type and OMR Based.
The question
paper for the written examination will consist of 65% questions from Technical
Area and 35% from Generic Area.
There shall
be a total of 120 objective type Questions consisting of 78 questions from
Technical Area (Computer Science) and 42 questions on the Generic area.
The Generic
Syllabus –
1.
Logical
Reasoning
2.
Analytical
Reasoning Capabilities
3.
Quantitative
and Qualitative abilities
4.
General
Aptitude. Syllabus for Technical Area (Computer related topics: Computer
Science/Computer Engineering)
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, 40%
for OBC, 30% for the SC/ST/PWD categories.
NIELIT Syllabus for Scientist – B
Total
Duration : 3 Hours. No of Questions: 120
Section A
: Generic 35% 1
Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative
abilities, General Aptitude
Section B
: Technical (Computer Science) - 65%
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.
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.
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.
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 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.
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
Compiler
Design: Lexical
analysis, Parsing, Syntax directed translation, Runtime environments,
intermediate and target code generation, Basics of code optimization.
Operating
System: Processes,
Threads, later-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, NoSQL
Databases, questions on the internals of Postgres SQL.
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, 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.
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.
Cyber
Security and Emerging Technologies: Secure programming techniques, OWASP top 10 vulnerabilities,
concepts on IoT, Blockchain, AI, etc.
Cloud
Technology: Computer,
Network, Storage Management Technologies, Edge Computing, etc.
NIELIT Syllabus for Scientific/Technical Assistant –‘A’
NIELIT Syllabus for Scientific/Technical Assistant –‘A’
Total
Duration : 3 Hours. No of Questions: 120
A.
Generic 35%
Logical
Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative
abilities and General Aptitude.
Section B
: Technical (Computer Science)
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...
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.
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.
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: Object-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, the 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
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.
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.
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.
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 A 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.
Web
Technologies: HTML5,
CSS3, XML, the basic concept of client-server computing, web server, proxy server,
web application development, MVC architecture, web services, frontend and
backend technologies.
Download PDF - NIELIT Recruitment Syllabus & Pattern
Apply Online- Click Here
Download Official Notification of NIELIT 2020 - Click Here
Post a Comment