#1
24th August 2015, 10:28 AM
| |||
| |||
ONGC Recruitment Computer Science
Hello sir I am Lakshay , as I am preparing for the ONGC entrance exam to be held in june so kindly could you please send me the syllabus for computer science for this exam. ??
|
#2
24th August 2015, 10:29 AM
| |||
| |||
Re: ONGC Recruitment Computer Science
The selection in ONGC will be on the basis of a written exam and interview. Test Duration: 3 hours Paper Pattern of ONGC Test is objective as well as subjective (descriptive): 1) General Awareness (50 Marks): a. 50 Objective Questions (40 to be attempted, 1 Mark each) b. 2 Descriptive Type Questions (5 Marks Each) 2) Subject Specialization (100 Marks) a. 75 Objective Questions (60 to be attempted, 1.5 mark each) b. 2 Descriptive Type Questions (5 Marks Each) The specialization section has questions from the discipline in which the candidate has completed the degree for eligibility e.g. Electrical, Mechanical etc. Here as per your demand I am providing you the syllabus for Computer Science in ONGC 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 router |
|