2023 2024 EduVark > Education Discussion > Career and Jobs


  #2  
April 11th, 2015, 03:15 PM
Super Moderator
 
Join Date: Mar 2012
Re: EIL Management Trainee Exam Syllabus

As per your request I am providing you here the detailed syllabus and pattern of EIL MT exam.

Engineers India Limited conducts the exam of the Management Trainee (MT) for the session 2015.

Eligibility for Exam:

For the exam you must have a full time engineering degree in either of the following: Bachelor of Engineering/ Bachelor of Technology/ Bachelor of Science (Engineering) from any recognized university/ college of India.

Exam Pattern:

There will be an objective type written test divided into main sections on the topics as given below:

Section I: Technical Questions (100 Questions) Based on the syllabus of the qualifying degree exam

Section II: General Aptitude Section (50 Questions)

Quantitative Aptitude

General Awareness

Reasoning and

English Language

Detailed Syllabus for EIL Management Trainee (Computer Science) Exam -


Topics covered:
General Aptitude
Oil & energy
World affairs
Indian culture
Sports
Quantitative Aptitude
Logical Reasoning
Economics
Industry

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

All the best for exams!!!


Quick Reply
Your Username: Click here to log in

Message:
Options



All times are GMT +5. The time now is 05:56 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3 4 5 6 7 8