What is the Syllabus for the BARC OCES/DGFS Online Exam for ECE and Computer Science?

The syllabus for the BARC Online Computer Elite Selection (OCES) and Data Gk and Fundamental Skills (DGFS) online exams follows a similar structure to the Graduate Aptitude Test in Engineering (GATE) exam, but with some adjustments to cater to the specific needs of Engineering Computer Science (ECS) and Computer Science (CS) candidates. Here, we detail the key subjects and topics that are essential for preparation.

Technical Subjects in ECS and CS

For engineering and computer science students preparing for PSU (Public Sector Undertaking) examinations such as ISRO, DRDO, NTPC, SAIL, ONGC, BHEL, BARC, BSNL, JRF, SRF, RD Departments, the syllabus is largely the same as that of GATE. However, there are specific focus areas that should be emphasized. Let's break down the key subjects:

Computer Science and Information Technology

Digital Logic

Digital Logic involves understanding logic functions and designing combinational and sequential circuits. Focus on number representation and arithmetic, as well as minimization techniques. Key areas to study include:

Logic functions Minimization of functions Combinational and sequential circuits design and synthesis Number representation and computer arithmetic (fixed and floating point)

Computer Organization and Architecture

Computer Organization and Architecture covers the fundamentals of machine instructions and addressing modes, and the design of the ALU and data path. Topics include:

Machine instructions and addressing modes ALU and data-path design Control design for CPU (central processing unit) Memory interface and I/O interface design Interrupt and DMA (Direct Memory Access) mode CPU instruction pipelining Main memory and secondary storage techniques

Programming and Data Structures

Programming and Data Structures emphasizes skills in C language, functions, recursion, and parameter passing. Focus on abstract data types and types of data structures:

Programming in C Functions and recursion Parameter passing and scope Abstract data types (arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps)

Algorithms

Algorithms requires a solid understanding of analysis time and space complexity, design methodologies, and case analysis:

Analysis of algorithms Asymptotic notation Notions of space and time complexity Design methodologies: Greedy approach, dynamic programming, divide-and-conquer, tree and graph traversals Sorting and searching techniques (best, worst, average case analysis, upper and lower bounds) Complexity classes: P, NP, NP-hard, NP-complete

Theory of Computation

Theory of Computation delves into the basics of regular languages and finite automata, context-free languages, and push-down automata. Key topics include:

Regular languages and finite automata Context-free languages and pushdown automata Recursively enumerable sets and Turing machines Undecidability

Compiler Design

Compiler Design focuses on lexical analysis, parsing, syntax-directed translation, and runtime environments:

Lexical analysis and parsing Syntax-directed translation Runtime environments Intermediate and target code generation Basics of code optimization

Operating Systems

Operating Systems covers processes, threads, inter-process communication, synchronization, concurrency, and deadlock resolution. Key concepts include:

Processes and threads Inter-process communication Concurrency Synchronization techniques Deadlock prevention, detection, and recovery CPU scheduling Memory management and virtual memory File systems and I/O systems Protection and security mechanisms

Databases

Databases focuses on ER-models, relational models, and database design. Key topics include:

ER-models and relational models Relational algebra and tuple calculus Database design and integrity constraints Normal forms (1NF, 2NF, 3NF, BCNF, CNF) Query languages (SQL) File structures, sequential files, and indexing B trees and other tree-based structures Transactions and concurrency control

Information Systems and Software Engineering

Information Systems and Software Engineering entails information gathering, requirement analysis, and project management. Key areas include:

Information gathering and requirement analysis Feasibility studies Data flow diagrams and process specifications Input/output and process design Process life cycle planning and project management Design, coding, testing, and implementation Maintenance of software systems

Computer Networks

Computer Networks covers the ISO/OSI stack, LAN technologies, Ethernet, and token ring networks. Key topics include:

ISO/OSI stack and network protocols LAN technologies (Ethernet, token ring) Flow and error control techniques Routing algorithms Congestion control TCP/UDP and sockets IPv4, ICMP, DNS, SMTP, POP, FTP, HTTP (web protocols) Basics of hubs, switches, gateways, and routers Network security including cryptography, digital signatures, and firewalls

Web Technologies

Web Technologies introduces fundamental concepts of client-server computing and web development. Areas to focus on include:

HTML and XML basics Client-server architecture Basic concepts of web development

A Note on Preparation Tips

Preparing for PSUs and companies like BARC involves a blend of understanding the theoretical concepts and applying them to practical scenarios. It is advisable to practice using previous Gate, IES, and Bits questions to get a better grasp of the exam pattern. Focus on not making the questions too lengthy or complex; instead, aim for a balance between depth and breadth. Stay updated with the latest trends in the field and ensure you cover both the theoretical and practical aspects of the syllabus thoroughly.