Syllabus for ONGC Graduate Trainee Exam

I want the Syllabus for ONGC Graduate Trainee Exam so please provide me this?

[Kiran Chandar]

As you need the syllabus of ONGC Graduate Trainee Exam so here I am providing you

ONGC Exam Syllabus & paper Pattern:

This ONGC exam consists of two papers
1. General Awareness
There are 50 questions, each question carries one mark. And candidates should attempt 40 questions. Each descriptive have 5 marks and objective question have 1 marks.

2. Subject Specialization
There are 75 questions will be given and candidates should be attempt 60 Qs. of 75 Qs. Here descriptive Qs. have 5 marks and objective question have 1.5 marks.

(a). Syllabus for Aptitude Test Section
Quantitative Aptitude
Comprehension based questions Reasoning
Numerical Ability
DI (Data Interpretation)

Duration of Exam- 3 Hours

Address
ONGC
Thiruvarur, Tamil Nadu 614703 ‎

[MAP]https://maps.google.co.in/maps?q=ONGC,+&hl=en&ll=12.715368,79.870605&spn=5.8 16779,10.458984&sll=12.683215,80.211182&sspn=5.817 513,10.458984&hq=ONGC,&t=m&z=7[/MAP]

Will you provide me the ONGC Graduate Trainee exam syllabus for CS students ?

[Quick Sam]

As you want I am here providing you the ONGC Graduate Trainee exam syllabus for CS students.

Written test (Objective Type) comprising of three sections
total duration of 03 hours.

Sections
General Awareness,
Concerned subject,

General awareness:
Related to sports, politics, history, entertainment, geography, famous peoples, world events, major sporting events etc.

Aptitude section:
Time and distance, ratio and proportion, profit & loss, permutation & combinations, probability, ratios & proportions, decimals, fractions, reading comprehensions, verbal & non verbal reasoning and data interpretation etc.

Computer Science and Information Technology:

Engineering Mathematics
Mathematical Logic: Propositional Logic; First Order Logic.

Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.

Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Computer Science And Information Technology

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

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

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.

Web technologies: HTML, XML, basic concepts of client-server computing.