Sir I am looking for the MPSC Computer Science Lecturer Syllabus for the assistance professor so can you please give me the same

The Maharashtra Public Service Commission (MPSC) is a body created by the Constitution of India to select applicants for civil service jobs

MPSC Computer Science Lecturer Syllabus assistance professor

1) Combinational Circuit Design, Sequential Circuit Design, Hardwired and Microprogrammed

processor design, Instruction formats, Addressing modes, Memory types and organisation,

Interfacing peripheral devices, Interrupts.

Microprocessor architecture, Instruction set and Programming (8085, P-III/P-IV),

Microprocessor applications.

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

3) Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics,

Animation, Graphic standard, Applications.

Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.

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

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

5) Analog and Digital transmission, Asynchronous and Synchronous transmission,

Transmission media, Multiplexing and Concentration, Switching techniques, Polling.

Topologies, Networking Devices, OSI Reference Model, Protocols for-(i) Data link layer,

(ii) Network layer, and (iii) Transport layer, TCP/IP protocols, Networks security, Network

administration.
MPSC Computer Science Lecturer Syllabus assistance professor