Exam Details
| Subject | applied algorithms | |
| Paper | ||
| Exam / Course | f.y. m.tech. (civil -structural engg.) | |
| Department | ||
| Organization | solapur university | |
| Position | ||
| Exam Date | 04, December, 2018 | |
| City, State | maharashtra, solapur |
Question Paper
F.Y. M.Tech. (Computer Science and Engineering) (Semester
(New CBCS) Examination, 2018
applied algorithms
Day and Date Tuesday, 4-12-2018 Total Marks 70
Time 10.00 a.m. to 1.00 p.m.
section i
1. Solve. 15
Determine the frequency count for all the statement in the following
algorithm.
for i 1 to n do
for j 1 to i do
For k to j do
x x
Explain amortized analysis.
2. Solve any one. 10
Given a graph and a source vertex A in graph, find shortest paths from A
to all vertices in the given graph using bellman ford algorithm.
Set P
Find minimum cost spanning tree for the following graph using Krukals
Algorithms.
3. Solve any one. 10
Explain matrix chain multiplication algorithm.
Explain reliability design.
section iI
4. Solve. 15
With the help of which algorithm it is possible to check whether segment
is intersected.
Explain cross product.
5. Solve any one. 10
Explain NP-completeness along with reducibility.
Prove "If any NP-complete problem is polynomial-time solvable, then
P NP. Equivalently, if any problem in NP is not polynomial solvable, then
no NP-complete problem is polynomial time solvable".
6. Solve any one. 10
Explain Euclid's algorithm.
Find all solution to the equation x ≡ 4 (mod and x ≡ 5 (mod 11).
(New CBCS) Examination, 2018
applied algorithms
Day and Date Tuesday, 4-12-2018 Total Marks 70
Time 10.00 a.m. to 1.00 p.m.
section i
1. Solve. 15
Determine the frequency count for all the statement in the following
algorithm.
for i 1 to n do
for j 1 to i do
For k to j do
x x
Explain amortized analysis.
2. Solve any one. 10
Given a graph and a source vertex A in graph, find shortest paths from A
to all vertices in the given graph using bellman ford algorithm.
Set P
Find minimum cost spanning tree for the following graph using Krukals
Algorithms.
3. Solve any one. 10
Explain matrix chain multiplication algorithm.
Explain reliability design.
section iI
4. Solve. 15
With the help of which algorithm it is possible to check whether segment
is intersected.
Explain cross product.
5. Solve any one. 10
Explain NP-completeness along with reducibility.
Prove "If any NP-complete problem is polynomial-time solvable, then
P NP. Equivalently, if any problem in NP is not polynomial solvable, then
no NP-complete problem is polynomial time solvable".
6. Solve any one. 10
Explain Euclid's algorithm.
Find all solution to the equation x ≡ 4 (mod and x ≡ 5 (mod 11).
Other Question Papers
Subjects
- advanced design of concrete structures
- advanced design of foundation
- advanced digital signal processing
- advanced network system
- advanced solid mechanics (new)
- advanced structural analysis
- advanced vibrations and acoustics
- antena design and applications
- applied algorithms
- computational techniques in design enginering
- computer aided design (elective – i)
- data mining
- digital design and verification
- elective – 1 : advanced embedded system
- elective – i : analog and digital cmos vlsi design
- elective – i : biomedical signal processing
- elective – i : computer vision
- elective – i : image and video procesing
- elective – i : mechanical system design
- elective – i : natural language procesing
- elective – i : neural networks and fuzzy control systems
- elective – i : soft computing
- elective – i : wireles sensor networks
- industrial instrumentation
- machine learning
- object oriented software enginering (elective – i)
- reliability enginering (elective – i)
- research methodology and ipr
- soft computing methods
- structural dynamics
- theory of computation (new)
- voice and data networks