[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-394220-105":59,"doc-detail-394220-en":130},{"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":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","cse105-spring-2017-study-guide-for-exam-1","CSE105 Spring 2017 - Study guide for Exam 1","","Study guide for CSE105 Spring 2017 Exam 1, detailing the exam rules, format, and allowed materials. It specifies the test date, closed-book/closed-notes policy, and permission to use one double-sided handwritten 3x5 index card. It outlines the covered scope up to the lecture immediately preceding the exam, emphasizing Sipser Chapter 0 and Chapter 1 sections 1.1-1.3, and reviews core topics including automata, regular languages, closure properties, nondeterminism, and proofs.",{"@graph":69,"@context":122},[70,84,105],{"@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/cse105-spring-2017-study-guide-for-exam-1/394220/",{"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/cse105-spring-2017-study-guide-for-exam-1/394220.png","ImageObject",300,407,{"name":92,"@type":93},"MrHarris58","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-09","2026-09-26",true,{"@type":102,"interactionType":103,"userInteractionCount":39},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"When is CSE105 Spring 2017 Exam 1, and what are the seat instructions?","Question",{"text":112,"@type":113},"The first exam is in class Tuesday April 25, 2017. Assigned seats are available on Piazza, and students must take the exam for the section in which they are enrolled.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What materials are allowed during the exam?",{"text":117,"@type":113},"The exam is closed books and closed notes. Students may bring and use one double-sided handwritten 3 inch by 5 inch index card, and only their own card is permitted with no collaboration.",{"name":119,"@type":110,"acceptedAnswer":120},"Which topics and reading should students focus on for Exam 1?",{"text":121,"@type":113},"The exam covers all material up to and including the lecture immediately before the exam. Students are instructed to study Sipser Chapter 0 and Sections 1.1-1.3, with extra emphasis on Chapter 1, plus concepts such as sets, strings, languages, functions, graphs, Boolean logic, proofs, state machines, DFA, computation traces, regular languages, closure properties, nondeterminism, power-set construction, equivalence of automata, and regular expressions.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},394220,1791282174,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":39,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":14,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":143,"read_time":24,"preview_page_count":4},687212988360,"https://ap-avatar.wpscdn.com/davatar_276721f389ce27ea32af1340a28f341c","CSE105 Spring 2017-Study guide for Exam 1  \nThe 􀀌rst exam is in class Tuesday April 25, 2017 . The assigned seats are available on Piazza. You must take the exam with the section in which you are enrolled. The exam is closed books, closed notes, except that you may bring and use one (double-sided) handwritten standard sized (3 inch by 5 inch) index card. Each student may use only their own index card; no collaboration during the exam is allowed. The exam covers all the material up to and including the lecture immediately before the exam. In particular, you should study:  \n􀀏 Sipser Chapters 0 and Sections 1 .1-1.3.  \n(More emphasis on Chapter 1, since Chapter 0 is a review of material you are expected to know already.)  \n􀀏 The main concepts we discussed include  \nSets, strings, languages, functions, graphs, Boolean logic, proofs, state machines, 􀀌nite automata (DFA), computation traces, regular languages, closure (of arbitrary sets under arbitrary operations, and of the set of regular languages in particular), non-determinism, power-set construction, equivalence of automata, regular expressions.  \n􀀏 Recommended exercises from the textbook (question references are to the 3rd edition, International version):  \n{ 0.2, 0.3, 0.8, 0.13  \n{ 1.4b, 1 .4d, 1 .5a, 1 .6g, 1 .7a, 1 .7f, 1 . 10a, 1 . 19, 1 .20, 1 .45a.  \n􀀏 All assigned homework questions, as well as suggested questions from Discussions.  \nIt's a good idea to go over the feedback you received on the homework, and also look over the homework solutions posted on Piazza.  \nYou can expect to see some questions on the exam that are similar to homework questions.  \nBelow are questions indicative of the general style you might expect to see on the exam. You might 􀀌nd working through them helpful for studying purposes. Solutions will not be distributed for these practice problems (other than the ones already available for homework) . It is often much more productive to 􀀌gure out for yourself how to start a problem and then ask for help if and when you get stuck.  \n(1) Give state diagrams for DFAs recognizing the following languages over the alphabet fa; bg. (For full credit, use at most the given number of states and brie􀀍y justify your DFA by giving an informal description of the construction.)  \n(a) fw 2 fa; bg􀀃 j w is any string except aa and aaag. (This can be solved with 5 states.)  \n(b) fw 2 fa; bg􀀃 j w contains an even number of as, or contains exactly two bsg (This can be solved with 8 states.)  \n(2) Consider the NFA with state diagram  \n(a) Describe precisely the language (over 􀀆 = f0 ; 1g) recognized by this NFA.  \n(b) Draw the state diagram of a DFA that recognizes the same language.  \n(3) Fix an alphabet 􀀆 . For languages A and B (both over 􀀆), let the perfect shu􀀏e of A and B be the language  \nfw 2 􀀆 􀀃 j w = a 1 b 1 􀀁 􀀁 􀀁 akbk , where k 􀀕 0, each ai ; bi 2 􀀆 and a 1 􀀁 􀀁 􀀁 ak 2 A and b 1 􀀁 􀀁 􀀁 bk 2 B . g Prove that the class of regular languages (over 􀀆) is closed under perfect shu􀀏e.  \n(4) Prove that every NFA can be converted to an equivalent one that has no incoming transitions to its initial state.  \n(5) List the following regular expressions in order from left to right so that regular expression X is to the left of regular expression Y whenever L (X) 􀀒 L (Y ) .  \n(a) 0􀀃 1􀀃  \n(b) 0001􀀃  \n(c) (0􀀃 1􀀃 )􀀃  \n(d) 1􀀃 0􀀃 1􀀃","cbCaioyL0wC9lac4","https://ap.wps.com/l/cbCaioyL0wC9lac4","pdf",102394,"English","# Exam 1 logistics\n## Allowed materials and exam policy\n## Scope and reading assignments\n# Key concepts to review\n## Automata and regular languages\n## Logic, proofs, and computations\n# Recommended practice exercises","[{\"question\":\"When is CSE105 Spring 2017 Exam 1, and what are the seat instructions?\",\"answer\":\"The first exam is in class Tuesday April 25, 2017. Assigned seats are available on Piazza, and students must take the exam for the section in which they are enrolled.\"},{\"question\":\"What materials are allowed during the exam?\",\"answer\":\"The exam is closed books and closed notes. Students may bring and use one double-sided handwritten 3 inch by 5 inch index card, and only their own card is permitted with no collaboration.\"},{\"question\":\"Which topics and reading should students focus on for Exam 1?\",\"answer\":\"The exam covers all material up to and including the lecture immediately before the exam. Students are instructed to study Sipser Chapter 0 and Sections 1.1-1.3, with extra emphasis on Chapter 1, plus concepts such as sets, strings, languages, functions, graphs, Boolean logic, proofs, state machines, DFA, computation traces, regular languages, closure properties, nondeterminism, power-set construction, equivalence of automata, and regular expressions.\"}]","CSE105 Spring 2017 - Study guide for Exam 1 | PDF",1790400461]