Written test conducted for the Post of Management Trainee (Computer Science) in Engineers India Limited will contain questions to evaluate candidates’ subject knowledge and General Aptitude. There will be a total of 150 questions from both sections. There will be graduate level questions in the written test.

Exam Pattern of EIL Management Trainee (Computer Science)

The written test will contain objective type questions from topics such as

• Technical Section
• General Aptitude

There will be 100 questions in Technical Section and 50 questions in General Aptitude Section. Each question carries one mark. There will be penalty for wrong answers. 0.25 marks will be deducted for every wrong answer. The maximum time allotted to answer all the questions is two hours.

Detailed Syllabus for EIL Management Trainee (Computer Science) Exam

• General Aptitude
• Oil & energy
• World affairs
• Indian culture
• Sports
• Quantitative Aptitude
• Logical Reasoning
• Economics
• Industry

Apart from these, there will be questions from reading comprehension, English Language Usage and Grammar.

Technical Section

Digital Logic

• Minimization
• Number representation and computer arithmetic point
• Logic functions
• Combinational and sequential circuits

Programming and Data Structures

• Binary search trees
• Functions
• Programming in C
• Recursion
• Stacks
• Arrays
• Binary Heaps
• Binding Abstract
• Data types
• Linked Lists
• Parameter passing
• Queues
• Scope
• Trees

Computer Organization and Architecture

• Arithmetic Logic Unit and data-path
• Cache and main memory
• Instruction pipelining
• Machine instructions and addressing modes
• Secondary storage
• C P U control design
• Input/ Output interface
• Interrupt and DMA mode
• Memory interface

Theory of Computation

• Undecidability
• Regular languages and finite automata
• Recursively enumerable sets and Turing machines

Compiler Design

• Syntax directed translation
• Intermediate and target code generation
• Parsing
• Lexical analysis
• Runtime environments
• Basics of code optimization

Algorithms

• Analysis
• Notions of space and time complexity
• Design: Greedy approach
• Divide-and conquer
• Connected components
• Shortest paths
• Sorting
• Asymptotic notation
• Worst and average case analysis
• Dynamic programming
• Tree and graph traversals
• Spanning trees
• Hashing
• Searching
• Basic concepts of complexity classes P, NP, NP-hard, NP-complete

Databases

• Relational model
• Transactions and concurrency control
• Database design
• File structures
• ER-model
• Query languages (SQL)

Operating System

• Concurrency
• CPU scheduling
• Deadlock
• File systems
• Inter-process communication
• Memory management and virtual memory
• Processes
• Synchronization
• I/O Systems
• Threads

Information Systems and Software Engineering

• Information gathering
• Requirement Analysis
• Data flow diagrams
• Process specifications
• Feasibility analysis

Computer Networks

• LAN technologies
• Routing algorithms
• Flow and error control techniques
• Congestion control

Apart from this, there will be questions from Web technologies, basic concepts of client-server computing and languages such as HTML and XML. Candidates are required to refer books prescribed for B.Tech/ B E.