BSc CS Sem 4 BSc CS Semester 4 (2020 2021) 2021 Fundamentals Of Algorithm Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
2021 - Sem4 CN
Semester-end · BSc CS Semester 4 (2020 2021)
→
Newer exam
2021 - Dotnet Technologies
Semester-end · BSc CS Semester 4 (2020 2021)
→
Questions asked in this paper
class:sycs sub: Fundamentals of algorithm sem:4
If all edges have the same
weight in an undirected
raph, which algorithm will
find the shortest path
between two nodes more DEPTH-First First
in which algorithm FIFO
list of n numbers to be
sorted in ascending
may be at their required
not in order. Best case worst case avg case base case
which can find t he shortest Bellman
path in a graph with Kruskal’s ford
list is used in Merge Sort Quick Sort Insertion Sort Quick Sort
example of approach search |Divide and conquer
we would like to sort a list
of n numbers in ascending
order and the list is given in
descending order It will lead
to------------------scenario for
the sorting algorithm
break the problem into
recursively, and then
combine these solutions to
create a solution to the divide and Quick
originalproblem Insertion sort |conquer merge sort sort divide and conquer
The time that depends on
the input: an already sorted
sequence that is easier to
The in-order traversal of
tree will yield a sorted
listing of elements of tree in binary search binary
The node which does not
have any child node is parent node
IN ----------- algorithm uses a
has come to mean
predicting the resources none of
14|that the algorithm requires |sorting analyzing running above analyzing
what is second |the two
of LCS sequences X
and Y do not |two sequences Suppose that the two sequences
end in the both end in the NONE OF |X and Y do not end in the same
what is first property of |the two
and Y do not |two sequences
end in the both end in the NONE OF |two sequences both end in the
It can be
Which of the following is either
false in the case of a It is tree that | It is a subgraph includes every |cyclic or
Which of the following is not
the algorithm to find the
18|the given graph? Kruskal’s Prim b ford Bellman ford
19}algorithm to find the path? |Bellman ford |Dijkstra’s b above both a an option b
follows Divide and none of
20|technique. conquer Greedy approach above Divide and conquer
Fractional knapsack is G Branch and Dynamic Greed
based on reedy Bound Programming an
What is the basic principle
To verify whether a function
grows faster or slower than
the other function, we have
some asymptotic or
mathematical notations, All of the
23|which is . Big Theta 8 Big Oh O above All of the above
To get To get minimum
maximum get minimum weight in
What is the objective of the |value in the total value inthe |weight in the the To get maximum total value in the
The main time taking step in|Breaking through
fractional knapsack problem into Adding items into sorted
If all edges have the same
weight in an undirected
raph, which algorithm will
find the shortest path
between two nodes more DEPTH-First First
in which algorithm FIFO
list of n numbers to be
sorted in ascending
may be at their required
not in order. Best case worst case avg case base case
which can find t he shortest Bellman
path in a graph with Kruskal’s ford
list is used in Merge Sort Quick Sort Insertion Sort Quick Sort
example of approach search |Divide and conquer
we would like to sort a list
of n numbers in ascending
order and the list is given in
descending order It will lead
to------------------scenario for
the sorting algorithm
break the problem into
recursively, and then
combine these solutions to
create a solution to the divide and Quick
originalproblem Insertion sort |conquer merge sort sort divide and conquer
The time that depends on
the input: an already sorted
sequence that is easier to
The in-order traversal of
tree will yield a sorted
listing of elements of tree in binary search binary
The node which does not
have any child node is parent node
IN ----------- algorithm uses a
has come to mean
predicting the resources none of
14|that the algorithm requires |sorting analyzing running above analyzing
what is second |the two
of LCS sequences X
and Y do not |two sequences Suppose that the two sequences
end in the both end in the NONE OF |X and Y do not end in the same
what is first property of |the two
and Y do not |two sequences
end in the both end in the NONE OF |two sequences both end in the
It can be
Which of the following is either
false in the case of a It is tree that | It is a subgraph includes every |cyclic or
Which of the following is not
the algorithm to find the
18|the given graph? Kruskal’s Prim b ford Bellman ford
19}algorithm to find the path? |Bellman ford |Dijkstra’s b above both a an option b
follows Divide and none of
20|technique. conquer Greedy approach above Divide and conquer
Fractional knapsack is G Branch and Dynamic Greed
based on reedy Bound Programming an
What is the basic principle
To verify whether a function
grows faster or slower than
the other function, we have
some asymptotic or
mathematical notations, All of the
23|which is . Big Theta 8 Big Oh O above All of the above
To get To get minimum
maximum get minimum weight in
What is the objective of the |value in the total value inthe |weight in the the To get maximum total value in the
The main time taking step in|Breaking through
fractional knapsack problem into Adding items into sorted
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 4 · 55 papers
2018 - ATKT Net Technology
2018 - ATKT Advanced Java
2018 - ATKT Linear Algebra Using Python
2018 - ATKT Skill Enhancement Android Development Fund
2018 - ATKT Software Engineering
2014 - Comp I ADD
2014 - ATKT Comp II
2014 - Comp III ADD
NET
NET TECHNOLOGIES
ADVANCED JAVA
ADVANCED JAVA
ADVANCED JAVA
ANDROID DEVELOPMENT FUNDAMENTALS
COMPUTER NETWORKS
FUNDAMENTALS OF ALGORITHM
SOFTWARE ENGINEERING
COMPUTER NETWORKS
FUNDAMENTALS OF ALGORITHM
Questions? Email contact@munotes.in
Done!