1) Create a lift management system where there are variable number of elevators and variable number of floors .

How will you decide where the lift needs to stop ? You are free to design the button interface etc . Points ( 30 ) 2) ////////Design a library for seamless integration of very large integers . Overload the operators or explore the feasibility of the same . Carry out basic addition , subtraction , multiplication , division and mod operations .Integers may have 100 or 1000s of digits. Points (45) 3) Theoritical : Write a report on the scope of using companion matrices to solve linear recursive relations . You need to spend time understanding the same as well . points (15) 4) Design an algorithm that predicts the maximum score you can obtain in a game of bubble breaker game . http://www.gamemew.com/Puzzle_Games/Bubble_Breaker_2_3545.html. You need add a few more options to this game which i will tell you when u submit your design .points (75). 5) Design an algorithm that computes the moves that you need to make in order to finish a given freecell game . If the game cannot be won you should display the same . points 60 6) Design a poker cheat which gives you a rating for your hand given the number of players , your cards and the cards on the flop . You can add other inputs if any . The rating should be directly indicative of the probability that you win . points 30 7) ///////Write an algorithm that carries out some sort of file encryption . you are only allowed to shuffle the order of words in a file , you cannot use additional characters . There should be a decryption algorithm that can obtain the original file from any file that was encrypted using the algorithms as well . points (15) 8) Write an algorithm that selects the best possible fantasy team given the constrains of a fantasy football/ cricket game .Constrains maybe only 1 goalkeeper, no more than 3 people from the same team etc . You are given a possible list of configurations , a player his team and the points he has scored along with its value . All you need to do is print the best possible team . points 30 9) Write a simulator that allocates space for a file in memory and manages the deletion ofa file as well . How will you address fragmentation and minimize the same ? points (15) 10) Write a program that generates all possible anagrams of a given string . there should be no repetitions . Explore the possibility of using prefix trees for the same . You should also have the option of generating anagrams that are meaningful words only (additional spaces can be used ).Check the validity with a dictionary (you need to do that in the lab ) points (45) . 11) Given a chess board with set chess pieces , determine if a definite winner is possible to the game . points 45 12) Write a tokenizer equivalent class that parses a string and splits them up as tokens . You should be able to specify a string of tokens that can be used to identify tokens as well . be as generic as possible . points (45) 13) Create a program that converts words in English to equivalent ( Phonetics) hindi words and vice versa . Try integrating it with the keyboard to enable typing hindi words in English . points (75)