Airports Authority of India (AAI) JE IT Syllabus

The Airports Authority of India (AAI) was constituted by an Act of Parliament and came into being on 1st April 1995 by merging the erstwhile National Airports Authority and International Airports Authority of India. AAI manages a total of 137 airports. In AAI, Information Technology holds the key to operational and managerial efficiency, transparency, and employee productivity. AAI initiated a program to indoctrinate IT culture among its employees and this is the most powerful tool to enhance efficiency in the organization. 

AAI website with domain name www.airportsindia.org.in or www.aai.aero is a popular website giving a host of information. In this article, we will see the syllabus of AAI JE- IT in detail.

AAI JE IT syllabus is set by the Air Authority of India which conducts the recruitment exam to recruit eligible and interested candidates for the post of Junior Executive IT. Candidates who are aspiring to appear for the AAI JE IT recruitment exam should know all the details about the exam such as eligibility criteria, exam pattern, syllabus, and so on. AAI JE IT syllabus comprises a list of important topics from which questions are asked in the exam.

• There are two papers in the exam: Part A is related to General Studies, and Part B is related to the technical and analytical side.
• The AAI JE – IT Syllabus includes English, General Intelligence/ Reasoning, General aptitude/Numerical aptitude, General knowledge/ awareness, and IT core subjects.

Part – B Computer Science and Information Technology 

Engineering Mathematics: 

• Mathematical Logic: Propositional Logic; First-Order Logic; Probability; Conditional Probability; Mean, Median, Mode, and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
  • Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
  • Combinatory: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations.
  • Graph Theory: Connectivity, spanning trees, Cutting vertices & edges, covering, matching, independent sets, Coloring, Planarity, Isomorphism. 
  • Linear Algebra: Algebra of matrices, determinants, Systems of linear equations, Eigenvalues, and Eigenvectors.
  • 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.
    
• 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, interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
  
• 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.
  
• 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 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, 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, and maintenance. 
  
• Computer Networks: ISO/OSI stack, LAN Technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP, IP, Basic concepts of switches, gateways, and routers, Application layer protocols (DNS, SMTP, POP, FTP, HTTP), Firewalls.
  
• Network security: Basic concepts of public key and private key cryptography, digital signature, firewalls.
  
• Web technologies: HTML, XML, basic concepts of the client and server computing.