bihar stet computer science syllabus 2024 pdf download in hindi and english

आप यहां सेbihar stet computer science syllabus 2024 या English का Pdf को Subject wise Download कर सकते है ।

बिहार विद्यालय परीक्षा समिति ने हाल ही नोटिफिकेशन जारी किया है । Bihar Stet 2024 की तैयरी करने वाले अभ्यर्थियों को Bihar stet exam Syllabus 2024 के बारे में अच्छे से जानकरी होनी चाहिए ।

Bihar Stet 2024 में Paper 1 माध्यमिक (वर्ग 9 एवं 10 ) विद्यालय के लिए और Paper 2 उच्च माध्यमिक (वर्ग 11 एवं 12 ) विद्यालय के शिक्षकों का चयन के लिये कराई जानी है ।

EducationCareerZone.com के इस लेख में Bihar stet syllabus in hindi में विस्तार से समझाया है । साथ ही एग्जाम पैटर्न के बारे में भी बताया है ।

^{bihar stet computer science syllabus 2024}

बिहार परीक्षा समिति बोर्ड द्वारा Primary और Secondary Teacher के लिये जाने वाली परीक्षा Bihar stet 2023 Syllabus pdf in hindi को download करने से पहले एग्जाम पैटर्न और चयन प्रक्रिया के बारे में जान लेते है ।

^{bihar stet computer science syllabus 2024 Exam Pattern}

बिहार Stet 2023 Exam पैटर्न की बात करे तो इसमें चार विषयों से प्रश्न पूछे जाते है । Stet Paper 1 और Stet Paper 2 में पैटर्न समान होते है । सिर्फ विषयों का अंतर होता है ।

^{_{bihar stet computer science syllabus 2024 [ Paper 1 & Paper 2 ]}}

^{bihar stet computer science syllabus 2024 Selection Process in hindi}

Bihar stet 2023 के द्वारा चयन प्रक्रिया पुरानी चयन प्रक्रिया के समान रहने वाली है । जैसाकि आप सभी जानते है कि पहले उच्च प्राप्तांक से न्यून प्राप्तांक के क्रम में विषयवार एवं कोटिवार पैड के अनुसार नहीं मेघ सूची जारी करता है ।

अगर एक से अधिक विद्यार्थियों का सामान अंक प्राप्त करने पर अधिक उम्र वाले का चयन किया जाता है ।

Bihar stet computer science syllabus 2024

Syllabus for Uchcha Madhyamic Paper II STET 2024
Syllabus UNIT I Subject ——–Computer Science 100 Marks
Unit 1: Digital Logic
Data and number systems; Binary, Octal and Hexa decimal representation and their conversions ;BCD,ASCII, EBDIC, Gray codes and their conversions; Signed binary number representation with 1’s and 2’s complement methods, Binary arithmetic. Venn diagram, Boolean algebra; Various Logic gates-their truth tables and circuits; Representation in SOP and POS forms; Minimization of logic expressions by algebraic method, Kmap method
Combinational circuits-Adder and Subtractor circuits; Applications and circuits of Encoder,Decoder, Comparator,Multiplexer, De-Multiplexe rand Parity Generator. Memory Systems: RAM ROM, EPROM, EEROM, Design of combinational circuits-using ROM, Programming logic devices and gate arrays. (PLAs and PLDs)
Sequential Circuits-Basic memory element-S-R, J-K,D and T Flip Flops, various types of Registers and counters and their design, Irregular counter, State table and state transition diagram,sequential circuits design methodology.
Different types of A/D and D/A conversion techniques. Logic families- TTL,ECL,MOS and CMOS, their operation and specifications.
Unit 2:Computer Organization and Architecture
Introduction to Data Representation and Number System: Introduction to Decimal, Binary, Octal, Hexadecimal number system, Conversation of number from one number system to another number system (like Decimal to Binary etc.), Binary Arithmetic:- Addition (Simple Method, Using 1’s Complement, Using 2’sComplement method), Subtraction (Simple Method), Multiplication (Simple Method), Division (Simple Method)
Different Codes Representation of Error Detection Codes: Parity Bit Method, Checksum Method, Representation of Error Correction Code: Hamming Code, Alphanumeric Codes: ASCII, EBCDIC, Excess 3 Code, BCD Addition Method, Gray Code: Gray to Binary Conversion, Binary to Gray Conversion
Introduction to Ideal Microcomputer, An Actual Microcomputer: CPU, Address Bus, Data Bus, Control Bus, Memory: RAM – SRAM, DRAM, ROM – PROM, EPROM, UVEPROM, EEPROM, History of Microprocessor, Microcontroller (Application Only), Addressing Techniques, Introduction To Digital Electronics, Logic Gates: Inverter, OR Gate, AND Gate, NOR Gate, NAND Gate, EX-OR Gate, EX-NOR Gate, De’Morgan’s Theorems
Universal Gates (Only for Logic Conversion), K-Map Simplifications, Pair, Quad, Octet (upto 4 variables) Don’t Care Condition, Arithmetic Logic Unit:
Half Adder, Full Adder, Binary Adder,2’s Complement Adder Subtractor Unit 3: Programming and data structure
Data, Entity, Information, Difference between Data and Information, Data type, Build in data type, Abstract data type, Definition of data structures, Types of Data Structures: Linear and Non-Linear Data Structure, Introduction to Algorithms: Definition of Algorithms, Difference between algorithm and programs, properties of algorithm, Algorithm Design Techniques, Performance

