What did the university announce for Llallagua?
Universidad Nacional “Siglo XX” announced its 16th National Computing Congress for November 27 and 28, 2026, at its Computer Engineering facilities in Llallagua, in Bolivia's Potosí department. The official announcement lists topics such as software development and robotics. The university department's location page identifies its María Barzola campus in Llallagua. Check the announcement if you want to find out how to follow the congress.
This is a club activity on a basic computing idea: binary search shrinks the part of a list where the answer could be. An algorithm is a series of steps you can follow again to solve a problem. The NIST Dictionary of Algorithms explains that keeping data in order lets binary search cut the remaining part of a list in half.
Divide the choices in two with each question
Make 16 cards marked 1 to 16 and put them in order. One person secretly writes one of those numbers down. The pair doing the searching can ask only if the chosen number is greater than a certain number. A “no” means the target is equal to or below that number.
If the secret number is 13, here is one run:
1. Is it greater than 8? Yes. Keep the cards from 9 to 16.
2. Is it greater than 12? Yes. Keep 13 to 16.
3. Is it greater than 14? No. Keep 13 and 14.
4. Is it greater than 13? No. Only 13 remains.
Put a ruler between the half you keep and the half you set aside. After each answer, ask someone to say the first and last numbers that could still be right. When only one remains, check the paper held by the person who chose. That check is separate from the search.
Read alsoJaguars in Medellín: compare rosette patterns with your Pathfinder unitWork out which number to ask about
Suppose the answer to “Is it greater than 8?” was “no,” leaving cards 1 to 8 on the table. Make two groups of four. The biggest number in the left group is 4, so ask “Is it greater than 4?” If the answer is “yes,” the remaining cards are 5, 6, 7 and 8. The biggest number in the new left group is 6, so ask “Is it greater than 6?” The order of the remaining cards tells you which question to ask, before you know the answer.
Compare it with asking one by one
Swap roles and keep the same 16 cards. Now ask “Is it 1?”, “Is it 2?”, and so on. With each method, stop as soon as you know the number, including when only one option remains. The University of Canterbury's CS Unplugged project uses activities without computers to compare one-by-one searching, also called sequential search, and binary search.
Try 16: the one-by-one method can take 15 questions before only one card remains. Halving the options takes four questions. For 1, the one-by-one method finds it on question one, while halving takes four. The point of halving is to cap the number of questions in the longest search. Even if your number is at the end, you do not need to ask about every card.