Scribd Logo
Upload

Welcome to Scribd!

  • 56 views

    Cil Syllabus PDF

    Uploaded by

    Abhishek Narayan
    The syllabus outlines the sections and topics covered in two papers for a systems post. Paper I covers general topics like general knowledge, numerical ability, reasoning, and English and is worth 100 marks total. Paper II covers 10 technical domains of computer science and is worth 200 marks total. It includes topics like digital logic, computer architecture, programming, algorithms, theory of computation, compiler design, operating systems, databases, computer networks, and network security. Candidates will be tested on their knowledge of these fundamental computer science concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Cil Syllabus PDF

    Uploaded by

    Abhishek Narayan
    56 views1 page
    The syllabus outlines the sections and topics covered in two papers for a systems post. Paper I covers general topics like general knowledge, numerical ability, reasoning, and English and is worth 100 marks total. Paper II covers 10 technical domains of computer science and is worth 200 marks total. It includes topics like digital logic, computer architecture, programming, algorithms, theory of computation, compiler design, operating systems, databases, computer networks, and network security. Candidates will be tested on their knowledge of these fundamental computer science concepts.

    Original Title

    cil_syllabus.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The syllabus outlines the sections and topics covered in two papers for a systems post. Paper I covers general topics like general knowledge, numerical ability, reasoning, and English and is worth 100 marks total. Paper II covers 10 technical domains of computer science and is worth 200 marks total. It includes topics like digital logic, computer architecture, programming, algorithms, theory of computation, compiler design, operating systems, databases, computer networks, and network security. Candidates will be tested on their knowledge of these fundamental computer science concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    56 views1 page

    Cil Syllabus PDF

    Uploaded by

    Abhishek Narayan
    The syllabus outlines the sections and topics covered in two papers for a systems post. Paper I covers general topics like general knowledge, numerical ability, reasoning, and English and is worth 100 marks total. Paper II covers 10 technical domains of computer science and is worth 200 marks total. It includes topics like digital logic, computer architecture, programming, algorithms, theory of computation, compiler design, operating systems, databases, computer networks, and network security. Candidates will be tested on their knowledge of these fundamental computer science concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Syllabus for the post of Systems

    Section name Total


    Sections
    Marks
    PAPER I
    Part-1 General Knowledge/ Awareness 25 Marks
    Part-2 Numerical Ability 25 Marks
    Part-3 Reasoning 25 Marks
    Part-4 General English 25 Marks
    PAPER II
    Domain Knowledge

    Section 1: Digital Logic


    Boolean algebra. Combinational and sequential circuits, minimization, number
    representations and computer arithmetic (fixed and floating point).

    Section 2: Computer Organization and Architecture


    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).

    Section 3: Programming and Data Structures


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

    Section 4: 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, shortest path.

    Section 5: Theory of Computation


    Regular expressions and finite automata. Context-free grammars and push-down
    100
    Part-5 automata. Regular and contex-free languages, pumping lemma. Turing machines and
    Marks
    undecidability.

    Section 6: Compiler Design


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

    Section 7: Operating System


    Processes, threads, inter‐process communication, concurrency and synchronization.
    Deadlock, CPU, Scheduling, Memory Management and virtual memory, File Systems

    Section 9: 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.

    Section 10: 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). Basics of Wi-Fi. Network security: authentication, basics of public
    key and private key cryptography, digital signatures and certificates, firewalls.

    200
    Total
    Marks

    You might also like