Discrete Structures is a vital subject in the second semester of BSc.CSIT, focusing on mathematical foundations for computer science. The course covers topics such as logic and proof techniques, set theory, relations and functions, graph theory, combinatorics, and Boolean algebra. These concepts are essential for understanding algorithms, data structures, cryptography, and artificial intelligence. Mastering discrete structures enhances problem-solving skills and logical thinking, which are crucial for programming and software development.
Tribhuvan University
Discrete Structures
Discrete Structures
Course Title: Discrete Structures
Course no: CSC165
Nature of course: Theory + Lab
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Credit Hours: 3
Course Description : The course covers fundamental concepts of discrete structure like introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science.
Course Objective : The main objective of the course is to introduce basic discrete structures, explore applications of discrete structures in computer science, understand concepts of Counting, Probability, Relations and Graphs respectively.
The laboratory work consists of implementing the algorithms and concepts discussed in the class. Student should implement problems with following concepts; • Set Operations and Boolean Matrix Operations • Primility Testing, Number Theory Algorithms, and Operations on Integers • Counting and Some Recursive Algorithms • Algorithms for Relations, Graphs
