Go Back   2021-2022 StudyChaCha > StudyChaCha Discussion Forum > General Topics

  #1  
Old August 10th, 2013, 01:52 PM
Super Moderator
 
Join Date: Jun 2013
Default

Will you please provide me solved assignment for the MCA 3rd semester of IGNOU ??

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).

Quote:
Originally Posted by Unregistered View Post
Will you please provide me solved assignment for the MCA 3rd semester of IGNOU ??
Attached Files Available for Download
File Type: zip IGNOU 3rd Sem Mca Assignments Solved.zip (465.1 KB, 804 views)

Last edited by Aakashd; May 22nd, 2019 at 02:36 PM.
Reply With Quote
Other Discussions related to this topic
Thread
IGNOU Solved Assignments
Solved Assignments Of IGNOU Mba
IGNOU Solved Assignments MCA 3rd SEM
IGNOU BCA solved assignments
IGNOU MBA Sem II Solved Assignments
Solved assignments of first year IGNOU B.ed
IGNOU Solved Assignments BDP
IGNOU MBA Solved Assignments
MBA Solved Assignments IGNOU
IGNOU BA Pstchology Solved Assignments
IGNOU MBA solved assignments Dec
IGNOU MCA Assignments Solved Papers
IGNOU b.ed solved assignments
IGNOU MBA Assignments Solved
CIC IGNOU solved assignments
Solved IGNOU Assignments MCA Sem2
IGNOU solved assignments december
Free IGNOU solved assignments July
IGNOU solved assignments BCA 5th sem
IGNOU 3rd SEM Solved Assignments BCA






  #2  
Old September 1st, 2014, 12:33 AM
Junior Member
 
Join Date: Aug 2014
Post Re: IGNOU 3rd Sem Mca Assignments Solved

Quote:
Originally Posted by Unregistered View Post
Will you please provide me solved assignment for the MCA 3rd semester of IGNOU ??

Please Visit ignouzone.page.me for ignou mca 3rd sem solved assignment 2014-2015...
Reply With Quote
  #3  
Old September 1st, 2014, 10:13 PM
Unregistered
Guest
 
Default Re: IGNOU 3rd Sem Mca Assignments Solved

Hi Sir,

Please send me 3rd sem MCA Solved assignments for 2010-15 Batch.

Regards,
Preeti Rathore.
Reply With Quote
  #4  
Old October 2nd, 2018, 02:37 PM
Unregistered
Guest
 
Default

Please provide me IGNOU 3rd sem mca solved assignmnt for 2018-2019...
Reply With Quote
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options



All times are GMT +6.5. The time now is 10:39 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8