{"id":962,"date":"2021-12-26T14:15:56","date_gmt":"2021-12-26T14:15:56","guid":{"rendered":"https:\/\/itgeeks.in\/home\/?p=962"},"modified":"2021-12-26T14:16:05","modified_gmt":"2021-12-26T14:16:05","slug":"2k6cs-303-discrete-computational-structures","status":"publish","type":"post","link":"https:\/\/itgeeks.in\/home\/?p=962","title":{"rendered":"2K6CS 303 : DISCRETE COMPUTATIONAL STRUCTURES"},"content":{"rendered":"\n

Module I: Logic (13 hours)<\/strong>
Prepositional Logic – Logical arguments – Consistency completeness and independence – Formal proofs – Natural deduction – Soundness, completeness and compactness theorems – Predicate logic – Completeness -Resolution – Unification algorithm
Module II: Relational structures (13 hours)<\/strong>
Sets relations and functions – Pigeonhole principle – Cardinals – Countable and uncountable sets – Digonalization – Equivalence relations and partitions – Partial order – Lattices and Boolean algebra
Module III: Group theory (13 hours)<\/strong>
Groups and subgroups – Products and quotients – Homomorphism theorems – Cosets and normal subgroups – Lagrange\u2019s theorem – Permutation groups – Cayley\u2019s theorem – Hamming Codes and Syndrome decoding
Module IV: Rings and fields (13 hours)<\/strong>
Rings, integral domains and fields – Ideals and quotient rings – Euclidean domains – Polynomial rings and division algorithm – Factorization and unique factorization – Irreducibility – Field properties and extensions – Ruler and compass constructions – Introduction to cyclic codes<\/p>\n\n\n\n

Text books<\/strong>
1. Truss J.K., Discrete Mathematics for Computer Scientists, Addison Wesley (Modules I & II)
2.\u00a0Kolman B. & Busby R.C., Discrete Mathematical Structures for Computer Science, Prentice Hall of India<\/a> (Modules III & IV)
Reference books<\/strong>
1. Liu C.L., Elements of Discrete Mathematics, McGraw Hill<\/a>
2.\u00a0Grimaldi P., Discrete & Combinatorial Mathematics, Addison Wesley
3. Tremblay, J P., Manohar R – Discrete Mathematical Structures to Applications to Computer Science \u2013
Tata McGraw-Hill<\/a><\/p>\n\n\n\n

\n
S3 Question Papers<\/a><\/div>\n\n\n\n
Notes<\/a><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

Module I: Logic (13 hours)Prepositional Logic – Logical arguments – Consistency completeness and independence – Formal proofs – Natural deduction<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[40,18,9,8],"tags":[7],"class_list":["post-962","post","type-post","status-publish","format-standard","hentry","category-ku-s3-cse","category-ku-syb-s3","category-ku-syllabus","category-syllabus","tag-kannur-university"],"_links":{"self":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/962","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=962"}],"version-history":[{"count":1,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/962\/revisions"}],"predecessor-version":[{"id":971,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/962\/revisions\/971"}],"wp:attachment":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=962"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=962"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=962"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}