Skip to main content
Super TutorResources
Chapter 6 of 13
Revision Notes

Searching — Revision Notes

Himachal Pradesh Board · Class 12 · Computer Science

Searching revision notes for Himachal Pradesh Board Class 12 Computer Science: 4 topics in quick points. Includes Core Idea of Searching, Linear Search.

43 questions68 flashcards3 formulas & key relations5 concepts

Interactive on Super Tutor

Studying Searching? Get the full interactive chapter.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan — built for revision notes and more.

Try Super Tutor — Free

Free trial, no card needed.

An illustration showing a person searching for an item in a cluttered room, contrasting it with a person finding an item in an organized, labeled storage system, to metaphorically represent the concep
Super Tutor

One of 9 illustrations for Searching in Super Tutor — alongside flashcards, concept maps and practice questions.

Key Topics to Revise

1

1. Core Idea of Searching

  • Searching is used to locate a key in a collection of elements.
  • The result of searching tells whether the key is present or absent.
  • If the key is present, the position of the key can also be found.
2

2. Linear Search

  • Linear search is the most fundamental and simplest search method.
  • It is an exhaustive technique: every element is compared one by one with the key.
  • The comparison begins at the first element and moves towards the last element.
3

3. Binary Search

  • Binary search uses the ordering of elements in a sorted list.
  • It compares the key with the middle element of the sorted list.
  • There are three possibilities: the middle element matches the key, is greater than the key, or is less than the key.
4

4. Search by Hashing

  • Hashing is used to know the presence of a key in just one step.
  • A hash function generates an index value for every element and creates a hash table.
  • Each index in the hash table holds only one item.

Get complete notes with diagrams and examples

Full Notes

Key Concepts

Searching is the process of locatingLinear search compares each elementBinary search works on a sortedThe middle index is found usingA hash function calculates the index

Frequently Asked Questions

What are the important topics in Searching for Himachal Pradesh Board Class 12 Computer Science?
Key topics in Searching include Core Idea of Searching, Linear Search, Binary Search, Search by Hashing. Study these first, then practise questions on each for the Himachal Pradesh Board Class 12 board exam.
How should I revise Searching for the Himachal Pradesh Board Class 12 board exam?
Learn the core ideas first, then work through the 43 practice questions on Searching. Revise definitions regularly and use flashcards for quick recall before the exam.

Sources & Official References

Content is aligned to the official syllabus. Refer to the board website for the latest curriculum.

More resources for Searching

All Himachal Pradesh Board Class 12 Computer Science Revision Notes

For serious students

Get the full Searching chapter — start free.

Quizzes, flashcards, an AI doubt solver and a study plan for Himachal Pradesh Board Class 12 Computer Science. Free to start, no card needed.

Try Super Tutor Free
Try this chapter free