State Level Eligibility Test

SLET: Computer Sciences

Code No.:19
Subject : COMPUTER SCIENCE AND APPLICATIONS
SYLLABUS AND SAMPLE QUESTIONS

PAPER-III (A)
[Core Group]

Unit-I
Combinational Circuit Design, Sequential Circuit Design, Hardwired and Microprogrammed processor design, Instruction formats, Addressing modes, Memory types and organization, Interfacing peripheral devices, Interrupts. Microprocessor architecture, Instruction set and Programming (8085, P-III/P-IV), Microprocessor applications.

Unit-II
Database Concepts, ER diagrams, Data Models, Design of Relational Database, Normalisation, SQL and QBE, Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems (Concepts, Composite objects, Integration with RDBMS applications), ORACLE.

Unit-III
Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications. Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.

Unit-IV
Programming language concepts, paradigms and models

Data. Data types, Operators, Expressions, Assignment. Flow of Control –Control structures, I/O statements, User-defined and built in functions, Parameter passing.

Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation. Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation, equations and pattern matching.

Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in prolog, implementation of prolog, example programs in prolog.

Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs In PVM paradigm as well as MPI paradigm for simple problems like matrix multiplication. Preconditions, post-conditions, axiomatic approach for semantics, correctness.denotational semantics.

Compiler structure, compiler construction tools, compilation phases. Finite Automata, Pushdown Automata. Non-determinism and NFA. DPDA. and PDAs and languages accepted by these structures. Grammars, Languages—types of grammars—type 0, type 1, type 2, and type 3. The relationship between types of grammars, and finite machines.

Pushdown automata and Context Free Grammars. Lexical Analysis—regular expressions and regular languages. LEX package on Unix. Conversion of NFA to DFA. Minimizing the number pf states In a DFA. Compilation and Interpretation. Bootstrap compilers.

Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as rightmost and leftmost derivations. Bottom up parsers—shift-reduce, operator precedence, and LR. YACC package on Unix system. Topdown parsers—left recursion and its removal.

Recursive descent parser. Predictive parser, Intermediate codes—Quadruples, triples. Intermediate code generation, code generation. Code optimization