Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    B.Tech (2010, Sem-4), Branch-CSE: Answer Any Two Questions 10 X 2 20

    Uploaded by

    sukla_satapathy
    This document contains exam questions for a fourth semester B.Tech student in computer science engineering. It includes short answer and long answer questions testing knowledge of planar graphs, logical fallacies, ring theory, partial order sets, lattices, binary trees, and Kruskal's algorithm for minimum spanning trees. Students have 1 hour to complete 10 short answer questions worth 2 marks each for a total of 20 marks, and 2 long answer questions worth 10 marks each for a total of 20 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    B.Tech (2010, Sem-4), Branch-CSE: Answer Any Two Questions 10 X 2 20

    Uploaded by

    sukla_satapathy
    13 views1 page
    This document contains exam questions for a fourth semester B.Tech student in computer science engineering. It includes short answer and long answer questions testing knowledge of planar graphs, logical fallacies, ring theory, partial order sets, lattices, binary trees, and Kruskal's algorithm for minimum spanning trees. Students have 1 hour to complete 10 short answer questions worth 2 marks each for a total of 20 marks, and 2 long answer questions worth 10 marks each for a total of 20 marks.

    Original Description:

    qus

    Original Title

    DM-ques2

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains exam questions for a fourth semester B.Tech student in computer science engineering. It includes short answer and long answer questions testing knowledge of planar graphs, logical fallacies, ring theory, partial order sets, lattices, binary trees, and Kruskal's algorithm for minimum spanning trees. Students have 1 hour to complete 10 short answer questions worth 2 marks each for a total of 20 marks, and 2 long answer questions worth 10 marks each for a total of 20 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    13 views1 page

    B.Tech (2010, Sem-4), Branch-CSE: Answer Any Two Questions 10 X 2 20

    Uploaded by

    sukla_satapathy
    This document contains exam questions for a fourth semester B.Tech student in computer science engineering. It includes short answer and long answer questions testing knowledge of planar graphs, logical fallacies, ring theory, partial order sets, lattices, binary trees, and Kruskal's algorithm for minimum spanning trees. Students have 1 hour to complete 10 short answer questions worth 2 marks each for a total of 20 marks, and 2 long answer questions worth 10 marks each for a total of 20 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 1

    B.

    Tech (2010, Sem-4th ), Branch-CSE


    Internal 3 Sub-DM GROUP A Answer all questions. 1. (i) Define planar graph and give the example? (ii) Define hypothetical and disjunctive syllogism ? (iii) What is ring with zero divisor ? Give example. (iv) Write the definition of ring ? (v) Define POSET. 2 X 5 = 10 Full Marks-30 TIME-1HR

    GROUP B

    Answer any two questions

    10 X 2 = 20

    2.What is lattice. give example of lattice with 10 nodes. 3.Define binary tree, complete binary tree and strictly binary tree with example. 4. Write kruskals algorithm to find minimum spanning tree .Explain with an example.

    ALL THE BEST

    You might also like