IGNOU BCA, MCA, Solved ASSIGNMENT, QUESTION PAPER

tag:blogger.com,1999:blog-227835312024-09-08T08:50:30.727-07:00IGNOU BCA, MCA, Solved ASSIGNMENT, QUESTION PAPERDear BCA/MCA Student of IGNOU<BR> Get Solved answers of previous (old) Question Papers/Assignment of IGNOU BCA/MCA. I will try to update the page regualarly and put one answer regularly. I will not guarantee you about correctenss of the answer. I am also a student and just sharing my answers with you.Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.comBlogger26125tag:blogger.com,1999:blog-22783531.post-64996075229574575062009-08-10T07:09:00.000-07:002009-08-10T07:19:47.054-07:00Send Free SMS and win iPod touch every month

Hello Friends, Just found a site from where you can send free SMS to any network in India. It is YouMint.com. And you can also win an iPod touch every month just by inviting your friends. Join nowhttp://www.youmint.com/network-yiam/

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-36641214119004563352007-11-30T22:06:00.000-08:002007-11-30T22:36:08.293-08:00BCA MCA Forum opened again

After getting huge spam attack at our BCA MCA forum, registration was disabled temporally. But now registration is opened again. If you face any problem at time of registration please post here.Also, I want to improve our forum, so requesting you to post your suggestion here: http://www.ignoubcamca.com/forum/viewtopic.php?p=247Thanks

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-59744142329965829642007-10-12T12:53:00.000-07:002007-10-12T12:58:01.225-07:00Online Examination Form: Last Date is extended till 15th October

Last Date for filling Online Examination Form is extended till 15th October,2007 without late fee.For instructions please visit IGNOUs official site: http://examform.ignou.ac.in/defaultnew.htm

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-50696865387457386552007-10-10T01:49:00.000-07:002007-10-10T02:14:04.363-07:00Sparse Matrix

MCA, CS-04 2001 (June)Q.1 (a). What is sparse matrix? Give example. [12]Ans. Matrices with a relatively high proportion of zero entries are called sparse matrices. Two general types of n-square sparse matrices which will occur in various applications are pictured in Figure.The first matrix, all entries above the main diagonal are zero or equivalent, where none-zero entries can only occur on or

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com2tag:blogger.com,1999:blog-22783531.post-38830337956394195852007-10-06T11:04:00.000-07:002007-10-06T11:11:53.112-07:00Admission Open for January 2008 Session

IGNOU has initiated admissions for various Academic Programmes Including BCA and MCA for the session January 2008. Students who are will to take admission in BCA/MCA or any other course, can obtained The Prospectus from all the regional Centres of IGNOU or from Registrar (SR&E), Maidan Garhi, New Delhi-110068, in person, on payment of Rs. 100/- in cash or through DD/IPO of Rs. 150/- drawn in

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-40305386881933517082007-07-25T12:22:00.000-07:002007-07-25T12:36:58.739-07:00BCA Question Paper of 2006

We are updating our site "IGNOU BCA MCA". We are in process of adding few more question papers. We are starting with adding BCA question papers of year 2006. More question paper will be added in future.We are also adding the IGNOU BCA questions in our BCA forum where you can post answers if you know and exchange your knowledge with others. We are requesting you all to share your knowledge and

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-75725679187751564892007-03-03T05:25:00.000-08:002007-03-03T05:36:17.368-08:00Kruskal Algorithm

