2023 2024 Student Forum > Management Forum > Main Forum

 
  #2  
12th December 2012, 10:12 AM
Super Moderator
 
Join Date: May 2012
Re: Eil management trainee syllabus

Candidates, who have completed B.Tech in any of the branches which are CSE, IT, ECE, Electrical, Civil, Mechanical, or Chemical Engineering, are eligible for the position of Management Trainee in EIL.

Main Topics Covered under EIL Management Trainee (Electrical) Exam
General Aptitude
English Language
Technical Knowledge
Quantitative Aptitude
Reasoning
General Awareness

For the detailed syllabus I am attaching a file.
Attached Files
File Type: doc EIL management trainee syllabus.doc (35.0 KB, 120 views)
  #3  
24th February 2015, 12:34 PM
Unregistered
Guest
 
Re: Eil management trainee syllabus

I am searching for the EIL Management Trainee (Computer Science) Exam? Can you please tell me from where I can get the EIL Management Trainee (Computer Science) Exam?
  #4  
24th February 2015, 02:12 PM
Super Moderator
 
Join Date: Apr 2013
Re: Eil management trainee syllabus

The Engineers India Limited Conducts the exam of the Management Trainee (MT). You are looking for EIL Management Trainee (Computer Science) Exam syllabus. Here I am providing you the syllabus for the EIL Management Trainee (Computer Science) Exam. This is as follows:

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

Technical Section:
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

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


EIL MT Exam Papers Pattern:


S. No. Topics No. of Questions Timings

1.
Technical Section 50 02 hours

2.
General Aptitude 50


Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5. The time now is 01:44 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4