भारतीय खाद्य सुरक्षा एवं मानक प्राधिकरण नई दिल्ली के द्वारा उनके संगठन में भर्ती के लिए असिस्टेंट मैनेजर इनफार्मेशन टेक्नोलॉजी पद लिए 28 मार्च 2022 और आई टी असिस्टेंट पद के लिए 29 मार्च 2022 को प्रतियोगी परीक्षा का आयोजन किया है। इस सन्दर्भ में हमारी टीम उपरोक्त परीक्षा हेतु सिलेबस प्रस्तुत कर रही है जो आपके लिए उपयोगी सहायक होगा

Exam Pattern and Syllabus for FSSAI Assistant Manager (IT) and IT Assistant

FSSAI will be conducted the recruitment exam on 17th to 20th Jan 2022. In this article we are providing the FSSAI Assistant Manager (Information Technology) & Information Technology Assistant Exam Pattern and Syllabus –

Exam Pattern for Assistant Manager (IT) and IT Assistant –

(1) The paper would be in two parts.

(2) There will be 120 Objective MCQ type questions

(3) The duration will be 180 minutes.

(4) For each right answer, 4 marks will be given

(5) For each wrong answer, 1 mark will be deducted

FSSAI Assistant Manager (IT) & IT Assistant Syllabus

Subject Matter Knowledge (65 Questions)

Engineering Mathematics

• Mathematical Logic: Propositional Logic; First-Order Logic.
• Probability: Conditional Probability
• Mean Median, Mode and Standard Deviation, Random Variables, Distribution, Uniform normal, exponential Poisson, Binomial.
• Set Theory & Algebra: Sets, Relations, Functions, Group, Partial Orders, Lattice, Boolean Algebra
• Combinatory: Permutations, Combinations, Counting, Summation, generating functions, recurrence relations, asymptotic.
• Graph Theory: Connectivity, spanning trees, Cut vertices & edges, covering, matching independent sets, coloring Planarity, Isomorphism.
• Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigenvalues, and Elgen 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.

Computer Science And Information Technology

• 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 instruction and addressing modes, ALU and date-path, CPU control design, Memory interface, I/O interface (interrupt and DMA mode), instruction pipelining, Cache and main memory, Secondary storage.
• Programming and Data Structure: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary Search trees, Binary heaps.
• 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 concepts of complexity classes-P, NP, NP-Hard, NP-complete.
• Theory of computation: Regular language and finite automata, context-free language and Push-down automate Recursively enumerable sets and Turing machines, Undesirability.
• Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization
• Operating Systems: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPC scheduling, Memory management and virtual memory. File systems, I/O Protection, and security
• Databases: ER-model, Rational model (relational algebra, tuple calculus). Database design (Integrity constraints, normal forms), Query languages (SQL), File structures (sequential file, 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 (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, congestion control, TCP/UDP and sockets, IP(v4). Application layer protocols (ICMP, DNS, SMTP, pop, FTP, http): Basic concepts of hubs, switches, gateways, and routers. Network security- basic concepts of public key and private key cryptography, digital signature, firewalls.
• Web technologies: HTML, XML, basic concepts of client-server computing.