BSc IT Sem III 2012 2013 2013 LDMS Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
2013 - MOS
Semester-end · 2012 2013
→
Newer exam
2013 - Comp III 2102 13
Semester-end · 2012 2013
→
Questions asked in this paper
-
Q2 any 2: im Prove that (A, R) is a poset then prove that (A, R”) is also poset) MR, MS of R&
-
Q3 Use Warshall's Algorithm to compute the transitive closure. If
-
Q1 P.T. if function F Bis invertible is
-
Q2 a) P.T. B= + fa 4 marks
-
Q3 Find following
- v) State the pigeonhole principal with suitable examP
-
Q4 Solve any 2: Algebric structure & also find the value 2 given graph is an Isomorphic graph canned by CamScanner Circuit. graph circuit and path. Similarly Hamilton graph and ) Find the of minimal spanning Draw all possible spanning tree 10 marks
-
Q5 Solve any 2: and prove Addition principle 10 marks
- ii) Solve with the help of Truth table
- b) IfA, Cbe three set then prove that Solve with the help of Mathematical Induction
-
Q2 P.T. fle) if & (T monoid with identity e & e' if F: S T bean
-
Q3 Every Field is an integral domain and converse is not true also P.T. every cyclic
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Quick Help
No. The full paper opens straight away, with no login and nothing to pay.
Related Resources
Something wrong with this paper? Report it.
Connected Papers
BSc IT / Sem III · 76 papers
Mar 2019 - PYTHON PROGRAMMING
2017 - ATKT Applied Maths
2017 - ATKT Computer Networks
2017 - ATKT Database Management System
2015 - ATKT SQL
2015 - ATKT Computer Graphics
2015 - ATKT LDMS
2015 - ATKT MOS
2015 - ATKT Obj Ori Pro With C++
2015 - ATKT COMPUTER GRAPHICS
2015 - ATKT LDMS
2015 - ATKT MOS
2015 - ATKT SQL
2015 - ATKT Oops C++
2014 - ATKT MOS
2014 - ADD
2014 - LDMS ADD
2014 - MOS ADD
2014 - OOPS ADD 15 1
2014 - ATKT SP
2014 - SQL ADD
DATABASE MANAGEMENT SYSTEM
APPLIED MATHEMATICS
COMPUTER NETWORKS
DATA STRUCTURES
Questions? Email contact@munotes.in
Done!