11 20_FYMECE_11 DIPALBEN VASANTBHAI PATEL 4udipalpatel@gmail.com The Huffman Coding Algorithm 12 20_FYMECE_12 Patel Foram Jayeshbhai The Longest Common Subsequence Problem (LCS), Applying 13 20_FYMECE_13 TAILOR PRIYALBEN ANANDKUMAR priyaltailor5@gmail.com Dynamic Programming to the LCS Problem 14 20_FYMECE_14 Bhadaliya Milan Jatinbhai bhadaliya_milan@yahoo.com One Dimensional Range Searching 15 20_FYMECE_15 RAVAL DHRUV SHAILESHBHAI Two Dimensional Range Searching 16 20_FYMECE_16 Jully Popat jullypopat@gmail.com Constructing a Priority Search Tree 17 20_FYMECE_17 Raghvani Shweta M. Searching a Priority Search Tree 18 20_FYMECE_18 PATEL NIDHIBAHEN BHIKHUBHAI nidhipatel98.np23@gmail.com Priority Range Trees 19 20_FYMECE_19 ZALA UMANGI NILKANTHSINH umangi.n.zala@gmail.com Quadtrees 20 20_FYMECE_20 Sarvaiya dhara sarvaiyadhara2420@gmail.com 21 20_FYMECE_21 Baloch Hafsabanu Moyunus hafsabaloch71@yahoo.com Recent Trands in Hashing 22 20_FYMECE_22 PATEL TINKAL MAHESHBHAI Trees, and various computational geometry methods for 23 20_FYMECE_23 PANDYA DIVYABAHEN DASHRATHBHAI pandyadivya1410@gmail.com effeciently solving the new evolving problem
(Đề có 04 trang) (SV làm bài trên phiếu trả lời) Thời gian: 90 phút, không kể thời gian phát đề (SV KHÔNG được sử dụng tài liệu/ các thiết bị điện tử)