PPSC Lecture computer Science Syllabus and Preparation Guideline 2020 | GAT subject Computer Science test is being conducted at Lecture level jobs in Punjab Public Service commission. Subject related tests are composed of all important and core subject areas being taught at Intermediate, BA/Bsc and Master’s Level Degree. Hence PPSC Lecturer computer science Jobs 2020 Syllabus for Computer Science Aspirants would cover these key areas. PPSC Competitive exam and its SYLLABUS FOR THE SUBJECT OF COMPUTER SCIENCE optional subject and GAT- Subject Computer sciences areas are more than 90% same. Furthermore, we offer 100% free ppsc tesprepation online for lecturer computer science.
PPSC SYLLABUS FOR THE SUBJECT OF COMPUTER SCIENCE in PMS
Introduction to Computing : Number Systems, Binary numbers, Boolean logic, History Computer system, basic machine organization, Von Neumann Architecture, Algorithm definition, design, and implementation, Programming paradigms and Languages, Graphical programming, Overview of Software Engineering and Information Technology, Operating system, Compiler, Computer networks and Internet, Computer graphics, Al, Social and legal issues.
Programming Solving Techniques : Algorithms and problem solving, development of basic Algorithms, analyzing problem, designing solution, testing designed solution, fundamental programming constructs, translation of algorithms to programmes, data types, control structures, functions, arrays, records, files, testing programmes. C++ or Java Based Questions.
Computer Communications & Networks :Analogue and digital Transmission, Noise, Media, Encoding, Asynchronous and Synchronous transmission, Protocol design issues, Network System architecture (OSI, TCP/IP), Error control, Flow Control, Data Link Protocols (HDLC,PPP). Local Area Networks and MAC Layer protocols (Ethernet, Token ring), Multiplexing, Switching and IP Networks, Internetworking, Routing, Bridging, Transport layer protocols TCP/IP, UDP. Network security issues, Programming exercises or projects involving implementation of protocols at different layers.
Digital Logic & Computer Architecture : Logic design of Digital Systems, Fundamental and advanced concepts of Logic Designs, Boolean Algebra & functions, Designing and implementation of combinational and Sequential logic, minimization techniques, number representation and basic binary arithmetic Logic families and digital integrated circuits, use of CAD tools for logic designs. Topics of Computer Architecture.
Data Structures & Algorithms : Basic database concepts; Entity Relationship modeling, Relational data model and algebra, Structured Query Language, RDBMS, Database design, functional dependencies and normal forms, Transaction processing and optimization concepts, concurrency control and recovery techniques, Database recovery techniques, Database security and authorization, Small Group Project implementing a database, Physical database design. Storage and file structure, indexed files, hashed files, signature files, b-trees, files with dense index, file with variable length records, database efficiency and tuning.
Operating Systems : History and Goals, Evolution of multi-user systems, Process and CPU management, Multithreding, Kernel and User Modes, Protection, Problems of cooperative processes, Synchronization, Deadlocks, Memory management and virtual memory, Relocation, External Fragmentation, Paging and Demand Paging, Secondary storage, Security and Protection, File systems, I/O systems, Introduction to distributed operating systems. Scheduling, dispatch and Introduction to concurrency.
Theory of Automata and Formal Languages : Finite State Models: Language definitions preliminaries, Regular expressions/Regular languages, Finite automatas (FAs), Transition graphs (TGs),NF As, kleene’s theorem, Transducers (automata with output), Pumping lemma and non regular language Grammars and PDA: Context free grammars, Derivations, derivation trees and ambiguity, Simplifying CFLs , Normal form grammars and parsing, Push-down Automata, Pumping lemma and non-context free languages, Decidability, Chomsky’s hierarchy of grammars, Turing Machines Theory: Turing machines, Post machine, Variations on 1M, 1M encoding, Universal Turing Machine, Context sensitive Grammars, Defining Computers by TMs.
Numerical Methods : Mathematical Preliminaries, Solution of Equations in one variable, Interpolation and Polynomial Approximation, Numerical Differentiation and Integration, Initial Value Problems for Ordinary Differential Equations, Direct Methods for Solving Linear Systems, Iterative Techniques in Matrix Algebra, Solution of non-linear equations, Approximation Theory, Eigenvalues and Eigenvector computation.
Data Base Systems : Basic database concepts, Entity Relationship modelling, Relational data model and algebra, Structured Query language, RDBMS; Database design, functional dependencies and normal forms, Transaction processing and optimization concepts, concurrency control and recovery techniques, Database recovery techniques, Database security and authorization. Small Group Project implementing a database. Physical database design: Storage and file structure, indexed files, hashed files, signature files, b-trees, files with dense index, files with variable length records, database efficiency and tuning Data Warehousing and Data Mining, Emerging Database Technologies and Applications.
Software Engineering : Software Engineering, Process Models, Software verification and validation. Techniques are introduced to evaluate software correctness, efficiency, performance and reliability, integration of these techniques into a verification and validation plan. Technical reviews, software testing, programme verification, prototyping, and requirement tracing. Attitude of industry toward reliability and performance.
Artificial Intelligence : Introduction to Common Lisp. AI classical systems: General Problem Solver, rules, simple search, means-ends analysis. ElIZA, pattern matching, rule based translators, OPS-5. Knowledge Representation: Natural language, rules, productions, predicate logic, semantic networks, frames, objects, scripts. Searching, Depth first search, breadth first search, best first search, hill climbing, min-max search. Symbolic Mathematics: student solving algebra problems, translating English equations, solving algebraic equations, simplification rules, rewrite rules, meta-rules, Macsyma, PRESS, ATLAS. Logic Programming: Resolution, unification, horn-clause logic, Prolog, Prolog programming. Sample case studies of shells and Knowledge Based Systems. A brief appreciation of state of the art computational techniques like neural networks, genetic algorithm, fuzzy sets.
Computer Graphics : Graphics hardware, Fundamental algorithms, Applications of graphics. Interactive graphics programming -graph plotting, windows and clipping, and segmentation. Programming raster display systems, panning and zooming. Raster algorithms and software Scan-Converting lines, characters and circles. Region filling and clipping. Two and three dimensional imaging geometry and transformations. Curve and surface design, rendering, shading, colour and animation.
GAT- Computer Science core subjects and curriculum
|Sr. No.||Core Areas||Percentage|
|1.||Computer and Programming Fundamentals||06%|
|2.||Object Oriented Paradigm||05%|
|4.||Data Structures and Algorithms||09%|
|5.||Digital Logic and Computer Organization||06%|
|8.||Software Engineering & Development||05%|
|9.||Computer Communication and Networks||06%|
|10.||Computer Architecture & Assembly Language||08%|
|11.||Theory of Automata and Formal Languages||10%|
|12.||Analysis of Algorithms||10%|
PPSC Lecturer Computer Science Syllabus and Test Pattern
Ppsc did not issued lecturer computer Science syllabus. We are predicting this as tentative ppsc lecturer computer science syllabus by self intuition. There is a test of 100 marks which is later halved ie the marks obtained from 50 marks are counted instead of 100. For example if you have obtained 60 marks out of 100 in the test then out of your 50 marks. There will be 30 counts. The test consists of 100 MCQs (80 of the article and 20 of the General Knowledge etc.). One number is given for a correct answer while 0.25 is given for a wrong answer.
You are called for an interview based on your performance in the test. 5 times more candidates are called for interview than the number of seats in an article. Suppose if there are 80 seats in Physics then the above 400 = (80 × 5) candidates will be called for interview based on the test result. The final candidate’s mark will be this year’s closing merit.
The interview is numbered 100. It has a minimum of three and a maximum of four people, including a ppsc representative, two related subjects and a psychologist. Sometimes a psychologist does not.
Start Test Preparation For Compter Science Online
TheITeducation helping aspirants of Lecturer Comouter sciences in their ppsc lecturer preparation. Daily Online lectures on YouTube channel “TheITeducation” well as short psd notes. Additionally, Daily Online qyize based on Solved Mcqs is cobduted. Students are given online lecture first, secondly provided ppsc computer science pdf notes and then online quize with answers. Get started right now.
GAT Computer Science Syllabus
|Computer Science (Detailed)|
|Sr. No.||Core Areas||Percentage|
|1.|| PROGRAMMING FUNDAMENTALS:|
Overview of computers and programming.Overview of language.Basics of structured and Modular programming.Basic Algorithms and problem solving, development of basic algorithms, analyzing problem, designing solution, testing designed solution. Fundamental programming constructs, translation of algorithms to programmes, data types, control structures, functions, arrays, records, files, testing programmes.
|2.|| OBJECT ORIENTED PARADIGM:|
Evolution of Object Oriented (OO) programming, OO concepts and principles, problem solving in OO paradigm, OO programme design process, classes, methods, objects and encapsulation; constructors and destructors, operator and function overloading, virtual functions, derived classes, inheritance and polymorphism. I/O and file processing, exception handling.
|3.|| DISCRETE STRUCTURES:|
Introduction to logic and proofs: Direct proofs; proof by contradiction, Sets, Combinatronics, Sequences, Formal logic, Prepositional and predicate calculus, Methods of Proof, Mathematical Induction and Recursion, loop invariants, Relations and functions, Pigeonhole principle, Trees and Graphs, Elementary number theory, Optimization and matching. Fundamental structures: Functions; relations (more specifically recursions); pigeonhole principle; cardinality and countability, probabilistic methods.
|4.||DATA STRUCTURES AND ALGORITHMS: Introduction to data structures; Arrays, Stacks, Queues, Priority Queues, Linked Lists, Trees, Spanning Trees, Graphs and Traversals. Recursion, sorting and searching algorithms, Shortest path algorithms, Hashing, Storage and retrieval properties and techniques for the various data structures. Algorithm Complexity, Polynomial and Intractable Algorithms, Classes of Efficient Algorithms, Divide and Conquer, Dynamic, Greedy||9%|
|5.||DIGITAL LOGIC AND COMPUTER ORGANIZATION: 5.1 Digital Logic_______________________________________3% Overview of Binary Numbers, Boolean Algebra, switching algebra, and logic gates, Karnaugh Map and Quin-McCluskey methods, simplification of Boolean functions, Combinational Design; two level NAND/NOR implementation, Tabular Minimization, Combinational Logic Design: adders, subtracters, code converters, parity checkers, multilevel NAND/NOR/XOR circuits, MSI Components, design and use of encoders, decoders, multiplexers, BCD adders, and comparators, Latches and flip-flops, Synchronous sequential circuit design and analysis, Registers, synchronous and asynchronous counters, and memories, Control Logic Design. 5.2 Computer Organiztion________________________________3% Fundamentals of Computer Designincluding performance measurements & quantitative principles, principles of Instruction Set Design, Operands, addressing modes and encoding, pipelining of Processors: Issues and Hurdles, exception handling features, Instruction-Level Parallelism and Dynamic handling of Exceptions, Memory Hierarchy Design, Cache Design, Performance Issues and improvements, Main Memory Performance Issues, Storage Systems, Multiprocessors and Thread Level Parallelism.||6%|
|6.|| OPERATING SYSTEMS:|
History and Goals, Evolution of multi-user systems, Process and CPU management, Multithreading, Kernel and User Modes, Protection, Problems of cooperative processes, Synchronization, Deadlocks, Memory management and virtual memory, Relocation, External Fragmentation, Paging and Demand Paging, Secondary storage, Security and Protection, File systems, I/O systems, Introduction to distributed operating systems. Scheduling and dispatch, Introduction to concurrency.