[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-397964-105":59,"doc-detail-397964-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","cs-2305005-discrete-mathematics-for-computing-i","CS 2305.005 - Discrete Mathematics for Computing I","","Course syllabus for CS 2305.005/CE 2305, Discrete Mathematics for Computing I, covering counting principles, Boolean operations, logic and proof methods, recurrence relations, sets/relations/functions, elementary graph theory, and elementary number theory. Includes course learning outcomes on definitions and properties of logic, constructing proofs by induction, algorithm understanding with Big-O and complexity, core counting, sets/relations/functions, number theory, and graph theory. Provides scheduling, prerequisites (ALEKS or specified MATH 2413/2417 with C+), mode, grading breakdown, testing center exam procedures, and course/instructor policies.",{"@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/cs-2305005-discrete-mathematics-for-computing-i/397964/",{"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/cs-2305005-discrete-mathematics-for-computing-i/397964.png","ImageObject",300,407,{"name":92,"@type":93},"anakgang17","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-09","2026-09-27",true,{"@type":102,"interactionType":103,"userInteractionCount":105},"InteractionCounter",{"@type":104},"ViewAction",12,{"@type":107,"mainEntity":108},"FAQPage",[109,115,119],{"name":110,"@type":111,"acceptedAnswer":112},"What are the course prerequisites for CS 2305.005?","Question",{"text":113,"@type":114},"Prerequisites require an ALEKS score, or (MATH 2413 or MATH 2417) with a grade of C or better.","Answer",{"name":116,"@type":111,"acceptedAnswer":117},"How is the final grade calculated?",{"text":118,"@type":114},"Homeworks are 25%, Smartbooks 15%, and exams 60% (midterm and final, each 30%). The lowest homework and lowest Smartbook scores are automatically dropped.",{"name":120,"@type":111,"acceptedAnswer":121},"What are the exam signup and exam-day rules?",{"text":122,"@type":114},"Midterm and final signup opens Tuesday, 1/21/2025 and must be completed no later than 48 hours before the appointment time. Exams are 90 minutes at the UTD testing center, and students may bring one single-sided cheat sheet (up to 8.5x11 inches) only.","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},397964,1790555142,{"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":34,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":4},962090883568,"https://ap-avatar.wpscdn.com/davatar_a8503ba1806abce46bf441b54a3ca4cd","CS 2305.005: Discrete Mathematics for Computing I, Spring 2025. (Same as CE 2305.)  \nTuesday & Thursday  \n11 :30am-12:45pm  \nECSW 1.315  \n\n| Professor Contact Information\u003Cbr>Name: Daniel Gibney\u003Cbr>Phone: (972) 883-4224\u003Cbr>[E-mail:](E-mail: Daniel.Gibney@utdallas.edu)[ ](E-mail: Daniel.Gibney@utdallas.edu)[Daniel.Gibney@utdallas.edu](E-mail: Daniel.Gibney@utdallas.edu)\u003Cbr>[Office: ECSS 4.706](Office: ECSS 4.706)\u003Cbr>Office Hours\u003Cbr>Tuesday 3pm-4pm Friday 2pm-3pm Or by appointment\u003Cbr>Teaching Assistant\u003Cbr>Name: TBA\u003Cbr>Email: TBA |\n| --- |\n| Course Pre-requisites, Co-requisites, and/or Other Restrictions\u003Cbr>Prerequisites: ALEKS score required or (MATH 2413 or MATH 2417) with a grade of C or better. |\n| Course Description\u003Cbr>Discrete Mathematics for Computing I (3 semester credit hours) Principles of counting. Boolean operations. Logic and proof methods. Recurrence relations. Sets, relations, functions. Elementary graph theory. Elementary number theory. |\n\nCourse Learning Outcomes  \n1. Ability to use and apply basic definitions and properties of logic  \n2. Ability to recognize and construct valid proofs including proofs by induction  \n3. Ability to understand what an algorithm is, use algorithms, use Big-O notation and algorithmic complexity  \n4. Ability to use basic counting techniques  \n5. Ability to use and apply basic definitions and properties of sets, relations, functions  \n6. Ability to understand and apply elementary number theory  \n7. Ability to understand and apply graph theory  \n\n| Course Content\u003Cbr>All content for this course (lecture videos, assignments, exams, etc.) are for registered students of this course only. Do not share or publicly post any of these materials. |\n| --- |\n| Course Mode\u003Cbr>The course mode is face-to-face. Lectures will be in our assigned classroom on campus. Exams will be taken in the testing center. Homeworks and smartbooks are online. |\n\nGrading Policy  \n• Homeworks 25%: There will be roughly one homework assignment for each chapter of the book we cover (roughly every 1 to 2 weeks), consisting of a mix of multiple choice and written answer problems.  \n• Smartbooks 15%: Smartbook assignments are taken online through the McGraw Hill Connect platform. They will be assigned each week and are graded based on the percentage you complete.  \n• Exams 60%: There will be a midterm and a final, each worth 30% . Each exam will be 90 minutes long and will be taken at the UTD testing center. The Midterm and Final will be open for sign up from Tuesday, 1/21/2025 .  \nYour lowest homework score and your lowest Smartbook score will automatically be dropped.  \nThe following cutoffs will be used when determining your course grade:  \n• 95 \u003C= A+ \u003C= 100  \n• 85 \u003C= A \u003C 95  \n• 80 \u003C= A- \u003C 85  \n• 75 \u003C= B+ \u003C 80  \n• 65 \u003C= B \u003C 75  \n• 60 \u003C= B- \u003C 65  \n• 55 \u003C= C+ \u003C 60  \n• 45 \u003C= C \u003C 55  \n• 40 \u003C= C- \u003C 45  \n• 35 \u003C= D+ \u003C 40  \n• 25 \u003C= D \u003C 35  \n• 20 \u003C= D- \u003C 25  \n• F \u003C 20  \n\n| Connect and Elearning\u003Cbr>• We will be using McGraw Hill Connect this semester. The recommended way to sign up is as follows. Go to elearning. Click on the first homework or smartbook assignment. This will direct you to a pay screen for Connect. At that time you can purchase Connect access for $86 with a credit card which will give you access to Connect, including the ebook. You will also see two other options, the first is if you already bought a code from the bookstore (which may be more expensive), and the other option is complementary two-week access, though you will eventually need to purchase.\u003Cbr>• For homeworks and smartbook assignments, you should always access them through elearning (i.e. let elearning direct you to Connect, rather than directly going to Connect), as this will ensure your grades will be populated in elearning. |\n| --- |\n| Testing Center Information\u003Cbr>Exams will be at the UTD testing center. Sign up and guidelines:\u003Cbr>[https://ets.utdallas.edu/testing-center/students](https://ets.utdallas.edu/testing-center/students)\u003Cbr>[The two exams are ","cbCaisRhnMezBoAQ","https://ap.wps.com/l/cbCaisRhnMezBoAQ","pdf",115368,"English","# Course Information\n## Meeting Time and Location\n## Instructor and Contact\n# Course Structure\n## Pre-requisites and Restrictions\n## Course Description\n## Course Learning Outcomes\n## Course Content and Sharing Policy\n## Course Mode\n# Assessment and Grading\n## Homework, Smartbooks, and Exams\n## Grade Cutoffs\n# Connect and eLearning\n## Registration and Access\n## Grade Population Workflow\n# Testing Center Information\n## Exam Signup Rules\n## Exam Materials (Cheat Sheet)\n# Course & Instructor Policies","[{\"question\":\"What are the course prerequisites for CS 2305.005?\",\"answer\":\"Prerequisites require an ALEKS score, or (MATH 2413 or MATH 2417) with a grade of C or better.\"},{\"question\":\"How is the final grade calculated?\",\"answer\":\"Homeworks are 25%, Smartbooks 15%, and exams 60% (midterm and final, each 30%). The lowest homework and lowest Smartbook scores are automatically dropped.\"},{\"question\":\"What are the exam signup and exam-day rules?\",\"answer\":\"Midterm and final signup opens Tuesday, 1/21/2025 and must be completed no later than 48 hours before the appointment time. Exams are 90 minutes at the UTD testing center, and students may bring one single-sided cheat sheet (up to 8.5x11 inches) only.\"}]","CS 2305.005 - Discrete Mathematics for Computing I | PDF",1790468934,18]