B.Sc. (Computer Science) Sem 3 Discrete Mathematics 2015-16 Page 3 Question Paper - Mumbai University | munotes
Get access to whole semester resourcesSemester Pass
MU B.Sc. (Computer Science) student group
Free to join
Loading PDF...
Older exam
2015-16 - Scan 2
Semester-end · Discrete Mathematics
→
Newer exam
2015-16 - Page 2
Semester-end · Discrete Mathematics
→
Questions asked in this paper
4) State and prove v
the non-homogenous recurrence relation
Write a note on Binary operations on the graph
‘Use Shortest-Path algorithm a to find shortest path between the vertices of the following graph
Define th term Grammar. Write a note on the types of Grammar
Define a) Tuming Machine _b) finite state automata c) types of languages
Determine whether the relation R whose diagraph is given is reflexive,
the non-homogenous recurrence relation
Write a note on Binary operations on the graph
‘Use Shortest-Path algorithm a to find shortest path between the vertices of the following graph
Define th term Grammar. Write a note on the types of Grammar
Define a) Tuming Machine _b) finite state automata c) types of languages
Determine whether the relation R whose diagraph is given is reflexive,
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
B.Sc. (Computer Science) / Sem 3 · 75 papers
Questions? Email contact@munotes.in
Done!