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

Searching

Assam Board · Class 12 · Computer Science

Quick revision notes for Searching — Assam Board Class 12 Computer Science. Key concepts, formulas, and definitions for last-minute revision.

43 questions68 flashcards5 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

1,000+ Class 12 students started this chapter today

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

This is just one of 9+ visuals inside Super Tutor's Searching chapter

Explore the full set

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 Assam Board Class 12 Computer Science?
Searching covers several key topics that are frequently asked in Assam Board Class 12 board exams. Focus on the core concepts listed on this page and practise related questions to build confidence.
How to score full marks in Searching — Assam Board Class 12 Computer Science?
Understand the core concepts first, then work through the 43 practice questions available for this chapter. Revise formulas and 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 13 chapters — Assam Board Class 12 Computer Science Revision Notes

For serious students

Get the full Searching chapter — for free.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan for Assam Board Class 12 Computer Science.

Try Super Tutor Free
Try the full chapter — Free