# 1
| |||

| |||

IGNOU 3rd Sem Mca Assignments Solved |

# 2
| |||

| |||

Re: IGNOU 3rd Sem Mca Assignments Solved
Here I am giving you solved assignment for the MCA 3rd semester of IGNOU in a Zip file attached with it so you can get it easily .. Some content of Zip file given below : Question 3: Apply quicksort to sort the following list: Q U I C K S O R T (10 marks) in alphabetical order. Find the element whose position is unchanged in the sorted list. Solution : Quicksort is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare. Quicksort is often faster in practice than other O(n log n) algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only O(log n) additional space. Quicksort (also known as "partition-exchange sort") is a comparison sort and, in efficient implementations, is not a stable sort. Question 5: (i) Define DFS. Explain briefly how it differs from BFS. (10 marks) Solution : Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes Question 6: Apply Kruskal’s algorithm to find minimal spanning tree with an example. (10 marks) Solution: Kruskal's algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component). |

Sponsored Links |

# 3
| |||

| |||

Re: IGNOU 3rd Sem Mca Assignments Solved Quote:
Please Visit ignouzone.page.me for ignou mca 3rd sem solved assignment 2014-2015... |