R23 CSE · 2-1 ✓ VERIFIED VS. PUBLISHED SYLLABUS 2026-07-09

Discrete Mathematics & Graph Theory JNTUK R23 · CSE · semester 2-1 · syllabus

This JNTUK R23 basic science course is listed for Computer Science and Engineering (CSE). It is listed in semester 2-1. It carries 3 credits. The published coverage runs across 5 units, from Mathematical Logic through Multi Graphs.

Verified vs. published syllabus Checked

Offered in

BranchesSemesterLTPC
CSE 2-1 30 03
SOURCE DOCKET

Published evidence

✓ Verified
Source
Checked
Record
5 published units

Verification scopeSubject name, credits, unit-wise syllabus, and course outcomes are sourced directly from JNTUK's own official R23 course structure and syllabus document, not an autonomous college's adaptation.

What you'll be able to do

  • Apply the principles of propositional and predicate logic to construct well-formed formulas and validate arguments using inference rules
  • Analyze and solve problems related to sets, relations, functions, lattices, and algebraic structures using appropriate mathematical techniques
  • Apply combinatorial techniques and generating functions to formulate and solve recurrence relations in discrete structures
  • Examine graph theoretic concepts such as paths, circuits, connectivity, and graph isomorphism, and apply them to model and solve real-world problems
  • Apply advanced graph algorithms (BFS, DFS, spanning trees, colouring, planar graphs) and evaluate their suitability in solving computational problems

5 units, from Mathematical Logic to Multi Graphs. Tick off units as you cover them — your progress stays on this device.

Unit-wise syllabus

0 / 5 COVERED