#1
27th November 2014, 02:09 PM
| |||
| |||
EIL Management Trainee for computer science Syllabus
Will you please tell me which types of questions are asked in EIL Management Trainee for computer science? Also provide me its syllabus?
|
#2
27th November 2014, 03:04 PM
| |||
| |||
Re: EIL Management Trainee for computer science Syllabus
EIL Management Trainee (Computer Science) exam paper contain objective type questions from topics such as Technical Section 100 questions General Aptitude 50 questions Each question carries one mark. There will be negative marking for wrong answers. 0.25 marks will be deducted for every wrong answer. Duration: 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 |
#3
30th March 2015, 03:52 PM
| |||
| |||
Re: EIL Management Trainee for computer science Syllabus
Will you provide me the syllabus of the EIL Management Trainee(Computer Science) examination ?
|
#4
30th March 2015, 03:53 PM
| |||
| |||
Re: EIL Management Trainee for computer science Syllabus
As you want I am here providing you syllabus of the EIL Management Trainee (Computer Science) examination. 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. Syllabus for EIL Management Trainee (Computer Science) Exam 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 |
|