Courses / HEC NSCT – National Skill Competency Test: Complete Preparation for Computing Graduates
8.1 AI Foundations and Search
Area 8 – AI, Machine Learning & Data Analytics (10%) · 40 min read · 8 MCQs to check yourself
A* algorithm in artificial intelligence with example (Crack Concepts)
AI, ML, DL – nested circles
Artificial Intelligence (machines doing tasks that need intelligence) ⊃ Machine Learning (learning patterns from data) ⊃ Deep Learning (many-layered neural networks).
- Narrow AI (one task – chess, face recognition) vs General AI (human-level, not yet achieved).
- Turing Test (Alan Turing, 1950): can a machine's replies be distinguished from a human's?
- An intelligent agent perceives its environment through sensors and acts through actuators to maximise a goal (PEAS: Performance, Environment, Actuators, Sensors).
Search strategies
| Search | Idea | Note |
|---|---|---|
| BFS | Explore level by level | Finds the shallowest solution; lots of memory |
| DFS | Go deep first | Low memory; may get stuck in long paths |
| Uniform cost | Expand the cheapest path | Optimal with positive costs |
| Greedy best-first | Use heuristic h(n) only | Fast, not always optimal |
| A* | f(n) = g(n) + h(n) | Optimal if h never overestimates (admissible) |
| Minimax + alpha-beta | Two-player games | Alpha-beta pruning skips useless branches |
| Knowledge representation: rules (IF–THEN, expert systems), logic, semantic networks. Expert system = knowledge base + inference engine. |
Python for AI
NumPy (arrays, maths), Pandas (DataFrames – tables), Matplotlib/Seaborn (plots), scikit-learn (classic ML), TensorFlow/Keras and PyTorch (deep learning), Jupyter notebooks.
This lesson ends with a quiz of 8 MCQs. Open the lesson on PrepOasis to take it and save your progress.
Previous: Area 7 Review, Checklist and Area Test · Next: 8.2 Data, Preprocessing and Exploratory Data Analysis