Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Discrete Structures

Discrete Structures - Syllabus

Course Overview and Structure
Syllabus Notes Old Questions Unit Wise Questions Question Bank

Embark on a profound academic exploration as you delve into the Discrete Structures course (DS) within the distinguished Tribhuvan university's CSIT department. Aligned with the 2074 Syllabus, this course (CSC160) seamlessly merges theoretical frameworks with practical sessions, ensuring a comprehensive understanding of the subject. Rigorous assessment based on a 60 + 20 + 20 marks system, coupled with a challenging passing threshold of , propels students to strive for excellence, fostering a deeper grasp of the course content.

This 3 credit-hour journey unfolds as a holistic learning experience, bridging theory and application. Beyond theoretical comprehension, students actively engage in practical sessions, acquiring valuable skills for real-world scenarios. Immerse yourself in this well-structured course, where each element, from the course description to interactive sessions, is meticulously crafted to shape a well-rounded and insightful academic experience.


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 Objectives: The main objective of the course is to introduce basic discrete structures,

explore applications of discrete structures in computer science, and understand concepts of

Counting, Probability, Relations and Graphs respectively.


Units

Key Topics

  • Definition of Sociology
    BA-101

    This topic introduces the concept of sociology, its meaning, and significance in understanding human social behavior.

  • Nature of Sociology
    BA-102

    This topic explores the fundamental characteristics and principles that define the discipline of sociology.

  • Scope of Sociology
    BA-103

    This topic examines the boundaries and areas of study within the field of sociology, including its applications and relevance.

Key Topics

  • Introduction to E-commerce
    IN-1

    Overview of E-commerce and its significance in the digital age.

  • E-business vs E-commerce
    IN-2

    Understanding the differences between E-business and E-commerce.

  • Features of E-commerce
    IN-3

    Key characteristics and benefits of E-commerce.

  • Pure vs Partial E-commerce
    IN-4

    Types of E-commerce models and their applications.

  • History of E-commerce
    IN-5

    Evolution and development of E-commerce over time.

  • E-commerce Framework
    IN-6

    Understanding the components of E-commerce framework including People, Public Policy, Marketing and Advertisement, Support Services, and Business Partnerships.

  • Types of E-commerce
    IN-7

    Overview of different types of E-commerce including B2C, B2B, C2B, C2C, M-Commerce, U-commerce, Social-Ecommerce, and Local E-commerce.

Key Topics

  • Propositional Logic
    LO-3.1.1

    Study of logical operations and statements, including propositional equivalences.

  • Predicates and Quantifiers
    LO-3.1.2

    Introduction to predicates and quantifiers, including their use in logical statements.

  • Negation of Quantified Statements
    LO-3.1.3

    Learn how to negate quantified statements and understand their implications.

  • Proof of Quantified Statements
    LO-3.1.4

    Methods for proving quantified statements, including direct and indirect proof.

  • Nested Quantifiers
    LO-3.1.5

    Understanding the use of nested quantifiers in logical statements.

  • Rules of Inferences
    LO-3.1.6

    Study of rules of inferences, including how to apply them in logical arguments.

  • Basic Terminologies of Proof
    LO-3.2.1

    Introduction to basic terminologies used in proof methods.

  • Direct Proof
    LO-3.2.2

    Method of direct proof, including its application in various scenarios.

  • Indirect Proof
    LO-3.2.3

    Method of indirect proof, including its application in various scenarios.

  • Proof by Contradiction
    LO-3.2.4

    Method of proof by contradiction, including its application in various scenarios.

  • Proof By Contraposition
    LO-3.2.5

    Method of proof by contraposition, including its application in various scenarios.

  • Exhaustive Proofs
    LO-3.2.6

    Method of exhaustive proofs, including its application in various scenarios.

  • Proof by Cases
    LO-3.2.7

    Method of proof by cases, including its application in various scenarios.

  • Mistakes in Proof
    LO-3.2.8

    Common mistakes to avoid in proof methods and how to identify them.

Key Topics

  • Introduction to E-commerce
    IN-1

    Overview of E-commerce and its significance in the digital age.

  • E-business vs E-commerce
    IN-2

    Understanding the differences between E-business and E-commerce.

  • Features of E-commerce
    IN-3

    Key characteristics and benefits of E-commerce.

  • Pure vs Partial E-commerce
    IN-4

    Types of E-commerce models and their applications.

  • History of E-commerce
    IN-5

    Evolution and development of E-commerce over time.

  • E-commerce Framework
    IN-6

    Understanding the components of E-commerce framework including People, Public Policy, Marketing and Advertisement, Support Services, and Business Partnerships.

  • Types of E-commerce
    IN-7

    Overview of different types of E-commerce including B2C, B2B, C2B, C2C, M-Commerce, U-commerce, Social-Ecommerce, and Local E-commerce.

