KREIS Teacher Syllabus 2026 - Complete Subject-Wise Syllabus for Teacher Posts

• History of C: Developed by Dennis Ritchie at Bell Labs in 1972
• Structure of a C program: preprocessor directives, global declarations, main() function, user-defined functions
• Character set: alphabets, digits, special characters
• Constants and variables: types, naming conventions, keywords
• Data types: int, char, float, double, void
• Type qualifiers: signed, unsigned, short, long

• Type Declaration Instructions: Declaring variables with data types
• Arithmetic Instructions: +, -, *, /, % operators
• Integer and Float Conversions: Implicit and explicit type conversion
• Type Conversion in Assignment: Automatic conversion rules
• Operators and Hierarchy: Arithmetic, Relational, Logical, Assignment, Conditional
• Control Instructions: Sequential, Selection, Iteration
• Formatted I/O: scanf(), printf() with format specifiers
• Unformatted I/O: getch(), getche(), getchar(), putch(), putchar()

• Decision Control: if, if-else, nested if-else, else-if ladder
• Logical/Conditional/Relational Operators: &&, ||, !, ==, !=, >, <, >=, <=
• Loop Control: while, do-while, for loops
• Break and Continue: Loop control statements
• Switch-Case: Multi-way branching
• Goto Statement: Unconditional jump

• One-dimensional Arrays: Declaration, initialization, traversal
• Multidimensional Arrays: 2D and 3D arrays
• Array Manipulation: Searching, sorting, merging
• Bubble Sort: Algorithm and implementation
• Strings: Character arrays, string.h functions (strlen, strcpy, strcat, strcmp, strrev)
• Library Functions: String handling functions

• Function Definition: Return type, function name, parameters
• Function Prototyping: Declaration before use
• Types of Functions: Library functions, user-defined functions
• Arguments: Actual and formal parameters, call by value, call by reference
• Recursion: Recursive functions, base case, recursive case
• Passing Arrays to Functions: Array parameters
• Storage Classes: automatic, register, external, static

• Definition: Memory address variable
• Notation: * (indirection operator), & (address operator)
• Pointers and Arrays: Array names as pointers, pointer arithmetic
• Arrays of Pointers: Pointer arrays
• Call by Value vs Call by Reference: Using pointers
• Pointers to Pointers: Double pointers

• Structures: Definition, declaration, accessing members (dot operator)
• Arrays of Structures: Structure arrays
• Pointers and Structures: Arrow operator (->)
• Unions: Definition, memory sharing
• Enum: Enumeration data type
• Bit Fields: Memory optimization

• Bitwise Operators: AND (&), OR (|), XOR (^), complement (~), right shift (>>), left shift (<<)
• C Preprocessor: #define, macros, file inclusion (#include)
• Conditional Compilation: #ifdef, #ifndef, #endif

• File Operating Modes: Text mode, Binary mode
• Text and Binary Files: Differences and usage
• High-Level File Operations: fopen(), fclose(), fprintf(), fscanf()
• Low-Level File Operations: open(), close(), read(), write()
• Command Line Arguments: argc, argv

• Definition: Logical and physical data structures
• Classification: Primitive and non-primitive data structures
• Operations: Traversal, insertion, deletion, searching, sorting
• Time and Space Complexity: Big O notation

• Integer, character, float, strings
• Memory representation and string manipulation using pointers

• Storage Representation: 1D and 2D arrays in memory
• Insertion and Deletion: Methods and algorithms
• Advantages and Disadvantages: Contiguous memory allocation

• Pointers and Dynamic Memory Allocation: malloc(), calloc(), free()
• Singly Linked Lists: Creation, insertion, deletion, traversal
• Circularly Linked Lists: Applications and operations
• Doubly Linked Lists: Two-way traversal

• Concepts: LIFO (Last In First Out)
• Operations: Push, pop, peek
• Sequential and Linked Implementation: Array-based and linked list-based stacks
• Applications: Expression evaluation, function calls, recursion
• Tower of Hanoi: Recursive solution using stacks
• Infix to Postfix Conversion: Algorithm and implementation
• Evaluation of Postfix Expressions: Stack-based evaluation

• Concepts: FIFO (First In First Out)
• Operations: Enqueue, dequeue
• Sequential and Linked Implementation: Array-based and linked list-based queues
• Circular Queues: Memory efficient implementation
• Priority Queues: Element priority-based ordering
• Deques: Double-ended queues

• Binary Trees: Definition, properties, traversal (inorder, preorder, postorder)
• Sequential and Linked Representation: Array and pointer-based
• Insertion and Deletion: Algorithms for binary trees
• Binary Search Trees (BST): Properties and operations

• Concepts: Vertices, edges, directed/undirected graphs
• Sequential and Linked Representation: Adjacency matrix and adjacency list
• BFS Traversal: Breadth-First Search
• DFS Traversal: Depth-First Search

• Linear Search: Sequential search algorithm
• Binary Search: Divide and conquer, sorted arrays
• Selection Sort: Algorithm and complexity
• Insertion Sort: Algorithm and complexity
• Quick Sort: Divide and conquer, pivot selection
• Merge Sort: Divide and conquer, merging

• History: Evolution from simple batch to modern OS
• Types: Simple batch, multi-programmed batch, time-sharing, personal computer, distributed, real-time
• OS Structures: Monolithic, layered, microkernel, modular
• Command Interpreter System: Shell, command processing
• OS Services: Program execution, I/O operations, file system manipulation, communication, error detection
• System Calls: API for user programs to request OS services
• System Programs: Utility programs, file management, status information

