GTU · BE Computer · Semester 4
GTU 3140708 Discrete Mathematics (DM) Old Question Papers & Solutions PDF
Official Gujarat Technological University (GTU) old question papers PDF (Regular & Remedial) and step-by-step solved questions for Discrete Mathematics (DM) across 2023 – 2026 examinations.
23 questions GTU asked more than onceAsked in 4 of 5 papers: Define the relation divisibility on the set D12. where D12 is the set of all positive divsors of 12.(i) show that it is an partial orderd relationSee listExam papers
Most repeated questions
23 questions GTU set in two or more of 5 papers, most repeated first. Tap a year to open that paper at the question.
Define the relation divisibility on the set D12. where D12 is the set of all positive divsors of 12.(i) show that it is an partial orderd relation
Summer 2026 Q2c Winter 2025 Q3c Winter 2025 Q4a OR Winter 2024 Q4c OR Summer 2024 Q4b
Solve the following recurrence relation
Winter 2025 Q3c OR Winter 2024 Q4b OR Summer 2024 Q4b OR Winter 2023 Q4c OR
Use warshall's algorithm to find the path between each pair of vertices for given directed graph
Summer 2026 Q3c OR Winter 2024 Q5c OR Summer 2024 Q5c Winter 2023 Q5b OR
Check whether the proposition ((pνq)Λ∼p)→q is contradiction, tautology or contingency.
Winter 2025 Q3a Winter 2025 Q3b Winter 2024 Q2b Summer 2024 Q2a Winter 2023 Q2a
Use a truth table to determine whether the following argument form is valid. 𝑝 → 𝑞 𝑞 → 𝑟 ∴ 𝑝 → 𝑟
Define the isomorphic graphs. Show that following two graphs are isomorphic with defined one-one correspondence between vertices.
Define cycle in a graph. For the given tree find the pre order post order and in order traversal.
For the relation R = {(1,
(
Show that the function from R to R defined by f(x)=4x+8 is one-one and onto. Also, find the inverse.
Show 13 more repeated questionsHide the 13 more
Solve the recurrence relation:
Show that R = {a+b√2; a, b ∈ I} is an integral domain but not a field under the binary operations + (usual addition) and . (usual multiplication).
Show that the set Z5={[0],[1],[2],[3],[4]} is the field under the operation addition modulo 5 and multiplication modulo 5.
Consider the ring ℤ30 = {0, 1, 2, … ,29} of integers modulo 30. (a) Find −8 and −17. (b) Find 11⁻¹, 13⁻¹ and 14−1. (c) Let 𝑓 (𝑥) = 2 𝑥 + 4. Find the roots of 𝑓(𝑥) over ℤ30.
Suppose that 100 mathematics students at a college taking at least one of the languages French, German, and Russian, given the following data: 65 study French, 45 study German, 42 study Russian, 20 study French and German, 25 study French and Russian, 15 study German and Russian.
Find reachable set of each node of the given digraph.
Show that (Z,+) is an commutative group.
Show that the set {-i,i,1,-1} is the abelian group with usual multiplication. Also, show that it is cyclic group.
Let (Z,+) be a group. Consider the set H= {5n: n is an integer}. show that H is subgroup of Z. Find the all cosets of H in Z.
Out of the integers 1 to 1000. How many of them are neither divisible by 3, nor by 5 nor by 7?
A tree 𝑇 has 4 vertices of degree 2, 3 vertices of degree 3, 1 vertex of degree 4. Find the number of pendant vertices in the tree 𝑇.
Define homomorphism. Let 𝐺 be the group of real numbers under addition, and let 𝐺′ be the group of positive real numbers under multiplication. Check whether the mapping 𝑓 ∶ 𝐺 → 𝐺′ defined by 𝑓(𝑎) = 2𝑎 is a homomorphism.
Let 𝐴 = {1, 2, 3, 4} and the relation 𝑅 = {(1,
Which branches take this subject
GTU's syllabus lists 3140708 for 4 branches. One set of papers serves all of them.
Semester 4: 4 branches
Computer Engineering, Computer Science & Engineering, Information & Communication Technology, Information Technology
Other Semester 4 subjects
Common questions
Are these GTU 3140708 Discrete Mathematics papers valid for both Regular and Remedial exams?
Yes. Gujarat Technological University (GTU) follows the same 70-mark syllabus, exam blueprint, and 23-mark passing cutoff for both Regular and Remedial (ATKT/backlog) examinations. All 5 past exam sessions (2023 – 2026) serve as comprehensive preparation for either attempt.
How can I download GTU 3140708 Discrete Mathematics old question papers PDF?
You can download official GTU 3140708 original question paper PDFs directly from the table above with 1 click and zero deceptive ads or wait timers. Every paper also includes interactive online questions with AI study prompts.
What is the passing mark for GTU Discrete Mathematics (3140708)?
The external theory exam carries 70 marks. The minimum passing cutoff is 23 marks (33%). Exam duration is 2.5 hours.
What is the GTU exam pattern for 3140708?
The examination contains 5 main questions of 14 marks each, totaling 70 marks. Questions 2 through 5 provide internal OR choices, typically split into 3-mark, 4-mark, and 7-mark questions.