BSc CS Sem 3 BSc CS Semester 3 (2015 2016) 2016 Comp I Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
2016 - Comp I
Semester-end · BSc CS Semester 3 (2015 2016)
→
Newer exam
2016 - Comp I
Semester-end · BSc CS Semester 3 (2015 2016)
→
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
BSc CS / Sem 3 · 72 papers
2017 - ATKT Combinatorics And Graph Theory
2017 - ATKT Database Management System
2017 - ATKT Operating System
2017 - ATKT Skill Enhancement Web Programming
2016 - ATKT COMPUTER III
2016 - ATKT COMPUTER II
2015 - ATKT Computer I
2014 - Comp I ADD
2014 - Comp II ADD 15 1
2014 - Comp III ADD
2014 - ATKT Comp III
2014 - ATKT Maths I
Questions? Email contact@munotes.in
Done!