Exam pattern, Syllabus for APPSC Computer Science subject Degree Lecturers 2017

Exam pattern, Syllabus for APPSC Computer Science subject Degree Lecturers 2017 in Government Degree Colleges in A.P. Collegiate: APPSC has given the Degree College Lecturers Recruitment 2017 notification and online applications are invited online from qualified candidates to the post of Degree College Lecturers in in Govt Degree Colleges in the State of Andhra Pradesh. The proforma Application will be available on 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 mid night). APPSC Degree College Lecturers Recruitment 2017 notification no.26/2016 and apply online now @ http://appscapplications17.apspsc.gov.in/

Scheme of Exam:
PART-A: Written ‘Examination (Objective Type)
Papers No. of Questions Duration (Minutes) Maximum Marks
Paper-1: General Studies & Mental Ability 150 150 150
Paper-2:  Computer Science subject 150 150 300
PART-B: Interview (Oral Test) 50
NEGATIVE  MARKS: As per G.O.Ms. No.235, Finance (HR-I, Plg & Policy) Dept., Dt. 06/12/2016, for each wrong answer will be penalized with 1/3rd of the marks prescribed for the question.

READ | APPSC Degree Lecturers Recruitment

Computer Science Subject Syllabus:
19.Computer Science:
7. Mathematical Foundations:
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.

8. Programming :
Programming in C, C++ and Java: Object Oriented Programming Concepts including Classes; Polymorphism, Inheritance and Programming in C, C++ and Java.

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

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

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

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

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

14. 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.
15. 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.
10. Computer Networks:
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).

11. Software Engineering:
Software Characteristics, Software Process Models, Analysis, Design, Coding, Testing, and Software Quality Assurance, Software Metrics.
12. 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.
13. 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.
14. Distributed Operating Systems:
Goals, Client-Server Model, Synchronization in distributed systems, Distributed
Process Management and File Systems, Distributed Shared Memory.
15. Web Technologies:
HTML, XML, Basic Concepts of Client Server computing, Static, Dynamic and
Active Web pages, Client and Server Side Scripting
Exam pattern, Syllabus, Instructions for APPSC Degree Lecturers 2017
Labels:, , , ,

Related Posts


Post a Comment


»»AP Updates»»TS Updates