My Teaching Desk - By LokeshDev

  UNIT - II Topic: AO* (And-Or Star) Algorithm Part A: Introduction ✅ What is AO* Algorithm? AO* (And-Or Star) is an informed search algorithm used for problem-solving in AND-OR graphs where a solution may require solving multiple sub-problems together . Unlike A*, which deals with simple linear paths (OR choices), AO* handles situations where solving a problem may need solving more than one subproblem (AND branches) . Part B: AND-OR Graph Overview ✅ What is an AND-OR Graph? An AND-OR graph represents a hierarchical problem structure . Nodes represent states or sub-goals . Edges represent actions or transitions. There are two types of nodes: Node Type Meaning OR Node The solution can be found by choosing any one of the child nodes AND Node The solution requires solving all child nodes together ✅ Example:  ...

  UNIT - II Topic: A Algorithm * Part A: Introduction What is A* Algorithm? A* (pronounced A star ) is a popular informed search algorithm used to find the shortest path to the goal efficiently by combining: The actual cost to reach a node, and The estimated cost from the node to the goal (heuristic) It is one of the most powerful and widely used search algorithms in Artificial Intelligence. Part B: A Algorithm Explained* A* Evaluation Function The A* algorithm uses an evaluation function : f(n)=g(n)+h(n)f(n) = g(n) + h(n)f(n)=g(n)+h(n) Symbol Meaning f(n) Total estimated cost of the cheapest path through node n g(n) Actual cost from the start node to node n h(n) Heuristic estimate of cost from n to goal The node with the lowest f(n) is chosen for expansion first. Part C: A Algorithm Working – Step-by-...

  Overview: Topic-wise Weight Distribution (Approximate) Subject Area 2020 2021 2022 2023 2024 Algorithms 10 8 8 9 10 Data Structures 9 10 7 8 8 Computer Networks 8 9 10 7 9 Databases (DBMS) 8 9 8 10 7 Operating Systems 10 8 8 9 10 TOC (Theory of Comp.) 6 7 7 6 7 Compiler Design 6 5 5 4 5 Computer Organization 8 7 8 9 7 Digital Logic 4 4 5 4 5 Software Engineering 2 1 2 1 2 Discrete Mathematics 6 6 7 7 6 Linear Algebra 3 3 4 3 3 Probability & Stats 3 3 3 4 4 Calculus 1 1 1 1 1 General Aptitude 15 15 15 15 15 Total Marks 100 100 100 100 100 Observation : Core subjects like DS, Algo, OS, CN, DBMS consistently carry the highest weight. Engineering Maths + Aptitude contributes around 30–32 marks. Frequently Asked Topics (Must-Prepare) Data Structures & Algorithms Time Complexity (Master's theorem, Big-O) Sorting & Searching Algorithms Trees (BST, AVL, Heap) Graph Algorithms (BFS, DFS, Dijkstra, Kruskal) Recursion and Dynamic Programming Operating Syst...

  GATE Computer Science (CS) – Complete Guide for 2025 GATE CS is one of the most competitive and popular streams in the GATE exam. It opens the doors to M.Tech admissions in top IITs/NITs , PSU jobs , research fellowships , and MS abroad . GATE CS 2025 Paper Overview Particular Details Paper Code CS Exam Mode Online (Computer-Based Test) Duration 3 hours Total Marks 100 No. of Questions 65 Question Types MCQ, MSQ, NAT Negative Marking Yes (only for MCQs) Medium of Exam English  GATE CS Syllabus 2025 (Detailed) Below is a unit-wise breakdown of the GATE Computer Science syllabus. 1. General Aptitude (15 Marks) Verbal Ability: Grammar, sentence completion, synonyms, antonyms, etc. Numerical Ability: Percentages, averages, probability, ratios, etc. 2. Engineering Mathematics (13–15 Marks) Discrete Mathematics (Set Theory, Relations, Graph Theory, Logic) Linear Algebra Probability and Statistics Calculus Numerical Methods 3. Core Computer Science...