Rajasthan Computer Teacher Syllabus PDF 2021

The syllabus and scope of paper for the examination will be as prescribed by the Commission/Rajasthan Staff Selection Board/Appointing Authority as the case may be, from time to time, and will be communicated to the candidates within the stipulated time in the manner that the Commission Rajasthan Staff Selection Board Appointing Authority, as the case may be, deems appropriate.

1. The question paper will have a maximum score of 100 points.
2. The question paper will be 2 hours long.
3. There will be 100 multiple-choice questions on the question paper.
4. In the evaluation of answers, negative marking will be used. For each incorrect answer, 0.5 of the total marks for that question will be deducted. Explanation: When we say “wrong response,” we’re referring to an inaccurate multiple-choice option.
5. The following topics must be included in the paper:

Pedagogy I

• Decision-making and problem-solving abilities. Data interpretation, data sufficiency, logical reasoning, and analytical ability are all important skills to have. There have been significant advancements in the realm of information technology.
• Numeracy basics — numbers and their relationships, orders of magnitude, and so on (Class X level)
• Data Interpretation — charts, graphs, tables, data inconsistencies, and so on (Class X level)
• Computer Fundamentals: Number system, arithmetic operations, and an introduction to several types of computer languages. Input and output device functional details.
• Fundamentals of Programming: C, C++, Java, DotNet, Artificial Intelligence (Al), and Machine Learning Python and Block Chain are two technologies that are often used together.

• Data types, programming (Built-in and user-defined), Variable scope, operator precedence, control flow, functions, and arrays pointers, structures, and unions, enumerated data types and file handling, and command-line parameters.

• Object-Oriented Programming in C++ and Java: Classes and Objects Polymorphism, inheritance Handling of events and errors, as well as files and streams.
• Data structures and algorithms: abstract data types, arrays as data structures, linked list vs. array for storage, stacks and stack operations, queues, binary trees, binary search trees, graphs and their representations, sorting and searching, symbol table.
• Tree traversals are an example of an algorithm. Algorithm complexity, branch and bound, and greedy techniques.
• Boolean expressions and K-maps are examples of digital logic systems. TTL and CMOS logic families, stop complete adders, subtractors, and multiplexers in combinational logic, synchronous sequential system architecture.
• Computer Organization and Architecture: Computer architecture designed by Von Neumann. Control logic, registers and micro-operations Addressing of processors and bus organization DMA and processor input/output Memory coherence and memory organization.
• CPU Scheduling in Operating Systems Memory management, file systems, and disc scheduling are all examples of deadlocks. Client-server architecture in a distributed context and RPC are concepts. Threads, processes, and their synchronisation Clock synchronisation and task scheduling are two features of the Real Time OS. Initializing the system, powering it up, and managing user accounts are all things that need to be done. Boume shell programming for Linux, backup and restoration.
• Database Management System: E-R models, Relational algebra, calculus, and databases Constraints of integrity Normalization, indexing, and triggers are all things that can be done. Relational Database Management System, transaction processing, and concurrency control (RDBMS).

Phases of System Development

• Software Engineering The Process of Life Modeling of a system Specifications and DFDs for software. Software project management and introduction to software testing.
• Data and computer networks: Networking Evolution. Terminologies for data communication, as well as transmission media. Devices that connect to the internet TCP/IP and OSI/ISO reference models, functions of different levels, physical media characteristics, physical layer multiplexing, medium access protocols, introduction to 802.3, 802.4, 802.5, and 802.11 LAN technologies, IP protocol including routing and congestion control DNS, TCP and UDP.
• Network Security: Finite-space groups, rings, and fields, Euler and Fermat’s theorems, primality testing, security services and mechanisms, symmetric and asymmetric encryption, including the DES, AES, IDEA, and RSA algorithms, key management in symmetric and asymmetric encryption.