BPCL Syllabus for Computer Science

Hi I am interested in having the details of the placement examination as well as the syllabus for the Computer Science subject?

The Bharat Petroleum Corporation Limited (BPCL) conducts the enlistment exam consistently for the post of MT (Management Trainees) separately.

Qualification for Exam:

The candidates ought to be graduation passed in designing from an UGC perceived college/school for this reason. The hopefuls ought to have finished 60% imprints (for General Candidates) in the qualifying exam i.e. B.Tech and 50% (SC/ST/PWD) hopefuls individually. The qualifying periods of the considerable number of candidates ought to be not surpassing 25 years for qualification to the Management Trainee posts.

Example of Examination:

The candidates must show up and qualify in a target sort exam having different decision construct questions in light of the accompanying two fundamental examinations:

Part I-General Aptitude Test
Part II-Technical/Professional Knowledge Test The General Aptitude Test should comprise of specialized test from the accompanying five orders: Electrical; Mechanical; Computer Science; Fire Engineering and Human Resources individually. Sorts of Questions asked incorporate the accompanying: Synonyms/Antonyms/Comprehension Passage/Word Analogies/Fill in the sentences with appropriate words/Aptitude Problem Solving Skills and so forth.

View here for BPCL Exam Result points of interest
The composed exam should be trailed by the accompanying examinations:

1) Group Discussion (GD)
2) Interview
3) Psychometric Test

The Psychometric Test might constitute addresses essentially to survey the behavioral measurements of the candidates. The candidates ought to have qualified in the GATE (Graduate Admission Test for Engineering) exam for qualifying in the concerned post.

Detailed Syllabus for Computer science Exam

Programming & Data Structures:

Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

Algorithms:

Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, and shortest paths.

Computer Organization:

Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).

Digital Logic:

Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

Computer Networks:

Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

Operating Systems:

Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

Databases:

ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.

Compiler Design:

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

Theory of computation:

Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.

Microprocessor:

8-bit microprocessor (8085): architecture, programming, memory and I/O interfacing.

Software Engineering & Web Technology:

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. HTML, XML, Scripting, basic concepts of client-server computing.

Image processing:

Image Registration, Spatial Fourier Transforms, Discrete Spatial ( 2 dimensional ) Fourier Transforms, Restoration, Lossy Compression of images. Data Compression Techniques: Representation and compression of text, sound, picture, and video files ( based on the JPEG and MPEG standards ).

Engineering Mathematics:

Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring.
Combinatorics: counting, recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

__________________
Answered By StudyChaCha Member