NIELIT Calicut Scientist – B Syllabus 2021 PDF – Download Scientific/Technical Assistant – ‘A’ Exam Pattern Here!!!!

0

NIELIT Calicut Scientist – B Syllabus 2021 PDF – Download Scientific/Technical Assistant – ‘A’ Exam Pattern Here!!!! The National Institute of Electronics and Information Technology (NIELIT) in Calicut has uploaded the Syllabus and Exam Pattern for the Post of Scientist – B & Scientific/Technical Assistant – ‘A’ for Group A & B post. This Exam Pattern & Syllabus is available in official Site. Candidates can download the NIELIT Calicut Scientist – B & Technical Assistant – ‘A’ Exam Pattern & Syllabus 2021 in below Link. Stay Connected with us for further updates

NIELIT Calicut Syllabus 2021:

Name of the Board

National Institute of Electronics and Information Technology (NIELIT)
Name of the Post

Scientist – B & Scientific/Technical Assistant – ‘A’

Exam Date

Announce Soon
Status

Syllabus Available

NIELIT Calicut Scientist – B & Scientific/Technical Assistant – ‘A’ Exam Pattern 2021:

Exam Type Post Name Subject No. of Question Duration

Written Exam

Scientist – B General Studies

 

(Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, General Aptitude)

120

3 Hours
Technical Assistant – ‘A’ Technical (Computer Science)

Latest Government Job Notification 2021

NIELIT Calicut Scientist – B & Scientific/Technical Assistant – ‘A’  Syllabus 2021:

Scientist – ‘B’:

Section A : Generic

Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities, General Aptitude.

Section B : Technical

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, Super position 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, lnter-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 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 public key and private key cryptography, digital signature, firewalls.

Web Technologies: HTML5, CSS3, XML, 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, Block chain, AI etc..

Cloud Technology: Compute, Network, Storage Management Technologies, Edge
Computing etc.

SSC Latest Notification 2021

Scientific/Technical Assistant –‘A’:

Section A : Generic

Logical Reasoning, Analytical Reasoning Capabilities, Quantitative and Qualitative abilities and General Aptitude.

Section B : Technical

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 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, SDRAM, Rambus Memory, ROM Technology, virtual memory, Instruction sequencing, Instruction execution, Hardwired control and microprogrammed control, micro instructions,
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 tress, 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, 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. 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 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.

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.

Download NIELIT Calicut Syllabus 2021 PDF

Official Site

To Follow Our InstagramClick Here
To Follow Our TwitterClick Here
To Join Whatsapp
Click Here
To Join Telegram Channel
Click Here
To Join Our FacebookClick Here

What is the Exam Date in NIELIT 2021?

The NIELIT Exam Date 2021 will be Announce Soon

How can I download NIELIT Calicut Scientist – B Syllabus 2021?

The direct link to download NIELIT Calicut Scientist – B Syllabus 2021 have provided above

How many vacancies in NIELIT Recruitment 2021?

There are various vacancies allotted for these recruitment