Scribd
Upload
24 views

The Syllabus

The syllabus for computer science covers several topics including digital logic, computer organization and architecture, theory of computation, programming and data structures, algorithms, compiler design, operating systems, databases, and computer networks. Some specific areas mentioned are logic functions, number representation, CPU design, memory systems, programming in C/C++, data structures like lists and trees, algorithm analysis, sorting and searching, compiling, processes, virtual memory, relational databases, and networking protocols.

Uploaded by

Sbindu Bindu
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

The Syllabus

The syllabus for computer science covers several topics including digital logic, computer organization and architecture, theory of computation, programming and data structures, algorithms, compiler design, operating systems, databases, and computer networks. Some specific areas mentioned are logic functions, number representation, CPU design, memory systems, programming in C/C++, data structures like lists and trees, algorithm analysis, sorting and searching, compiling, processes, virtual memory, relational databases, and networking protocols.

Uploaded by

Sbindu Bindu
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

the syllabus is of computer science is as follows: 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 datapath, 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 Pushdown 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 Source: http://entrance-exam.net/forum/general-discussion/syllabus-drdo-written-exams-jobceptam-03-computer-science-4707.html#ixzz1TgH3FDeq

You might also like