Download Model question papers & previous years question papers

Posted Date: 09 Oct 2020      Posted By:: Shouvik Maj    Member Level: Silver  Points: 3 (₹ 2)

2019 B.Tech. Information Technology B.E Jadavpur University Information Technology - Graph Theory (3rd Year First Semester) -2019 Question paper



Course: B.Tech. Information Technology   University/board: Jadavpur University

Are you looking for the old question papers of Jadavpur University Information Technology - Graph Theory? Here is the previous year question paper from Jadavpur University. This is the original question paper from the IT Department for Third year first semester exam conducted by Jadavpur University in year 2019. Feel free to download the question paper from here and use it to prepare for your upcoming exams.



{Scroll Below to get the PDF Attachment file of the Original Question Paper}

Exam Name- B.Tech Information Technology Engineering Exam
3rd Year- 1st Semester

Subject- Graph Theory

Total Time- Three Hours
Maximum Marks- 100

Syllabus

Introduction: Different examples, (dis)connected graph, subgraph, isomorphism, labeled
graph, Euler graph, Hamiltonian graph.
Trees: definitions, center, radius, diameter, rooted tree; spanning tree, spanning forest,
rank & nullity of a graph, fundamental circuit, tree graph, number of spanning tree in
complete graph: Prufer sequence.
Operations on graph: deletion of vertex/edge, fusion, union, intersection, ring sum,
decomposition of a graph.
Connectivity/ cutest: definition of cutset, edge connectivity, vertex connectivity, cut
vertex, relation with edge connectivity and vertex connectivity, k-connected graph,
separable graph, 1-isomorphism, 2-connected graph, 2-isomorphism.
Planar graph: definition with examples, non-planar graph, Euler theorem, planarity
detection, geometric dual graph, uniqueness of dual, dual of a subgraph, combinatorial
dual, self dual, maximal planar graph.
Graph Coloring: definition, chromatic number, chromatic partition, independent set,
dominating set, chromatic polynomial.
Graph Matching: definition, complete matching. Covering: minimal covering, perfect
matching, vertex cover.
Graph representation: incidence matrix, adjacency matrix, – Submatrices – Circuit
Matrix – Path Matrix
Directed Graphs: Types of Directed Graphs, Digraphs and Binary Relations, Directed
Paths and Connectedness, Adjacency Matrix of a Digraph.
Basic counting rules: sum rule, subtraction principle, product rule, division principle,
permutations, r-permutation, combinatorics, sampling problem {with replacement}



Attachments:





Return to question paper search

Next Question Paper: B.E Jadavpur University Electronics and Telecommunication Engineering- Micrprocessors Microcontrollers (3rd Year First Semester) -2019

Previous Question Paper: B.Tech Jadavpur University Information Technology - Multimedia Coding Communication (3rd Year First Semester) -2019

Related Question Papers:


  • B.E Jadavpur University Electronics and Telecommunication Engineering- Digital Communication Systems (3rd Year First Semester) -2019


  • B.E Jadavpur University Electronics and Telecommunication Engineering- Control Engineering (3rd Year First Semester) -2019


  • B.E Jadavpur University Electronics and Telecommunication Engineering- Computer Organization and Architecture (3rd Year First Semester) -2019


  • B.E Jadavpur University Electronics and Telecommunication Engineering- ANTENNAS & PROPAGATION (3rd Year First Semester) -2019


  • B.E Jadavpur University Electrical Engineering - Programmable Logic & Microcontroller (3rd Year First Semester) -2019


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.


    Looking for University or College admissions in India for 2020 - 2021 Academic Year?

    APPLY NOW
    Top Contributors
    TodayLast 7 Daysmore...

    Awards & Gifts
     
    SpiderWorks Technologies Pvt Ltd, Kochi - India. © All Rights Reserved.