Discrete Structures (CS2053)

[vc_row el_class=”inner-body-content” css=”.vc_custom_1666761746247{padding-top: 30px !important;padding-bottom: 20px !important;}”][vc_column][vc_custom_heading text=”COURSE OBJECTIVES” use_theme_fonts=”yes” css=”.vc_custom_1666761675783{margin-top: 0px !important;}”][vc_column_text]

  • To lay the foundations for theoretical computer science.
  • To understand the basic mathematical concepts generally required for most computer science courses.
  • Developing precise and formal reasoning skills in students.
  • Exploring different ways of mathematical thinking i.e. Logical thinking, Relational thinking, Recursive thinking, Quantitative thinking and Analytical thinking.

[/vc_column_text][vc_custom_heading text=”COURSE LEARNING OUTCOMES (CLO)” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text css=”.vc_custom_1666761665602{margin-bottom: 0px !important;}”]CLO: 1. Apply the elements of propositional logic statements and operations using truth table, logical identities, rules of inference for theorem proving[C3-Application]
CLO: 2. Construct inductive hypothesis along with recursive definitions using mathematical and logical notation to define and formally reason about basic mathematical concepts. [C3-Application]
CLO: 3. Understand asymptotic notation, its significance, and be able to use it to analyze asymptotic performance for some basic algorithmic examples with the help counting principles such as permutation and combinations.[C4-Analysis]
CLO: 4. Understand some basic properties of graphs and related discrete structures, and be able to discover their relationship with practical examples [C3-Application][/vc_column_text][/vc_column][/vc_row]