Analysis of Algorithms, Complexity of various code structures, Order of Growth, Asymptotic Notations.
Definition, Single and Multidimensional Arrays, Representation of Arrays:
Row Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D Array Application of arrays, Sparse Matrices and their representations. Recursion: recursion in C, example of recursion, Tower of Hanoi Problem, simulating recursion, Backtracking,, recursive algorithms, principles of recursion.
Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single variable.
Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Removal of recursion Problem
solving using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi towers.
Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue.
Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of Hashing & Collision resolution Techniques used in Hashing.
Insertion Sort, Selection Sort, Bubble Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time: Counting Sort and Bucket Sort.
Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First Search, Connected Component.
Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array Representation and Pointer (Linked List) Representation, Binary Search Tree, Complete Binary Tree, A Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, Operation of Insertion, Deletion, Searching & Modification of data in Binary Search Tree. Threaded Binary trees, Huffman coding using Binary Tree, AVL Tree and B Tree
Unit 4:Algorithms
Algorithm Analysis, Time Space Tradeoff, Asymptotic Notations, Conditional asymptotic notation, Removing condition from the conditional asymptotic notation, Properties of big-Oh notation.
Recurrence equations, Solving recurrence equations, Analysis of linear search, Divide
and Conquer: General Method, Binary Search, Finding Maximum and Minimum, Merge Sort.
General Method, Multistage Graphs, All-Pair shortest paths, Optimal binary search trees.
General Method, 8-Queens problem, Hamiltonian problem.
Connected Components, Spanning Trees, Biconnected components, Introduction to NP Hard and NP-Completeness.
Unit 5:Operating System

Introduction to OS – its functional behavior and responsibilities, Need for some of monitor/command interpreter, Types of operating systems, System structure, Hierarchical and layered organization of OS, I/O methods and interrupt structure.
Process definition, Process states and state transitions, Parallel processes and constructs, Process interaction, Operating system kernel, Data structures for processes and resources, Context switching, Process control primitives, Process scheduling.
The determinacy problem, Mutual exclusion, Semaphores, Process synchronization,
Conditional critical regions and monitors, Inter-process communication, Deadlock problem and its solutions.
Memory management concepts, Relocation, Linking, Multiprogramming with fixed
partitions, Swapping, Variables partitions, Overlays, Virtual memory,
Segmentation, Paging, Storage allocation strategies, Load control and thrashing
Organization of file and I/O subsystems, Directory management, Basic file system, file descriptors, File manipulation, File organization methods, Management of auxiliary storage space, Command language and file system utilities, I/O subsystems, Programmed I/O, DMA, Interrupt driven I/O, Recovery procedures. Protection and Security: Safeguards, Penetration, Access and Information flow control, Protection problems, Formal models of protection.
Unit 6:Database Management System
Introduction to Database, components and structure of DBMS logical structure the 3 level architecture and mapping among them. Comparison between traditional file based system and DBMS. Advantages and drawbacks of DBMS.
Relational Model What is relational model, Relational key constraints candidate key, primary key, foreign key.ER Model entities, attributes, relationship, and cardinality. Entity types, Entity sets Attributes and Keys Relationship types, Relationship Sets, converting ER diagram to relational tables. Database Schema
Database Anomalies, CODD Rules and Normalization theory, 1 NF, 2 NF, 3 NF and BCNF.
Introduction to transaction and concept of concurrency control. Transaction and system concepts, desirable properties of transactions, transaction support in SQL. Concurrency control techniques, the locking protocol, serializable schedules, locks, 2 phase commit. Techniques, concurrency control based on timestamp ordering
Unit 7: Computer Network
Introduction to Data Communication and Computer Network, Network Topologies, classification of computer network, Parallel & Serial Transmission, Transmission Models, Transmission Channel, Data Rate, Bandwidth Signal Encoding Schemes, Data Compression, Transmission Impairments, Layering and Design Issues, OSI Model and TCP/IP model.

bihar stet computer science syllabus 2024 Pdf Download

• Microsoft office
• Computer Network
• Computer fundamentals
• Input and Output devices
• Components of Computer
• Computer stroage devices
• internet
• OSI Modal

^{_{Bihar STET syllabus Paper 1 Dance}}

