UGC NET July 2018 (A*)

Duration: 1 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/ai-machine-learning-big-data-cloud/search-algorithms/a-search-algorithm/asset-ugc-net-july-2018-a after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents an academic lecture on Artificial Intelligence, analyzing the properties of the A* search algorithm. The slide displays a multiple-choice question from the UGCNET-July-2018-II exam. The question asks to identify correct statements regarding A*, an informed search strategy. Three specific statements are listed: (a) A* expands all nodes with f(n) < C*, (b) A* expands no nodes with f(n) > C*, and (c) Pruning is integral to A*. Here, C* represents the cost of the optimal solution path. The instructor actively engages with the problem by writing mathematical inequalities on the screen, such as f(n) < C* and f(n) > C*, to illustrate the conditions for node expansion. She underlines key phrases like "integral" in statement (c) and "optimal solution path" to emphasize their importance. The options provided are combinations of these statements. Although the slide initially displays "Ans: a" at the top left, the instructor crosses out option A ("Both statement (a) and statement (b) are true") and selects option B ("Both statement (a) and statement (c) are true"). This action suggests a detailed discussion on why statement (b) might be considered incorrect or less accurate in this context, or why statement (c) is a fundamental characteristic of A*.

Chapters

  1. 0:00 – 1:28 00:00-01:28

    The video shows a slide with a UGCNET question about A* search. The instructor analyzes statements (a), (b), and (c). She writes f(n) < C* and f(n) > C* on the screen. She underlines "integral" and "optimal solution path". She crosses out option A and selects option B.

The lecture segment focuses on the theoretical properties of the A* search algorithm in Artificial Intelligence. The instructor uses a past exam question to guide the analysis. She breaks down the statements about node expansion based on f-values (f(n) < C* and f(n) > C*) and the role of pruning. By writing inequalities and underlining key terms, she clarifies the conditions under which A* operates. Her selection of option B over the initial answer key suggests a nuanced understanding of the algorithm's behavior, possibly highlighting that while A* is optimal, the concept of "pruning" is central to its efficiency, and statement (b) might have exceptions or specific conditions not met in the general case presented. The visual aids, including handwritten notes and crossed-out options, reinforce the step-by-step logical deduction required to solve such problems.

Loading lesson…