Key Topics

  • Nature of Internship
    CO-1

    The internship work should be relevant to the field of computer science and information technology, with a minimum duration of 180 hours or ten weeks.

  • Phases of Internship
    CO-2

    The internship evaluation consists of three phases: Proposal Submission, Mid-Term Submission, and Final Submission.

  • Provision of Supervision
    CO-3

    A regular faculty member of the college is assigned as a supervisor to supervise the students throughout the internship period.

  • Provision of Mentorship
    CO-4

    A regular employee of the intern providing organization is assigned as a mentor to guide the students throughout the internship period.

  • Evaluation Scheme
    CO-5

    The evaluation scheme consists of Proposal Defense, Midterm, and Final Defense, with a total of 200 marks.

  • Report Contents
    CO-6

    The internship report should contain prescribed content flow, including introduction, problem statement, objectives, and references.

  • Citation and Referencing
    CO-7

    The citation and referencing standard should be APA referencing standard, with proper citation and referencing in the document.

  • Report Format Standards
    CO-8

    The report format standards include page number, page size and margin, paragraph style, text font, section headings, figures and tables.

  • Final Report Binding and Submission
    CO-9

    The final report should be submitted in three copies, with a golden embracing and black binding, to the Dean Office, Exam Section, Institute of Science and Technology, Tribhuvan University.

  • Programmable Array Logic (PAL)
    CO-10

    A type of digital integrated circuit that can be programmed to perform a specific digital function, similar to PLA but with some differences.

  • Optical Disk
    CO-11

    A type of secondary storage that uses light to read and write data, including CDs, DVDs, and Blu-ray discs.

  • Magneto-Optical Disk
    CO-12

    A type of secondary storage that uses a combination of magnetic and optical technologies to store data.

  • How the Computer uses its Memory
    CO-13

    The process of how a computer uses its memory to execute instructions and perform tasks.

  • Protection and Security
    CO-14

    Protection mechanisms for programs, processes, users, and resources.

  • User Interface
    CO-15

    User interface, including command-line interface (CLI) and graphical user interface (GUI).

  • Examples of Operating Systems
    CO-16

    Examples of operating systems, including MS-DOS, Windows, and Linux.

Key Topics

  • Relational Database Design Using ER-to-Relational Mapping
    RE-1

    Learn how to design relational databases using ER-to-relational mapping, including mapping of regular entities, weak entities, relationship types, multivalued attributes, and N-ary relationships.

  • Informal Design Guidelines for Relational Schemas
    RE-2

    Understand informal design guidelines for relational schemas, including semantics of attributes in relations, redundant information in tuples and update anomalies, NULL values in tuples, and generation of spurious tuples.

  • Functional Dependencies
    RE-3

    Study functional dependencies, including definition, inference rules, Armstrong's axioms, attribute closure, equivalence of functional dependencies, and minimal sets of functional dependencies.

  • Normal Forms Based on Primary Keys
    RE-4

    Explore normal forms based on primary keys, including First Normal Form, Second Normal Form, Third Normal Form, and their general definitions.

  • Boyce-Codd Normal Form
    RE-5

    Learn about Boyce-Codd Normal Form, a higher normal form that ensures a relational schema is in a good structure.

  • Multivalued Dependency and Fourth Normal Form
    RE-6

    Understand multivalued dependency and Fourth Normal Form, which eliminates multivalued dependencies in a relational schema.

  • Properties of Relational Decomposition
    RE-7

    Study properties of relational decomposition, including attribute preservation, dependency preservation, and loss-less/non-additive join.

  • Applications of Recursion
    RE-8

    This topic explores the various applications of recursion in problem-solving, including tree traversals and dynamic programming.

  • Efficiency of Recursion
    RE-9

    This topic discusses the efficiency of recursive algorithms, including time and space complexity analysis.

  • Network Flow Optimization
    RE-10

    Optimization techniques for network flows, including maximal flows, minimal cuts, and the Max Flow-Min Cut Theorem.

 

Lab works

Laboratory Work (45 Hrs)

The laboratory work consists of implementing the algorithms and concepts discussed in the class.

Student should write programs to demonstrate concepts listed below.

Unit 1 (10 Hr)

1. Programs to implement set operations union, intersection, difference, and Cartesian product

2. Programs to implement ceiling and floor functions

3. Programs to implement fuzzy set operations

Unit 2 (10 Hr)

1. Programs to implement Euclidean and Extended Euclidean algorithms

2. Programs to implement binary integer addition, multiplication, and division

3. Programs to implement Boolean matrix operations join, product, and Boolean product

4. Programs to perform operations with large integers by breaking down them into set of small

integers

Unit 3 (6 Hr)

1. Programs to generate truth tables of compound propositions

2. Programs to test validity of arguments by using truth tables

Unit 4 (2 Hr)

1. Programs to compute an, bn mod m, linear search etc by using recursion

Unit 5 (7 Hr)

1. Programs to generate permutations and combinations

2. Programs to implements some probabilistic and randomized algorithms

Unit 6 (10 Hr)

1. Programs for representing relations, testing its properties, and testing equivalence

2. Programs to represent graphs, finding shortest path, and generating minimum spanning trees