[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-390347-105":59,"doc-detail-390347-en":131},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":124,"head_meta":126,"extra_data":128,"updated_unix":130},105,"en","cs165-practice-final-exam-questions","CS165 - Practice Final Exam Questions","","Practice final exam questions for CS165 that provide a comprehensive review plan aligned with course coverage before Midterm 1, between Midterm 1 and Midterm 2, and after Midterm 2. The set includes problems on hashing techniques (linear, quadratic, double hashing), expression trees with conversions to postfix/infix/prefix and integer evaluation, and graph algorithms such as DFS, BFS, and topological sort. Answer section is included for selected tasks, supporting self-checking.",{"@graph":69,"@context":123},[70,84,106],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":20,"@type":76,"position":81},"https://docshare.wps.com/document/exam/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/cs165-practice-final-exam-questions/390347/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/cs165-practice-final-exam-questions/390347.png","ImageObject",300,407,{"name":92,"@type":93},"Eliana","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-08","2026-09-25",true,{"@type":102,"interactionType":103,"userInteractionCount":105},"InteractionCounter",{"@type":104},"ViewAction",11,{"@type":107,"mainEntity":108},"FAQPage",[109,115,119],{"name":110,"@type":111,"acceptedAnswer":112},"What topics are included in the CS165 practice final questions?","Question",{"text":113,"@type":114},"The questions cover hashing (linear, quadratic, double hashing), expression trees (postfix/infix/prefix and evaluation), and graph algorithms including DFS, BFS, and topological sort.","Answer",{"name":116,"@type":111,"acceptedAnswer":117},"How should students review topics for the final exam?",{"text":118,"@type":114},"Students should review all topics covered before Midterm 1, between Midterm 1 and Midterm 2, and after Midterm 2, using the practice materials provided for the three parts.",{"name":120,"@type":111,"acceptedAnswer":121},"How are collisions handled in the hashing practice problems?",{"text":122,"@type":114},"The document asks for insertion results and collision counts under linear probing, quadratic probing, and double hashing, including which indices are tried unsuccessfully and when insertion succeeds.","https://schema.org",{"og:url":83,"og:type":125,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":127,"canonical":83},"index,follow",{"doc_id":129,"site_id":62},390347,1790528218,{"code":4,"msg":5,"data":132},{"doc_id":129,"user_id":133,"nickname":92,"user_avatar":134,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":135,"file_id":136,"file_url":137,"file_type":138,"file_size":139,"view_count":105,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":140,"language":141,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":142,"faqs":143,"seo_title":144,"seo_description":67,"update_tm":145,"read_time":146,"preview_page_count":4},4398048949847,"https://ap-avatar.wpscdn.com/avatar/400002536579ef2da7f?_k=1778318612642679267","CS165  \nPractice Final Exam Questions  \nA full list of topics for the Final is available as a separate PDF document linked from the Course Schedule page. The final exam is comprehensive. Thus, when you review the material, you must include the topics that were covered before Midterm 1, between Midterm 1 and Midterm 2, and after Midterm 2.  \nFor your convenience, we have included the practice materials from the three parts in a single document. These items are in reverse order (i.e., most recent first) .  \nPage 1  \nCS165, Practice Midterm Problems, Spring 2020  \nPART I  \nThis part of the practice problem set corresponds to Weeks 13-15.  \nHashing  \nGraphs  \nExpression Trees  \nPage 2  \nCS165, Practice Midterm Problems, Spring 2020  \nEXPRESSION TREES – 1  \nUsing the expression tree shown below, answer the following questions:  \n1. Show the postfix expression represented by the tree, with spaces between each token, and no leading or trailing spaces.  \n2. Show the infix expression represented by the tree, with spaces between each token, and no leading or trailing spaces.  \n3. Show the prefix expression represented by the tree, with spaces between each token, and no leading or trailing spaces.  \n4. What does the expression evaluate to, assuming integer math and the normal Java order of operations, which are of course reflected in the prefix and postfix forms and the tree? Do this using the tree, and verify the answer using the infix expression.  \nPage 3  \nCS165, Practice Midterm Problems, Spring 2020  \nEXPRESSION TREES – 2  \nGiven the infix expression (29 – 3) * 4 / 6 + 68 %(3 + 10), answer the following questions.  \n5. Create an expression tree that represents this expression.  \n6. Show the postfix expression represented by the tree, with spaces between each token, and no leading or trailing spaces.  \n7. Show the prefix expression represented by the tree, with spaces between each token, and no leading or trailing spaces.  \n8. What does the expression evaluate to, assuming integer math and the normal Java order of operations, which are of course reflected in the prefix and postfix forms and the tree? Do this using the tree, and verify the answer using the infix expression.  \nPage 4  \nCS165, Practice Midterm Problems, Spring 2020  \nHASHING  \n9. With linear probing, in which entry in the left hash table will the colliding object with key 15 be stored? Which entry would be used for quadratic probing? The table size is 13, and the hash function is a simple modulo of the integer key. Also list the indices that are tried unsuccessfully.  \nLINEAR PROBING:  \nQUADRATIC PROBING:  \n10. Suppose we use a double hashing scheme for a hash table of size 20.  \nh1 (k) = k%20  \nh2 (k) = 12-k%12  \na. Insert 17. Which index? How many collisions?  \nb. Insert 27. Which index? How many collisions?  \nc. Insert 29. Which index? How many collisions?  \nd. Insert 47. Which index? How many collisions?  \n\n| Index: | Key: |\n| --- | --- |\n| 0 | 39 |\n| 1 | 53 |\n| 2 | 67 |\n| 3 | 81 |\n| 4 | 95 |\n| 5 | 18 |\n| 6 |  |\n| 7 | 33 |\n| 8 | 47 |\n| 9 | 61 |\n| 10 |  |\n| 11 |  |\n| 12 | 25 |\n\n\n| Index: | Key: |\n| --- | --- |\n| 0 |  |\n| 1 |  |\n| 2 |  |\n| 3 |  |\n| 4 |  |\n| 5 |  |\n| 6 |  |\n| 7 |  |\n| 8 |  |\n| 9 |  |\n| 10 |  |\n| 11 |  |\n| 12 |  |\n| 13 |  |\n| 14 |  |\n| 15 |  |\n| 16 |  |\n| 17 |  |\n| 18 |  |\n| 19 |  |\n\nPage 5  \nCS165, Practice Midterm Problems, Spring 2020  \nUNDIRECTED GRAPHS (DFS, BFS)  \nNote: In all algorithms, the tie breaking rule is to select the node with the lowest value, all other things being equal!  \n11. Please list the order of nodes for a depth-first search (DFS) and breadth-first search (BFS) starting at vertex A. All nodes should be listed:  \nDFS: __________________  \nBFS: __________________  \nPage 6  \nCS165, Practice Midterm Problems, Spring 2020  \n12. DIRECTED GRAPHS (DFS, BFS, TOPOLOGICAL SORT)  \nUsing the above directed graph, for each of the sequences given, tell if it it DFS, BFS, or TS sorted. Unlike the previous question, here there are no restrictio","cbCaidfDuKxJxIuO","https://ap.wps.com/l/cbCaidfDuKxJxIuO","pdf",563844,37,"English","# PART I\n## Expression Trees - 1\n## Expression Trees - 2\n## Hashing\n## Undirected Graphs (DFS, BFS)\n## Directed Graphs (DFS, BFS, Topological Sort)\n# ANSWERS","[{\"question\":\"What topics are included in the CS165 practice final questions?\",\"answer\":\"The questions cover hashing (linear, quadratic, double hashing), expression trees (postfix/infix/prefix and evaluation), and graph algorithms including DFS, BFS, and topological sort.\"},{\"question\":\"How should students review topics for the final exam?\",\"answer\":\"Students should review all topics covered before Midterm 1, between Midterm 1 and Midterm 2, and after Midterm 2, using the practice materials provided for the three parts.\"},{\"question\":\"How are collisions handled in the hashing practice problems?\",\"answer\":\"The document asks for insertion results and collision counts under linear probing, quadratic probing, and double hashing, including which indices are tried unsuccessfully and when insertion succeeds.\"}]","CS165 - Practice Final Exam Questions | PDF",1790333069,93]