APPSC Government Polytechnic Lecturers Computer Engineering Syllabus 2012
APPSC Polytechnic Lecturers Notification 2012 has been released for filling up 49 Polytechnic Lecturers Computer Engineering vacancies in Government Polytechnic Colleges,Andhra Pradesh.Candidates who are desirous for Lecturer jobs in Government polytechnic colleges and satisfy eligibility criteria can apply online from 06-11-2012 to 06-12-2012. Check Paper II Polytechnic Lecturers Computer Engineering Syllabus for Written Examination.
Scheme/Pattern of Written Examination
|Paper-1||General Studies & Mental ability||150 Marks||150 Qns.||150 Minutes|
|Paper-2||Concerned Subject||300 Marks.||150 Qns||150 Minutes|
|PART-B: ORAL TEST (Interview)||50 marks|
Computer Engineering Syllabus
01. Logic families, gates, flip-flops, Multiplexers, decoders, registers, counters, adder circuits, Boolean algebra, Combinational circuit design, minimisation, sequential circuit design,
number systems, inter conversion, number representation, computer organisation, instruction formats, addressing modes, micro-programming, ALU organisation, multiplication and division
algorithms, memory hierarchy, cache and associate memories, virtual memory, memory IC’s, I/Oo organisation schemes, interrupts, arbitration, DMA, IOP, micro processors, interfacing,
pipeline, SIMD and MIMD organisations, proposition and predicate logic’s, methods of deduction, set theory, relations, functions, algebraic structures, lattices, recursion,
combinatorics, graph theory, representation, path matrix, warshall’s algorithm, cyclic and bipartite graphs, planner graphs, Hamiltonian graph, chromatic number, trees, binary tree
traversals, representation of expressions, spanning trees, breadth-first and depth-first algorithms, finite automation, pushdown automation, Turing machine, grammars, type 0, 1, 2,
and 3, LL and LR grammars.
02. Algorithms, flow-charts, programming methodology, data structures, PASCAL, FORTRAN, COBAL and ‘C’ languages, theory of programming languages, file organisation,
searching and sorting; methods, DBMS, database models, query languages, operating system, directory concept, processor scheduling, memory allocation, paging and segmentation, device management, deadlocks and prevention, concurrent processing. DOS and UNIX features, language processors, syntax and semantic analysis, code generation, optimisation, assemblers, loaders and linkers, algorithm design techniques, Computer networks, digital modulation techniques, modems, error detection and error correction, BISYNC and HDLC protocols, OSI model, network routing algorithms, LAN operation methods, Computer graphics, DDA algorithms, graphic primities, 2-D transformations, graphic input devices, software engineering development life-cycle, system analysis, modular design, testing and validation, CASE tools, AI techniques, natural language understanding, learning, knowledge representation, expert systems, LISP, PROLOG.