Skip to content

🔌 CS202 — Discrete Structures

  • Discrete Structure is a foundational subject in computer science that deals with mathematical structures used to represent and solve computational problems. It includes topics like logic, set theory, relations, functions, combinatorics, graph theory, and Boolean algebra. These concepts form the backbone of algorithms, data structures, computer networks, and database theory. In short, it helps students develop logical thinking and problem-solving skills essential for computer science.

📚 Available Resources

#ResourceActions
1
Syllabus
2
Discrete Mathematics by Rosen

📑 Available Pyqs

#ResourceAccess
1Mid Semester📥 Open
2End Semester📥 Open

📤 Contributing

How to add resources

Option A: Upload PDFs

CE102/
├── CE102_Mid_2024.pdf
├── CE102_End_2023.pdf
└── CE102_Notes_TopicX.pdf

Add your Google Drive share link to the table above following the existing format.

📝 Naming Convention

  • For exams: CE102_Mid_YYYY.pdf or CE102_End_YYYY.pdf
  • For notes: CE102_Lecture#_Topic.pdf
  • For assignments: CE102_Assignment#_YYYY.pdf

💡 Important: Only add files you have permission to share


Need help? Open an issue or contact the maintainers

← Back to SEM3