1. #1
    Talwinder Array
    Join Date
    Aug 2012
    Posts
    1

    New syllabus of Computer Science for PCS?

    Respcted sir I have done B.tech in information technologyI want to know syllabus of computer science which is new optional subject in PCS examPlz send me link for syllabus

  2. #2
    Unregistered

    Re: New syllabus of Computer Science for PCS?

    hi..
    I have done b.tech in Computer Engineering. I want to do PCS. So, please provide me syllabus for the preparation of PCS exams.

    Inderpal Singh

  3. #3
    arunasharao Array
    Join Date
    Oct 2012
    Location
    kakinada
    Posts
    65

    Re: New syllabus of Computer Science for PCS?

    NEW COMPUTER SCIENCE syllabus
    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.
    Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; 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. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.
    Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
    Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
    Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
    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.
    Information Systems and Software Engineering: 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.
    Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.
    Web technologies: HTML, XML, basic concepts of client-server computing.

  4. #4
    avishkumar Array
    Join Date
    Oct 2012
    Posts
    15

    Re: New syllabus of Computer Science for PCS?

    hi frnds


    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.

    Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; 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. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

    Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

    Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.


    all the best


+ Reply to Thread

Quick Reply Any Question?

Similar Threads

  1. Replies: 14
    Last Post: 11-09-2013, 06:11 PM
  2. Replies: 76
    Last Post: 16-07-2013, 10:50 PM

istanbul escort

gaziantep escort

istanbul escort

porno izle

istanbul escort

istanbul escort

istanbul escort
istanbul escort

istanbul escort

bedava bahis

mobil ödeme bahis

mobil ödeme bahis

canlı bahis

deneme bonusu

deneme bonusu

bahis siteleri

mobil ödeme bahis

casino siteleri

kaçak bahis siteleri

deneme bonusu veren siteler