EIL Sample Papers for CS

Will you please provide me the EIL technical sample papers of computer science?

[Shaleen]

You are looking for the EIL technical sample papers of computer science, here I am giving the paper pattern & question paper:

Written test syllabus:
General Aptitude covering Quantitative Aptitude,
General Awareness,
Reasoning and English Language

EIL Management Trainee (MT) Exam Pattern:

There are 150 Questions for Duration of 120 Minutes.
In this 50 Questions English, Aptitude Test and General Knowledge.

100 Questions Technical Branch and The Subjects from following subjects:

1. English-
Only 5 Questions English (Vocabulary).

2. Aptitude Test-
5 Questions Simple Maths

3. GK –
Mostly Questions Current Affairs

4. Technical Paper-
This Part Contains 100 Questions from the Technical Branch

You are looking for the EIL technical sample papers of computer science, here I am uploading a file from where you can download the EIL technical sample papers of computer science.

I want to crack Engineers India Limited Management Trainee Computer Science Exam . Will you please provide the syllabus for preparation ?

[Quick Sam]

As you are looking for the Engineers India Limited Management Trainee Computer Science Exam syllabus , here I am providing same for you .

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

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

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

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

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

Algorithms
• Analysis
• Sorting
• Asymptotic notation
• Notions of space and time complexity
• Design: Greedy approach
• Divide-and conquer
• Connected components
• Shortest paths
• 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

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