CS62, December, 2001Question 4(b): Write Kruskal's Algorithm.Answer: Kruskal's Algorithm enables us to find a minimal spanning tree T of a connected weighted graph G where n vertices. (In which case T must have n-1 edge.Steps of Kruskal's Algorithm: The input is a connected weighted graph G wigh n vertices.Step 1: Arrange the edges of G in order of increasing weights.Step 2: Starting only with

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-91937378591895526252007-02-08T00:53:00.000-08:002007-02-08T00:56:13.644-08:00Adding two integers-CS 62December-1999

Q.1.(a) Write a routine in C for adding two integers represented by doubly linked lists.Answer: NODEPTR addint (NODPTR p, NODEPTR q){ /* check if integers are of like sign */ if(p->info * q ->info >0) return (addsame(p,q)); /* check which has a larger absolute value */ if(compabs(p,q)>0) return (addiff(p,q)); else return (addiff(q,p));}

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1167819970482493732007-01-03T02:18:00.000-08:002007-01-14T08:12:23.500-08:00Binary Search Tree [CS62 june 2001]

Queation: 1.(c) Define binary search tree. Write a function in C to creat a binary search tree.Answer: A binary search has porperty that all elements in the left subtree of a node n are less than the contents of n and alll elements in the sight subtree of n are greater than or equal to the contents of n.If a binary search tree is traversed in inorder (left, root, sight) and the contents of each

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1164434868500291232006-11-24T22:05:00.000-08:002007-01-14T08:17:57.993-08:00Difference- Singly and Doubly Linked Circullar List [CS62 june 2001]

Queastion: 2(b) List the difference between a Singly Linked Circular List and Doubly Linked Circular List. List the advantages of each list.Answer: In single linked circular list one cannot traverse a list backward, nor can a node be deleted from a circularly linked list, given only a pointer to that node. Whereas in double linked list each node in such a list contains two pointers, one to its

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1164011348831833372006-11-20T00:27:00.000-08:002007-01-14T08:19:55.256-08:00Binary Search Tree -CS62 june 2001

Queation: 1.(c): Define binary search tree. Write a function in C to creat a binary search tree.Answer: A binary search has porperty that all elements in the left subtree of a node n are less than the contents of n and alll elements in the sight subtree of n are greater than or equal to the contents of n.If a binary search tree is traversed in inorder (left, root, sight) and the contents of each

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1162396596018387252006-11-01T07:53:00.000-08:002007-01-14T08:22:42.762-08:00CS62 2001 December 4 (ii) algorithm to implement breadth first search

Question: Write an algorithm / Program to implement breadth first search and also describe the program/algorithm in terms of data structure and its functioning. [CS62, 2001 December, Question 4(ii) ]Answer: The algorithm to implement breadth first search is listed below:Step 1: Initialization of vertices by assigning the vaule 1 to dummy.Step 2: Place the beginning vertix in Z and set it to

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1162087900157137902006-10-28T19:11:00.000-07:002007-01-14T08:24:07.913-08:00CS62 Jan 2001 3a algorithm of iteractive version of pre-order traversal

Q. Write an algorithm of iteractive version of pre-order traversal.Ans: The recursive algorithm of preorder traversing is listed below:Preorder (Node)Step1: [Looop through step no. 3] if Node is not equal to NULL value Display Inforamtion [Node]Step2: Make a Call to Preorder(LeftChild [Node])Step3: Make a Call to Preorder(RightChild [Node])Step4:

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1154199282974196132006-07-29T11:40:00.000-07:002009-12-29T01:11:12.217-08:00IGNOU MCA Forum

Here is a new forum for IGOU MCA Students to discuss on July 2006 assignment (Old and New Syllabus).Discuss your assignments, questions, problem with hundreds on online students.

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com1tag:blogger.com,1999:blog-22783531.post-1151918023369536512006-07-03T02:07:00.000-07:002006-07-03T02:13:43.503-07:00Doing Business in India

This post is for those who wants the following information:Business in India, Business opportunities in India, Business schools in India, The Indian business culture.Doing Business in IndiaClick here for complete information on Doing Business in India

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1147933878788587332006-05-17T23:30:00.000-07:002007-01-14T08:30:33.709-08:00CS-62 JUNE 2003 QNO 6(a)

Q.Write a recursive algorithm to implement Quick Sort.Ans. The Quick Sort can be implemeted efficiently using recursion. The Base case may be when low is greater than or equal to high.The function/algo is as follows:quick(a, low, high)int a[], low, high{if (low>=high) return; partition (a, low, high, pos); quick(a.low, pos-1); quick(a.pos_1, high);}

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1147931047185287702006-05-17T22:36:00.000-07:002007-01-14T08:32:26.154-08:00New website for IGNOU BCA MCA student

New website for IGNOU BCA MCA student MCA-BCA-IGNOU

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1144495750062577682006-04-08T04:28:00.000-07:002007-01-14T08:35:55.804-08:00CS-62 JUNE 2003 QNO 3(c)

3 (c) What is an AVL tree? How does it differ from a Binary Tree?AnswerA Tree is called AVL tree (Balanced Binary tree) if each node possesses one of the following properties:(i) A node is called left heavy, if the longest path in its left subtree is one longer then the longest past of its right subtree.(ii) A node is called right heavy, if the longest part in the right subtree is one longer than

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1144495656072230222006-04-08T04:27:00.000-07:002007-01-14T08:34:40.184-08:00CS-62 JUNE 2003 QNO 3(a)

3(a) Write the postfix form of the following expresstion:(i) (C X D) ÷ (a-b)(ii) C X D ÷ a – bAnswer (i) :cd* ÷ (ab-)cd*ab-÷Answer (ii) :c*da÷- bcda÷*- bcda÷*b-

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1144495596866918562006-04-08T04:24:00.000-07:002007-01-14T08:36:33.689-08:00CS-62 JUNE 2003 QNO 3(a)

3(a) Write the postfix form of the following expresstion:(i) (C X D) ÷ (a-b)(ii) C X D ÷ a – bAnswer (i) : cd* ÷ (ab-)cd*ab-÷Answer (ii) : c*da÷- bcda÷*- bcda÷*b-

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1143443042092209132006-03-26T23:01:00.000-08:002007-01-14T08:37:49.111-08:00CS-62 JUNE 2003 QNO 2(c)

Question 2.(c) List atleast 4 differences between Arrays and Pointers in 'C' Language.Answer: (i) Array elemets are always stored in contiguous memory location irrespective of array size.(ii) There is necessary to assign the size in array, ut not in Pointers.(iii)Pointers are randomly location.(iv) The size of the data type which pointer variable refers to is dependent on the data type pointed to

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1143380187232054722006-03-26T05:35:00.000-08:002007-01-14T08:40:45.497-08:00CS-62 JUNE 2003 QNO 2(b)

Q.2. (b) Consider the tree in the following figure:Give the Postfix, Prefix and Infix expressions corresponding to the above tree.Answer:Infix expression = (a * b) x (c + d ) - ePrefix expression= *ab* + cd - e = *ab* -+ cdePostfix expression= (ab *) * (cd + ) -e =ab*cd + * .e -

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1142410391903621272006-03-15T00:08:00.000-08:002007-01-14T08:08:28.517-08:00CS-62 JUNE 2003 QNO 2(a)

QuestionDraw the internal memory representation of the following Binary Tree using Sequential Representation. Assume that nodes appear in the following physical sequence: A, B, C, D, E, G, F, HAnswer Index01234567891011ValueABCDEGFH

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1142409822390987502006-03-14T23:57:00.000-08:002007-01-14T08:06:15.022-08:00CS-62 JUNE 2003 QNO 1(c)

Question: Write a function that takes only a pointer to the root of a binary tree T and computes the number of nodes in T.Answer: When we traverse a binary tree then all the nodes of tree should traversed. Now if we put a pointer as a counter than it will print the total no of nodes. Any of the traversal schemes can be used to determine the number of elements in abinery tree. But we can use this

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0tag:blogger.com,1999:blog-22783531.post-1141120324731895732006-02-28T01:49:00.000-08:002007-01-14T08:00:04.945-08:00Solved Answer CS62 June 2003 Q.No. 1(a)

Question:Write a function to multiply two polynomials, using a linked list implementation. You must make sure that the output polynomial is sorted by exponent and has almost one term corresponding to any power. Assume appropriate representation for input polynomials.Answer:Void Multiply Polynimal (node*ptr, node*ptr2, node*ptr3){int powe coef;node*temp, *loc, *tt;while (ptr1!=(node*)NULL){temp=

Pankajhttp://www.blogger.com/profile/15919465910962263116noreply@blogger.com0