1 / 17

Programming Midterm Review

Programming Midterm Review. CSCI2100B Data Structure. Background. CUHK has a strong tradition in ACM ICPC 8 th in the world in 2000 8 th in the world in 2011 Many regional and world final appearances Excellent Tutors 6 weeks to set the questions Weeks for the preparation of the system

dena
Download Presentation

Programming Midterm Review

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Programming Midterm Review CSCI2100B Data Structure

  2. Background • CUHK has a strong tradition in ACM ICPC • 8th in the world in 2000 • 8th in the world in 2011 • Many regional and world final appearances • Excellent Tutors • 6 weeks to set the questions • Weeks for the preparation of the system • 1 day to copy the hard disks • Additional hours

  3. Exam Statistics • Number of Participants: 78 • All participants solved at least 1 problem!!! • One participant solved all 7 problems!!! • Average number of solved problems: 2.15 • Average time (penalty): 183 • Total attempts per participant: 7.9

  4. Exam Statistics • Number of solved problems: • 7 – 1 participant • 5 – 1 participant (1 non-CSE major) • 4 – 2 participants (1 non-CSE major) • 3 – 13 participants (1 non-CSE major) • 2 – 48 participants (6 non-CSE major) • 1 – 13 participants (2 non-CSE major)

  5. Exam Statistics • Acceptance rate for each Problem: • A – 77/134 (57.46%) • B – 66/231 (28.57%) • C – 2/139 (1.44%) • D – 4/25 (16.00%) • E – 16/48 (33.33%) • F – 2/40 (5.00%) • G – 1/2 (50.00%)

  6. Prize • Championship: • CHAN, Pak Hay (1155029810) • 1st Runner-up: • LAM, Ka Ho (1155031192) • 2nd Runner-up • YU, Chun Lung (1155029407) • Honorable Mention: • PANG Yui Tik (1155030526) • WAN, Ka Ki (1155030851)

  7. Prize • Best Female Coder: • CHU, Wing Yin (1155030760) • Honorable Mention: • DERMAWAN, Teresa (1009637094)

  8. Prize • Best Non-CSE Coder: • LAM, Ka Ho (1155031192) • Honorable Mention: • PANG, Yui Tik (1155030526) • Most Effective Coder: • PANG, Yui Tik (1155030526)

  9. Miscellaneous • Extra credit problem • Looking for summer interns • Internet/Web development • Mobile development

  10. Problem Review

  11. A – String Revision • http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3323

  12. B – Intersection of Two Arrays • http://www.geeksforgeeks.org/union-and-intersection-of-two-sorted-arrays-2/ • Best solution: O(m+n) m – the length of array A n – the length of array B

  13. C – Stone Piles • http://acm.timus.ru/problem.aspx?num=1005 • Brute force can satisfy the time limit

  14. D – Prime Palindromes • USACO 1.5.2 • USACO Training Program curriculum is one of the best paths to learn data structures and algorithms.

  15. E – Train Re-arrangement II • Adapted from homework • Algorithm is the same, only need to change stack functions to queue functions

  16. F – Fruit Merge II • Adapted from homework • Use two queues, one for original fruit piles, the other for newly combined fruit piles • Every time, choose two smallest numbers from the two queues

  17. G – Counting Factor Trees • http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3405 • Dynamic Programming

More Related