Скачать или смотреть Discrete Structure All Important Concepts for Exam | BSc.CSIT/BCA/BIT | Nepali Explanation

In this video, we cover the most important concepts of Discrete Structure in Nepali language, specially designed for students of BSc.CSIT, BCA, BIT, and Computer Science.

📌 Topics Covered:

What is Discrete Structure?

Propositions & Logic (Truth Tables, Connectives)

Mathematical Reasoning & Proof Techniques

Set Theory & Relations

Functions & Algorithms

Euclidean and Extended Euclidean Algorithm

Pigeonhole Principle, Graphs & Trees

Applications in Computer Science & Cryptography

This is a complete revision guide for students preparing for BSc.CSIT 2nd Semester exams, assignments, and viva.

Timestamps :
00:00 - 07:39 = Euclidean Problems
07:40 - 17:46 = Extended Euclidean
17:47 - 26:49 = Pigeonhole Principle
26:50 - 35:44 = Chinese Remainder Theorem
35:44 - 43:47 = Proposition
43:58 - 51:15 = Proposition Example 1&2
51:16 - 01:09:18 = Proposition Example 3&4
01:09:19 - 01:19:35 = Dijkstra's Algorithm
01:19:36 - 1:30:36 = Kruskal's Algorithm

🎯 Best for:

BSc.CSIT 2nd Semester

BCA / BIT / BIM students

Entrance preparation

🔔 Don’t forget to subscribe for more Nepali tutorials on CSIT subjects, Discrete Structure, and Computer Science concepts.

#DiscreteStructure #BScCSIT #BCA #NepaliTutorial #ComputerScience