• नृत्य का उद्दद्भव, विकास और इतिहास
  इर्काइ – 2
• भारतीय शास्त्रीय नृत्यों का विस्तृत अध्ययनः उद्दद्भव और विकास, तकनीक, वस्त्र विन्यास, संगीत, लय-ताल, मुद्रा, गुरु, घराने और प्रसिद्ध कलाकार
  इर्काइ – 3
• भारतीय लोक नृत्य का अध्ययन
• बिहार के लोक नृत्य का अध्ययन
• बिहार के लोक नर्तक और शास्त्रीय नर्तक कलाकारों का परिचय
  इर्काइ – 4
• वाद्ययंत्रों के वर्गीकरण का अध्ययन
• भारतीय शास्त्रीय नृत्यों में प्रयुक्त वाद्ययंत्रों का अध्ययन
• बिहार के लोक वाद्ययंत्रों का अध्ययन
  इर्काइ -5
• नृत्य से जुड़े ग्रंथः नाट्यशास्त्र, अभिनय दर्पण, नृत्त रत्नावली, नर्तन निर्णय, हस्त लक्षण दीपिका, श्रीहस्त मुक्तावली
• नृत्य विषय से जुड़ी प्रमुख पुस्तकें एवं पत्रिकाएँ
  इर्काइ -6
• निम्नांकित नर्तकों की जीवनी एवं एवं योगदान का अध्ययनः बिन्दादीन महाराज, यमिनी कृष्ण मूर्ति, केलु चरण महापात्रा, पंडित बिरजू महाराज, रुक्मिनी देवी अरुण्डेल, बाला सरस्वती, पंडित दुर्गालाल, मीनाक्षी सुंदरम पिल्लई, पुनैय्या पिल्लई
  इर्काइ -7
• नृत्य से जुड़े संस्थान, अकादमी, फ़ाउंडेशन
• भारत में प्रसिद्ध नृत्य महोत्सवों की जानकारी
• लोक नृत्य और शास्त्रीय नृत्य के क्षेत्र में राष्ट्रीय पुरस्कार प्राप्त कलाकार
  इर्काइ -8
• नृत्य से जुड़ी पारिभाषिक शब्दावली: नृत्य, नाट्य, नृत, पढ़न्त, लास्य, तांडव, मुद्रा, गतभाव, चक्करदार, मार्गी, देसी, बद्ध, अनिबद्ध, नर्तकी लक्षण, सभा लक्षण, पद, हस्त, करी, मण्डल, करण, अंग, उपांग प्रत्यांग, वंदना, थाट, आमद, टुकड़ा, तोड़ा, तिहाई, गतनिकास, कसक, मसक, गतभाव, हस्तक्रिया, परन, ताली, खाली, सम, तत्कार, आरोह, अवरोह, अलंकार, लय, वर्ण, मुष्ठी, पताका, त्रीपताका, रेचक, अंगहार
  इर्काइ -9
• हिंदुस्तानी संगीत परंपरा के तालों का अध्ययनः एकताल, सूलताल, रूपक, आड़ा चारताल, पंचम सवारी, दीपचंदी, तीनताल, झपताल, दादरा, कहरवा, तीव्रा, धमार, लक्ष्मीताल, ब्रम्हताल, जतताल, झूमराताल
• ताल के 10 प्राण
• तबला, पखावज और मृदंग का विस्तृत अध्ययन
  इकाई-11
• भातखण्डे एवं विष्णु दिगम्बर पद्धति का तुलनात्मक अध्ययन
• नृत्य के बोल को भातखण्डे एवं विष्णु दिगम्बर पद्धति में लिपिबद्ध करना

^{_{Bihar STET syllabus Paper 1 Urdu}}

^{bihar stet computer science book pdf download in hindi}

Bihar stet 2024 computer science Syllabus का पीडीएफ डाऊनलोड करने के लिये नीचे लिंक दिया है । बिहार stet 2024 Paper 1 Syllabus और बिहार एसटीईटी 2023 पेपर 2 का सिलेबस अलग अलग दिया गया है ।

bihar stet computer science notes Pdf Download 2024

पेपर 1 माध्यमिक (वर्ग 9 एवं 10 ) विद्यालय हेतु STET परीक्षा का आयोजन किया जा रहा है । जिसके सिलेबस के पीडीएफ को डाऊनलोड करने का लिंक नीचे दिया गया है ।

^{Bihar STET 2024 Paper 2 Syllabus in hindi [ Download pdf ]}

पेपर 2 के तहत उच्च माध्यमिक (वर्ग 11 एवं 12 ) विद्यालय हेतु STET परीक्षा का आयोजन किया जाता है । जिसका सिलेबस को पीडीएफ डाउनलोड करने का लिंक नीचे दिया गया है ।

^{_{FAQ : bihar stet computer science syllabus 2024 hindi}}