IOE PapersTU
PYQs & Syllabus Archive
ENCT 251Bachelor in Electronics, Communication and Information Engineering · Semester 42 Papers Available

Discrete Structure

Past examination question papers and complete curriculum syllabus for Discrete Structure (ENCT 251), Bachelor in Electronics, Communication and Information Engineering Semester 4 under Institute of Engineering (IOE), Tribhuvan University.

Sem 4 Subjects (6)View Full Semester Overview →
ENSH 252Numerical MethodsENCT 251Discrete StructureENEX 252InstrumentationENEX 253Computer Organization and ArchitectureENEX 254ElectromagneticsENEX 255Signals and Systems
PDF PapersMost Asked PYQsPast 10 YearsSyllabusMarks Scheme

Past Question Papers (PDF)

Switch tabs to view different exam papers
Available Papers:

4th-sem_Discrete Structure.pdf

IOE Past Examination Paper

Download PDF
Served via fast CDN. Read in full view or download for offline study.
Drive Mirror ↗Direct Download ↓

Document information: This past examination paper is identified as an IOE/TU academic document and was cataloged from a public Google Drive archive. This independent website did not create the examination paper and is not affiliated with TU or IOE.

Rights holders can request correction or removal by emailing subeshgaming@gmail.com with this page URL and supporting details.

Most Frequently Asked Questions

Top recurring IOE board exam questions for Discrete Structure with verified mark schemes, formula notation, and recurrence frequency.

Showing 40 of 40 top repeated questions
5 Chapters · Click any chapter to expand
·

Year-wise & Session-wise Exam Papers

Complete questions from each exam session (Regular & Back exams from 2082 to 2069) for Discrete Structure. Click any session paper to expand.

Showing 123 questions across 13 exam session papers
Institute of Engineering • 2082 Kartik Board Examination
Q1[6 Marks]Logic and Induction
“Somebody in this class enjoys whale watching. Every person who enjoys whale watching cares about ocean pollution. Therefore, there is a person in this class who cares about ocean pollution”. Show whether the given argument is valid or not using rules of inferences.
Q2[2 Marks]Proof Techniques
What do you mean by contradiction and contingency? Prove by using the resolution as only inference rule available that “If today is Tuesday, I have a test in mathematics or economics”. “If my economic professor is sick, I will not have test in economics”. “Today is Tuesday and my economic professor is sick” therefore “I have a test in mathematics”.
Q3[8 Marks]Proof Techniques
Prove by Mathematical induction: is divisible by 21 for n as the positive integer”.
Q4[4 Marks]Proof Techniques
Prove that is irrational by giving a proof by contradiction.
Q5[8 Marks]Automata Theory, Regular Language and Grammar
Design finite state automata that accepts precisely those strings over that ends with the substring "baa". Your design should include the proper definition of the finite state automaton, transition table and the transition diagram.
Q6[3 Marks]Automata Theory, Regular Language and Grammar
Consider the regular grammar defined by Set of Terminals , Set of Non-Terminals with productions and S being the starting symbol. Construct a non-deterministic finite state automaton equivalent to the given regular grammar. Use this non-deterministic finite state automaton to generate equivalent deterministic finite state automaton.
Q7[6 Marks]Recurrence Relation and Algorithmic Analysis
Find the solution to the recurrence relation with the initial conditions , and . Setup a recurrence relation for the sequence representing the number of moves needed to solve Tower of Hanoi puzzle.
Q8[2 Marks]Graph Theory and Tree
What do you mean by Euler circuit and Euler path? State the necessary and sufficient condition for Euler circuit and Euler path. What is the chromatic number of complete bipartite graph ?
Q9[4 Marks]Graph Theory and Tree
Prove the theorem which states that, "The number of vertices having odd degree in a connected graph is always even".
Q10[8 Marks]Graph Theory and Tree
Write short notes on: [2x3] (a) Cut sets and Cut vertices (b) Min cut max flow theorem

Curriculum Syllabus & Course Topics

Sourced from TU curriculum portal
Full Syllabus (PDF)
Chapter-wise Units & Micro-Syllabus Topics (5 Units)

  1. 1. Logic and Induction

    • 1.1Review of set theory, relation and function
    • 1.2Proposition, connectives in proposition, types of propositions, truth function and propositional logic
    • 1.3Expressing statements in logic propositional logic, rules of inference in propositional logic, validity of an argument, methods of tableaux
    • 1.4Predicate logic and quantification, informal deduction in predicate logic

  2. 2. Proof Techniques

    • 2.1Formal proofs and informal proofs, mathematical reasoning- direct proof and indirect proof (Proof by contradiction and proof by contraposition)
    • 2.2Elementary induction and complete induction, strong induction
    • 2.3Proof by counter example, vacuous and trivial proofs, proof by cases, mistakes in proof

  3. 3. Automata Theory, Regular Language and Grammar

    • 3.1Alphabet, string, string operations and language, introduction to finite automata
    • 3.2Deterministic finite automata (DFA), representation and language of DFA
    • 3.3Non deterministic finite automata (NFA), equivalence of DFA and NFA
    • 3.4Regular expressions and its characteristics, regular language and its properties
    • 3.5Equivalence of regular expression and finite automata
    • 3.6Context free grammar and context free language

  4. 4. Recurrence Relation and Algorithmic Analysis

    • 4.1Recurrence relations, recurrence relation for tower of Hanoi (TOH) and Fibonacci series, solving linear recurrence relations (Homogeneous and non-homogeneous)
    • 4.2Algorithm and its properties, asymptotic notation of algorithm
    • 4.3Linear and binary search and their analysis; Bubble and insertion sorting and their analysis

  5. 5. Graph Theory and Tree

    • 5.1Graphs basics, graph terminologies, graph types (Directed, un-directed, simple, weighted, regular, complete, bipartite, planar graph) and special graphs
    • 5.2Subgraphs, graph representation, connectivity in graphs and its components, strongly and weakly connected graphs
    • 5.3Paths and circuits, Euler path and circuit, Hamiltonian path and circuit
    • 5.4Shortest path algorithm (Dijkstra’s algorithm), graph coloring and four color theorem, applications of graph coloring.
    • 5.5Graph as network, maximal flows and minimal cuts, the max flow-min cut theorem
    • 5.6Introduction and applications, tree traversals, spanning trees, minimum spanning trees (Prim’s and Kruskal’s algorithm)

Examination Scheme & Marks Distribution

Evaluation Structure

  • Final Board Theory Exam: 60 Marks (Pass mark: 24)
  • Internal Assessment: 40 Marks (Pass mark: 16)
  • Practical / Lab Exam: 25 or 50 Marks (Continuous lab evaluation + viva, where applicable)

* This is the general current IOE 60/40 scheme; verify course-specific details in the syllabus above.

Exam Preparation Guidelines

  • Review the 2 available past examination papers to identify recurring patterns, core problem types, and chapter weightage.
  • Cross-reference key answers with official syllabus units, standard textbooks, and lecture notes.
  • Structure answers with labeled diagrams, concise bullet points, and highlight final answers in numerical solutions.
Authentic IOE Past Papers
Free Direct PDF Download
Curriculum Syllabus & Marking Scheme