IGNOU BCA, MCA, Solved ASSIGNMENT, QUESTION PAPER

Send Free SMS and win iPod touch every month

2009-08-10T07:09:00.000-07:00

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/

BCA MCA Forum opened again

2007-11-30T22:06:00.000-08:00

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

Online Examination Form: Last Date is extended till 15th October

2007-10-12T12:53:00.000-07:00

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

Sparse Matrix

2007-10-10T01:49:00.000-07:00

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

Admission Open for January 2008 Session

2007-10-06T11:04:00.000-07:00

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

BCA Question Paper of 2006

2007-07-25T12:22:00.000-07:00

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

Kruskal Algorithm

2007-03-03T05:25:00.000-08:00

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

Adding two integers-CS 62December-1999

2007-02-08T00:53:00.000-08:00

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));}

Binary Search Tree [CS62 june 2001]

2007-01-03T02:18:00.000-08:00

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

Difference- Singly and Doubly Linked Circullar List [CS62 june 2001]

2006-11-24T22:05:00.000-08:00

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

Binary Search Tree -CS62 june 2001

2006-11-20T00:27:00.000-08:00

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

CS62 2001 December 4 (ii) algorithm to implement breadth first search

2006-11-01T07:53:00.000-08:00

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

CS62 Jan 2001 3a algorithm of iteractive version of pre-order traversal

2006-10-28T19:11:00.000-07:00

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:

IGNOU MCA Forum

2006-07-29T11:40:00.000-07:00

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.

Doing Business in India

2006-07-03T02:07:00.000-07:00

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

CS-62 JUNE 2003 QNO 6(a)

2006-05-17T23:30:00.000-07:00

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);}

New website for IGNOU BCA MCA student

2006-05-17T22:36:00.000-07:00

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

CS-62 JUNE 2003 QNO 3(c)

2006-04-08T04:28:00.000-07:00

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

CS-62 JUNE 2003 QNO 3(a)

2006-04-08T04:27:00.000-07:00

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-

CS-62 JUNE 2003 QNO 3(a)

2006-04-08T04:24:00.000-07:00

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-

CS-62 JUNE 2003 QNO 2(c)

2006-03-26T23:01:00.000-08:00

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

CS-62 JUNE 2003 QNO 2(b)

2006-03-26T05:35:00.000-08:00

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 -

CS-62 JUNE 2003 QNO 2(a)

2006-03-15T00:08:00.000-08:00

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

CS-62 JUNE 2003 QNO 1(c)

2006-03-14T23:57:00.000-08:00

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

Solved Answer CS62 June 2003 Q.No. 1(a)

2006-02-28T01:49:00.000-08:00

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=