2023 2024 EduVark > Education Discussion > Entrance Exams


  #2  
June 20th, 2016, 09:28 AM
Super Moderator
 
Join Date: Mar 2012
Re: ONGC Entrance Exam Syllabus for Computer Science

The ONGC GT Written Exam comprises of three parts which are mentioned below:

General Awareness

Concerned Subject - Specific to your Discipline . (EE,ECE,ME,CE,IE,CH)

Aptitude Test

Candidates will be shortlisted for the interview based on GATE 2016 score or CBT marks.

S.No Parameter Marks
1 Written Test/GATE Score 60
2 Interview 15
3 Qualification 25(20 marks for essential and 05 marks for the additional in line higher qualification)
Total 100

ONGC Graduate Trainee Written Test Exam Pattern

The examination is on Computer Based Test. The exam paper consists of Multiple Choice Questions.
Part Subject Number of Questions Duration
I Concerned subject of qualifying degree 80 3 hours
II General Awareness 40
III Aptitude Test 30
Total 150 questions

Here ONGC Entrance Exam Syllabus for Computer Science :

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, Microprocessors (8085) – Architecture, Programming and Interfacing.
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness.

Programming and Data Structures: Programming in C/C++; Functions, Recursion, Parameter passing, Scope, Binding; Classes, Objects, Polymorphism, 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.

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

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

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.

Computer Networks: ISO/OSI and TCP/IP stacks, Ethernet, Flow and error control techniques, Routing algorithms, Congestion control, IP(V4) and its addressing schemes, TCP/UDP and sockets, Basic concepts of hubs, switches, gateways, and routers


Quick Reply
Your Username: Click here to log in

Message:
Options



All times are GMT +5. The time now is 03:34 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