Go Back   2023 2024 Courses.Ind.In > Main Category > Main Forum > IGNOU MCA assignments solved 3rd sem

Thread: IGNOU MCA assignments solved 3rd sem Reply to Thread
Your Username: Click here to log in
Title:
  
Message:
Trackback:
Send Trackbacks to (Separate multiple URLs with spaces) :
Post Icons
You may choose an icon for your message from the following list:
 

Additional Options
Miscellaneous Options

Topic Review (Newest First)
October 20th, 2019 11:15 AM
K. S. Pandav
B. A. First year

Assignment solved 2019
January 30th, 2013 12:45 PM
Vishal Kotkar
Re: IGNOU MCA assignments solved 3rd sem

For your help here I am providing MCA 3rd sem assignments for IGNOU.

Question1: Using Insertion Sort, sort the following sequence in increasing order and do the analysis of the algorithm: 35, 37, 18, 15, 40, 12

Question 2: Write a pseudocode for divide and conquer algorithm for finding the position of an array of n numbers and estimate the
number of key comparisons made by your algorithm.

Question 3: Apply quicksort to sort the following list: Q U I C K S O R T in alphabetical order. Find the element whose position is
unchanged in the sorted list.

For the complete assignment click on the following attachment
January 29th, 2013 12:23 PM
Tasmiya
IGNOU MCA assignments solved 3rd sem

I am Studying in IGNOU in MCA 3rd sem I need to do my assailment if you have some assailments then please give me so I can easily do the assignments. If possible provide solved assignments.

Posting Rules
You may post new threads
You may post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off


All times are GMT +5.5. The time now is 04:21 PM.


Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2024, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.1
vBulletin Optimisation provided by vB Optimise (Lite) - vBulletin Mods & Addons Copyright © 2024 DragonByte Technologies Ltd.