CUET Computer Science Key cards: 5 of this chapter’s 40 are free to read, with no account.
Say the answer in your head, then turn the card over.
The 5 free cards from Searching
Card 1 of 5
1 of 5
Definition
Define searching.
Computer Science, Ch 6, p. 81
Definition
Define searching.
Searching means locating a particular element in a collection of elements.
Computer Science, Ch 6, p. 81
Definition
What is binary search?
Computer Science, Ch 6, p. 85
Definition
What is binary search?
The binary search is a search technique that makes use of the ordering of elements in the list to quickly search a key.
Computer Science, Ch 6, p. 85
Definition
What is hashing?
Computer Science, Ch 6, p. 90
Definition
What is hashing?
Hashing is a technique which can be used to know the presence of a key in a list in just one step.
Computer Science, Ch 6, p. 90
Definition
What is a hash function?
Computer Science, Ch 6, p. 90
Definition
What is a hash function?
A formula called hash function is used to calculate the value at an index in the list.
Computer Science, Ch 6, p. 90
Definition
What does a hash function do, and what is the new list it generates called?
Computer Science, Ch 6, p. 90
Definition
What does a hash function do, and what is the new list it generates called?
Thus, a hash function takes elements of a list one by one and generates an index value for every element. This will generate a new list called the hash table.