In our previous posts, you can see. Candidates must ensure the before applying for this post. Subjects Marks per question Number of question Total marks Negative marking Duration of Exam 1. Mental ability and reasoning ability 1 20 20 0. General Awareness 1 20 20 0. Questions of Computer Science 1 200 200 0. Instruction Sets: Characteristics and Function, Machine Instruction Characteristics, Types of Operands, Types of Operation, Addressing Modes and Formats, Register Organization, The Instruction Cycle, Instruction Pipelining. Reduced Pgt computer science Set Computer: An Introduction. Device Management: Service management approaches, buffering, device drivers, performance tuning. Scheduling: Scheduling Mechanisms, Strategy selection, non-pre-emptive and preemptive strategies. Synchronization Principles: Interactive processes, critical section, deadlock, coordinating processes, semaphores, spread memory, multiprocessors, events, monitors and the inter-process communication. Memory Management: Mapping address space to memory space, memory allocation strategies, fixed partition, variable partition, segmentation. File Management: Directory structure, basic file operations and their implementation. Protection and Security: Policy mechanism, authentication, internal access authorization. Number system and Codes: Primary, Octal, Hexadecimal, Signed Numbers Codes, hamming codes. Multiplexers, Demultiplexers, Adders and Subtracters, multipliers, Comparators, Parity generators and checkers, Code converters, Priority Encoders, Decoders. Problem Solving Approaches: Notion of an algorithm, problem solving using top-down design and decomposition into sub-problems, stepwise methodology of developing an algorithm, methodology of developing an algorithmic solution from a mathematical specification of the problem, use of recursion for problems with inductive characterization. Numerical and non-numerical applications using above concepts. Programming with Data structures: Stacks, queues, lists, trees and balanced binary trees, specification of exception conditions and exception handling, notion of efficient algorithmic solution, efficient representations of data structures e. Object Oriented Programming: Concept of Object Oriented Programming- Data hiding, Data encapsulation, Class and Object, Abstract class and Concrete class, Polymorphism Implementation of polymorphism using Function overloading as an example in C++ ; Inheritance, Advantages of Object Oriented Programming over earlier programming methodologies. Reference variables and use of alias; Function call pgt computer science reference. Data Dictionary, Data Warehousing, Data Mining, Meta Data; Object Modeling: Introduction to object oriented modeling using Unified Modeling Language Concepts only. Client Server Computing: Concept of Client Server Computing. Basic Syntax; Creating and saving cascading style sheets. Else, Select case; Loops: Do loops, While.