• Process Concept: Program in execution, process states
• Process Control Block (PCB): Process attributes, process ID, state, registers
• Process Scheduling: Scheduler types, queues
• CPU Scheduling Algorithms:
  • FIFO (First In First Out) / FCFS
  • RR (Round Robin)
  • SJF (Shortest Job First)
  • Multi-level Queue
  • Multi-level Feedback Queue

• Logical and Physical Address Space: Address binding
• Swapping: Moving processes between memory and disk
• Contiguous Allocation: Fixed and variable partitioning
• Paging: Page table, frame allocation
• Segmentation: Logical divisions, segment table
• Virtual Memory: Demand paging, page fault
• Page Replacement Algorithms: FIFO, LRU, Optimal
• Allocation of Frames: Minimum and maximum frames
• Thrashing: Causes and prevention
• Demand Segmentation: Combined paging and segmentation

• File Concept: File attributes, operations, types
• Access Methods: Sequential, direct, indexed
• Directory Structure: Single-level, two-level, tree-structured, acyclic-graph
• Protection: Access control, passwords
• File System Structure: Layers, inodes
• Allocation Methods: Contiguous, linked, indexed
• Free-Space Management: Bit vector, linked list

• Overview of I/O Systems: I/O devices, device controllers
• I/O Interfaces: Standards, protocols
• Secondary Storage Structure: Disk types, disk scheduling
• Disk Structure: Tracks, sectors, cylinders
• Disk Scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK

• Classes and Objects: Definition, data members, member functions
• Encapsulation: Data hiding, public/private/protected
• Inheritance: Single, multiple, multilevel, hybrid
• Polymorphism: Compile-time (overloading), runtime (overriding)
• Abstraction: Abstract classes, interfaces
• Constructors and Destructors: Default, parameterized, copy, destructor
• Friend Functions: Accessing private members
• Operator Overloading: Overloading operators
• Virtual Functions: Dynamic binding
• Exception Handling: try, catch, throw

• Database Concepts: DBMS vs file system
• Data Models: Hierarchical, Network, Relational
• Relational Model: Tables, attributes, tuples
• ER Model: Entities, relationships, attributes
• SQL: DDL, DML, DCL commands
• Normalization: 1NF, 2NF, 3NF, BCNF
• Transactions: ACID properties
• Concurrency Control: Locking, deadlock
• Indexing: Primary, secondary, clustering

• Software Process: Waterfall, iterative, agile models
• Requirements Analysis: SRS document
• Software Design: Architectural design, detailed design
• Testing: Unit, integration, system, acceptance testing
• Software Maintenance: Corrective, adaptive, perfective
• Software Quality: Metrics, assurance
• Project Management: Estimation, scheduling, risk management

• Internet Basics: WWW, HTTP, HTTPS, URLs
• Web Technologies: HTML, CSS, JavaScript basics
• Client-Server Architecture: Web servers, browsers
• Web Services: REST, SOAP APIs
• Cloud Computing: SaaS, PaaS, IaaS

• Java Features: Platform independent, object-oriented
• Data Types and Variables: Primitive and reference types
• Control Statements: if, switch, loops
• Classes and Objects: Definition, constructors, methods
• Inheritance: extends, super keyword
• Polymorphism: Method overloading, overriding
• Exception Handling: try-catch, finally, throws
• Packages: Creating and importing packages

• UNIX Architecture: Kernel, shell, utilities
• File System: Directory structure, file types
• Basic Commands: ls, cd, pwd, mkdir, rm, cp, mv, cat, grep, find
• Shell Scripting: Variables, control structures, loops
• Process Management: ps, kill, nice, nohup
• Permissions: chmod, chown, chgrp
• Pipes and Filters: Redirection, piping

• Overview: Applications, display devices
• Graphics Primitives: Points, lines, circles, ellipses
• Line Drawing Algorithms: DDA, Bresenham's
• Circle Drawing: Bresenham's circle algorithm
• 2D Transformations: Translation, rotation, scaling, reflection
• 3D Transformations: 3D translation, rotation, scaling
• Clipping: Line clipping, polygon clipping
• Filling Algorithms: Boundary fill, flood fill

• Network Basics: LAN, MAN, WAN, PAN
• OSI Model: 7 layers and their functions
• TCP/IP Model: Layers and protocols
• Network Devices: Hub, switch, router, gateway
• IP Addressing: IPv4, IPv6, subnetting
• Transport Layer: TCP, UDP, ports
• Application Layer: HTTP, FTP, SMTP, DNS
• Network Security: Firewalls, encryption, SSL/TLS

Q1. How many papers are there in the KREIS Teacher exam?
There are 2 papers for Teacher posts: Paper 1 (General Studies) and Paper 2 (Subject-Specific).

Q2. What is the exam mode for KREIS Teacher Recruitment 2026?
The exam is Offline OMR-based with Multiple Choice Questions (MCQs).

Q3. Is there negative marking in KREIS Teacher exam?
Yes, 0.25 marks will be deducted for each wrong answer.

Q4. What is the minimum qualifying marks for KREIS Teacher exam?
Candidates must secure a minimum of 35% aggregate marks to qualify.

Q5. Is Kannada Language Test mandatory for KREIS Teacher exam?
Yes, a compulsory Kannada Language Test of 150 marks (minimum 50 to pass) is conducted for candidates who did not study Kannada in SSLC. These marks are not counted in final merit.

Q6. What subjects are covered in KREIS Teacher Paper 2?
Paper 2 covers subject-specific syllabus for: Kannada, English, Hindi, Mathematics, Science, Social Science, Physical Education, and Computer Science.

Q7. Where can I download the official KREIS Teacher Syllabus PDF?
The official syllabus PDF is available at kpsc.kar.nic.in/syllabus of kries.pdf.