APPSC Computer Science Degree Lecturers Exam Pattern & Syllabus, APPSC has given the Degree College Lecturers Recruitment notification and online applications are invited online from qualified candidates to the post of Degree College Lecturers in Govt Degree Colleges in the State of Andhra Pradesh.
The proforma Application will be available on the Commission’s Website (www.psc.ap.gov.in) from 29/12/2016 to 28/01/2017 (Note: 27/01/2017 is the last date for payment of fee up- to 11:59 midnight). APPSC Degree College Lecturers Recruitment notification no.26/2016 and apply online now @ http://appscapplications17.apspsc.gov.in/
Scheme of Exam: APPSC Computer Science Degree Lecturers Exam Pattern & Syllabus
|Papers||No. of Questions||Duration (Minutes)||Maximum Marks|
|PART-A: Written ‘Examination (Objective Type)|
|Paper-1: General Studies & Mental Ability||150||150||150|
|Paper-2: Computer Science subject||150||150||300|
|PART-B: Interview (Oral Test)||50|
As per G.O.Ms. No.235, Finance (HRI, Plg & Policy) Dept., Dt.06/12/2016, for each wrong answer will be penalized with 1/3rd of the marks prescribed for the question.
Computer Science Subject Syllabus: APPSC Computer Science Degree Lecturers Exam Pattern & Syllabus
Mathematical Logic – Propositional Logic, First Order Logic; Probability: Conditional Probability, Mean, Median, Mode, and Standard deviation; Random Variables; Distributions – Uniform, Normal, Exponential, Poisson, Binomial. Set Theory and Algebra: Sets, Relations, Functions, Groups, Partial Orders, Lattices, Boolean Algebra. Combinatorics: Permutations, Combinations, Counting, Summation, Generating Functions, Recurrence Relations.
Programming in C, C++, and Java: Object-Oriented Programming Concepts including Classes; Polymorphism, Inheritance, and Programming in C, C++, and Java.
Data and File Structures:
Data structure – Definition; Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps. File Structures – Fields, records and files, Sequential, direct, index-sequential and relative files, Hashing, inverted lists and multi-lists B trees and B+ trees.
Design and Analysis of Algorithms:
Asymptotic notation, Notations of Space and Time complexities, 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 and average cases) of time and space, upper and lower bounds.
Principles of Programming Languages: BNF, Variables, Data Types, Control Structures, Scope and Extent, Data Abstraction, Concurrency concepts, Exception Handling, Functional Programming, and Logic Programming. Scripting Languages.
Theory of Computation and Compiler Design:
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.
Digital Logic Design and Computer Organization:
Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating-point). Machine instructions and addressing modes, Main Memory Organization, CPU Organization, I/O Organization, Micro-programmed Control, Cache Memory, Secondary Storage.
Operating Systems and Unix:
Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection, and security.
Unix System – File system, process management, bourne shell, Shell variables, command-line programming. Filters and Commands – Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep, etc., sed, awk, etc. System Calls (like) – Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
Relational Database Design and SQL
E R diagrams and their transformation to relational design, normalization – 1NF, 2NF, 3NF, BCNF and 4NF, Limitations of 4NF and BCNF. SQL – Data Definition Language (DDL), Data Manipulation Language (DML), Data
Control Language (DCL) commands. Database objects like-Views, indexes, sequences, synonyms, data dictionary.Transaction Management, concurrency control, and system recovery.
ISO/OSI stack, LAN technologies, (Ethernet and 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).
Software Characteristics, Software Process Models, Analysis, Design, Coding, Testing, and Software Quality Assurance, Software Metrics.
Cryptography and Network Security:
Data Encryption and Decryption, Symmetric Key algorithms like DES, IDEA and AES, Public Key Cryptography, RSA algorithm, Digital Signatures & Authentication, Firewalls, and VPN.
Data Warehousing and Mining:
Data Warehousing Concepts and Architectures, OLAP, Data Pre-processing, Data Cube Technology, Data mining Functionalities, Primitives, Data Characterization, Association Mining, Classification and regression, Clustering and Outlier Analysis.
Distributed Operating Systems:
Goals, Client-Server Model, Synchronization in distributed systems, Distributed Process Management and File Systems, Distributed Shared Memory.
HTML, XML, Basic Concepts of Client Server computing, Static, Dynamic and
Active Web pages, Client and Server Side Scripting