Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Computer-Science-Syllabus

    Uploaded by

    6632ronithkoundinya

    Copyright:

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

    Computer-Science-Syllabus

    Uploaded by

    6632ronithkoundinya
    9 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    9 views3 pages

    Computer-Science-Syllabus

    Uploaded by

    6632ronithkoundinya

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Computer Science

    UNIT 1. DISCRETE STRUCTURES AND DIGITAL LOGIC

    1. Propositional Logic, Predicate calculus, Sets, Relations, Functions, Inclusion-Exclusion


    Principle, Equivalence and Partial Orderings, Elementary Counting Techniques.
    2. Computability: Models of computation-Finite Automata, Pushdown Automata, Non-determinism
    and NFA, DPDA and PDAs and Languages accepted by these structures, Grammars, Languages,
    Non-computability and Examples of non-computable problems.
    3. Graph: Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles
    and circuits. Tree and rooted tree, Spanning trees, Eccentricity of a vertex radius and diameter
    of a graph, central Graphs, Centers of a tree, Hamiltonian and Eulerian graphs, Planar graphs,
    Graph Coloring.
    4. Groups: Finite fields and Error correcting/ detecting codes.
    5. Logic Families: TTL, ECL, and C-MOS gates, Boolean algebra and Minimization of Boolean
    functions, Flip-flops-types, race condition and comparison, Design of combinational and
    sequential circuits.
    6. Representation of Integers: Octal, Hexadecimal, Decimal, and Binary, 2’s complement and 1’s
    complement arithmetic, Floating point representation.
    7. Arithmetic: Addition and subtraction of signed Numbers, Design of Fast Adders, Multiplication
    of positive Numbers, Signed-operand multiplication , Fast multiplication, Integer Division,
    Floating-point Numbers, (IEEE754 s…) and operations.

    UNIT 2. PROGRAMMING IN C AND C++

    1. Programming in C: Elements of C-Tokens, identifiers, data types in C, Control structures in C,


    Sequence, selection and iterations, Structured data types in C-arrays, structure, union, string
    and pointers.
    2. Object Oriented Programming Concepts: Class, object, instantiation, Inheritance.
    Polymorphism and Overloading.
    3. C++ Programming: Elements of C++ -Tokens, identifiers, Variables and constants, Data types,
    Operators, Control statements, Functions parameter passing, Class and objects, Constructors
    and destructors, Overloading, Inheritance, Template, Exception handling.

    UNIT 3. DATA STRUCTURES AND ALGORITHMS

    1. Data, Information, Definition of data structure, Arrays, stacks, queues, linked lists, trees,
    graphs, priority queues and heaps.
    2. File Structures: Fields, records and files, Sequential, direct, index-sequential and relative files,
    Hashing, inverted lists and multi-lists, B trees and B+ trees.
    UNIT 4. ARCHITECTURE AND OPERATING SYSTEMS

    1. Main functions of operating systems, Multiprogramming, Multiprocessing, and Multitasking.


    2. Memory Management: Virtual Memory, Paging, Fragmentation.
    3. Concurrent Processing: Mutual exclusion, Critical regions, lock and unlock.
    4. Scheduling: CPU scheduling, I/O scheduling, Resource scheduling, Deadlock and scheduling
    algorithms, Banker’s algorithm for deadlock handling.

    UNIX

    5. The Unix System: File system, process management, bourne shell, shell variables, command
    line programming.
    6. Filters and Commands: Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep,
    etc., sed, awk, etc.
    7. System Calls (like): Create, open, close, read, write, iseek, link, unlink, stat, fstat, unmask,
    chmod, exec, fork, wait, system.

    UNIT 5. COMPUTER NETWORKS AND DATABASES

    1. Network fundamentals: Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide
    Area Networks (WAN), Wireless Networks. Reference Models: The OSI model, TCP/IP model.
    2. Data link control: Channel capacity, Transmission media -twisted pair, coaxial cables, fiber-
    transmission –radio, microwave, infrared and millimeter waves, Light wave transmission,
    Telephones –local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN,
    ATM, High speed LANS, Cellular Radio, Communication satellites -geosynchronous and low-
    orbit, Switch/Hub, Bridge, Error detection and correction, Flow control.
    3. Internetworking: Router, Gateways, Concatenated virtual circuits, Tunneling, Fragmentation,
    Firewalls. Routing: Virtual circuits and datagrams, Routing algorithms, Congestion control and
    avoidance, TCP Congestion management policy.
    4. Cryptography and Protocols of network applications: Public key, secret key, Domain Name
    System (DNS) -Electronic Mail and World Wide Web (WWW), The DNS, Resource Records, Name
    servers, E-mail-architecture and Servers, Web server, HTTP.
    5. ER diagrams and their transformation to relational design, normalization –1NF, 2NF, 3NF, BCNF,
    4NF. Limitations of 4NF and BCNF.
    6. SQL: Data Definition Language (DDL), Data Manipulation Language (DML), Data Control
    Language (DCL) commands, Database objects like –Views, indexes, sequences, synonyms, data
    dictionary.
    7. SYSTEM SOFTWARE AND COMPILERS

    1. Assembly language fundamentals (8085 based assembly language programming). Assemblers –2-
    pass and single-pass, Macros and macro processors.
    2. Loading, linking, relocation, program relocatability, Linkage editing.
    3. Text editors, Programming Environments, Debuggers and program generators.
    4. Compilation and Interpretation, Bootstrap compilers, Phases of compilation process, Lexical
    analysis, Lex package on UNIX SYSTEM.
    5. Context free grammars, Parsing and parse trees, Presentation of parse (derivation) trees as
    rightmost and leftmost derivation, bottom-up parsers –shift-reduce, operator precedence, and
    LR, YACC package on UNIX system.
    6. Top-down parsers –left recursion and its removal, Recursive descent parser, Predictive parser,
    Intermediate codes –Quadruples, Triples, Intermediate code generation, Code generation, Code
    optimization.

    You might also like