Advertisement

NIELIT, Delhi Scientist B & Scientific/Technical Assistant A Exam Syllabus 2020 , 495 Scientist B & Scientific/Technical Assistant A Vacancies Written Exam Syllabus 2020 , Download Scientist B & Scientific/Technical Assistant A Written Examination Vacancies Exam Pattern , Syllabus , Previous Paper ,Structure , PDf ,Marking Scheme at www.nielit.gov.in

NIELIT, Delhi Scientist B & Scientific/Technical Assistant A Exam Syllabus 2020 : NIELIT ,Delhi Published Employment Notification in newspaper & their online website www.nielit.gov.in For Recruitment of 495 Scientist B & Scientific/Technical Assistant A Vacancies through Examination . All Candidates who are appearing & eagerly waiting for NIELIT Delhi 495 Scientist B & Scientific/Technical Assistant A Written Examination Syllabus 2020 Syllabus, Exam Pattern, Previous Question PApers Can now check at this page .our Team Provided & Explain Complete Pattern to all our reader who are applying this post to clear understand & How To Score more marks , Get Suitable Rank in NIELIT Delhi Scientist B & Scientific/Technical Assistant A Examination & FullFill their dream to Be a  Government Jobs

Click here For —->Latest NIELIT Delhi Recruitment Notification 

NIELIT, Delhi Scientist B & Scientific/Technical Assistant A Exam Syllabus 2020

Name of Organization  : National Institute of Electronics and Information Technology (NIELIT)

Number of Vacancies:  495 Posts

Name of Posts: Scientist B & Scientific/Technical Assistant A  Posts

Kind of Declaration: Exam Syllabus/ Pattern

Type of Exam: Written Examination ( Objective Type )

Selection Procedure : The selection process will comprise of written test ( Objective Type )

Official Website :  www.nielit.gov.in

Scheme of Examinations & Syllabus 

Syllabus for Scientist – ‘B’

Total Duration : 3 Hours.                                                                                    No of Questions : 120
Sl.No                                                                     Topic
Section A : Generic 35%
ILogical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, General Aptitude.
Section B : Technical (Computer Science) 65%
1Probability, 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.
2Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits, Number representation and computer arithmetic (fixed and floating point).
3Computer 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.
4Electrical 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, Super position theorem, Maximum Power transfer theorem, Three Phase Circuits, Power and Power factor in AC Circuits.
SAnalog and Digital Communication: Autocorrelation and power spectral density, properties of white noise, filtering of random signals through LTD systems, amplitude modulation and demodulation, angle modulation and demodulation, spectra of AM and FM, Super heterodyne receivers, circuits for BIM og communications, unications, 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.
6Programming and Data Structures: Programming in modem 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.
7Algorithms: Analysis. Asymptotic, notation. Notions of space and time complexity. Worst and average case analysis. Design: Greedy approach. Dynamic programming, Divide-and-conquer, Tree and ma ph 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.
8Compiler Design: Lexical analysis. Parsing, Syntax directed translation, Runtime environments, intermediate and target code generation, Basics of code optimization.
9Operating System: Processes, Threads, later-Process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems. Protection and security.
10Databases: 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.
I IInformation 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.
12Computer Networks: ISO/OSI stack, LAN technologies, Flow and error control techniques. Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4). 111(v6). Application layer protocols, OCAIP, 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.
13Web Technologies: HTML5. CSS3, XML, basic concept of client-server computing. web server. proxy server, web application development. MVC Architecture. web services, frontend technologies.
14Cyber Security and Emerging Technologist Secure programming techniques. OWASP top 10 vulnerabilities. concepts on IOT, Block chain, Al etc..
15Cloud Technology: Compute. Network Storage Management Technologies, Edge Computing etc.

 

Syllabus for Scientific/Technical Assistant –‘A’   

Total Duration : 3 Hours .                                                                              No of Questions : 120 
SI. No                                                                  Topic
Section A : Generic 35%
ILogical Reasoning, Analytical Reasoning Capabilities. Quantitative and Qualitative abilities and General Aptitude.
Section B : Technical /Computer Science 65%
IProbability and Statistics: Sampling theorems. Conditional Probability. Mean. Media::. Mode and standard deviations. Random Variables discrete and continuous distributions. Poisson, Normal and Binomial distribution. correlation and regression analysis.
2Digital 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.
3Compute Organization and Architecture: Multiprocessors and microcomputers. Machine Instructions and addressing mode. ALU and data-path. CPU control design. Memory interface. I/O interface (Interrupt and DMA mode). Cache and main memory. Secondary storage. Semiconductor memory. – Internal organization. SRAM. DRAM. SWUM. Rambus Memory. ROM Technology. virtual memory. Instruction sequencing. Instruction execution. Hardwired control and microprogrammed control, micro instructions. Instruction pipelining.
4Programming and Data Structures : Programming in C. Functions . Recursion, Parameter passing. Scope. Binding: Abstract data types. Army.. Stacks, Queues, Linked Lists. Trees. Binary search tress. Binary heaps.
5Object Oriented Programming Object Oriented design concept, programming in C++ and on programming languages viz., Java. .Net , Open Source (PHPI), Python. Gotang. NodeJS, etc
6Algorithms: 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. wont, average cases) of time and space. upper and lower bounds. Basic concept of complexity classes. N. NP. NP Hard. NP-complete.
7Databases: 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.
8System 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.
9Information 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.
10Computer 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 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 30 Networks, Bluetooth.
I IWeb Technologies: HTMLS, CSS3, XML, basic concept of client-server computing , web server, proxy server, web application development, MVC architecture, web services, frontend and backend technologies.

Click Here To –> NIELIT, Delhi Scientist B & Scientific/Technical Assistant A Exam Syllabus 2020 in PDF

Our Team covers all syllabus in details . we Hope our reader clear understand the structure, marking scheme & exam pattern for this Exam

Advertisement