Google Groups
Subscribe to Free Jobs Notification
Visit this group

Friday, June 10, 2011

KPSC Stastical Inspector Computer Science Exam Syllabus Download

Karnataka Public Service Commission (KPSC) 

KPSC Stastical Inspector Computer Science Exam Syllabus

KPSC SI Computer Science Examination Syllabus Download

Paper I

I. Introduction to Computers — Evolution of Computers, Generation of Computers, Classification of Computers, Analog Digital and Hybrid Computers, Classification of Computers according to size, Super Computers, Mainframe Computers, Personal Computers (Different Types) and Terminals (Different Types), Characteristics of Computers, Block Diagram of a Digital Computer.

2. PROGRAMMING IN C — Overview of C, Constants, Variables and Data types, Operators and expression – Arithmetic operators, Relational operators, Logical operators, Assignment operators, increment and decrement operators, conditional operators, bitwise operators, special operators. some computational problems, type conversion in expressions, operator precedence and associativity, Mathematical functions,

3. Input and Output statements, Decision making, Branching and looping,— lnput and Output statements, reading a character, writing characters, formatted input, formatted output statements, IF statement, simple IF statement, The IF-ELSE statement, nesting of IF .. ELSE statements, The ELSE AIF ladder, The switch statement, The ‘?: operator, The GOTO statement. The WHILE statement, The DO statement, The FOR statement, jumps in loops,

4. Arrays, Functions, Structure and union – One dimensional arrays, Two-dimensional arrays, initializing two-dimensional array, Multidimensional arrays, Functions- definitions, Need, Syntax of function declaration, all types of functions, Structure definition, giving values to members, structure initialization, comparison of structure variables, array as structure, array within structure, union Pointers – Understanding pointers, accessing the address of variables, declaring and initializing pointers, accessing a variable through its pointer.

5. DBMS: Database and Database Users, Characteristics ofthe Database Approach, Different people behind DBMS, Implications of Database Approach, Advantages of using DBMS, When not to use a DBMS, Database System Concepts and Architecture: Data Models, Schemas. and Instances, DBMS Architecture and Data Independence., Database languages and interfaces, The Database system Environment, Classification of Database Management Systems.

6. Data Modeling Using the Entity-Relationship Model: High level Conceptual Data Models for Database Design with an example., Entity types. Entity sets, Attributes, and Keys. ER Model Concepts, Notation for ER Diagrams, Proper naming of Schema Constructs, Relationship types of degree higher than two.

Paper II

I. Data Structures – Introduction to data structures —DeIiniti0n, Classification of data structures. Operations on data structures, Linked Lists — singly Linked Lists, Operations on linked lists. Insertion and deletion ol`a node, Introduction to circularly linked lists and doubly linked lists.

2. Stacks & Queues – Concepts, Operations, Application ot` stacks, Queues — Concepts. operations, sequential and linked implementation, Circular queues. Priority queues, and Dequeucs (Introductory concepts), Application ofqucues.

3. Trees & Graphs – Delinitions and concepts — Binary trees. Sequential and Linked Representation of Binary Tree Trees, Insertion and deletion on binary trees, Binary Tyree Traversal, Graphs – Concepts, Sequential and linked representation of Graphs. BFS and DFS Traversal

4. OPERATING SYSTEM – What is an operating system(OS)?, History of OS. Simple Batch Systems, Multiprogrammed Batched Systems, Time—Sharing Systems, Personal Computer Systems, Distributed Systems and Real —Time Systems, Operating System Structures- Command Interpreter System. Operating System Services. System Calls, System Programs.

5. Process Management – Process Concept, Process control Block, Process Scheduling. CPU Scheduling — Basic Concepts, Scheduling Algorithms — FIFO, RR, SJF, Multi-level. Multi-level leedback.

6. Storage Management – Basic Concepts, Logical and Physical Address Space, Swapping. Contiguous Allocation. Paging, Segmentation. Virtual Memory — Demand Paging. Page Replacement, Page Replacement Algorithms, Allocation ol` Frames. Thrashing and Demand Segmentation.

 The Office of the Public Service Commission was located in the “United India” buildings, Bangalore City, till 20-05-1951.  Since the accommodation fell short of the actual requirements of the Commission, its office was shifted to “Balabrooie”, on Palace Road, Bangalore, on 21st May 1951 and remained  there  upto 7th  November 1956. Later it was shifted to the north wing of  “ Atarakacheri” a portion of the High Court Building and continued there upto  January  1968.  Thereafter it was shifted to the present  premises of  “Park House” situated on the north west  side of  Vidhana Soudha. 

Tags: KPSC Syllabus SI Computer Science Exam Download KPSC Stastical Inspector Computer Science Exam Syllabus KPSC SI Computer Science Examination Syllabus Download KPSC Syllabus download KPSC Stastical Inspector syllabus download KPSC Stastical Inspector Computer Science Examination syllabus downloads KPSC website link url details information website link url KPSC Stastical Inspector jobs application form download eligibility criteria selelction procedure process details info age limit educational qualification academic eligibility 

No comments:

Subscribe to Free Jobs Notification
Visit this group