IGNOU BCA Sem-2 Assignment (CS-62: ‘C’ Programming & Data Structure)

CS-62: ‘C’ Programming & Data Structure

Assignment Code                  :           BCA (2)-62/Assignment/ 2009

Maximum Marks                 :           25

Last Date of Submission       :           30 th April, 2009/30th October, 2009



There are four questions in this assignment.  Answer all the questions


Q.1        What is a Data Structure? Explain its need?                                     (5 marks)


Q.2        Write a program in ‘C’ language for the multiplication of two matrices using pointers.                                                                                               (10 marks)


Q.3         What is a Directed Graph? Write an algorithm to find whether a Directed Graph is connected or not.                                                                              (5 marks)


Q.4         Explain the process of converting a Tree to a Binary Tree.

                                                                                                                        (5 marks)

Start Discussion!
* (Will not be published)
* (First time user can put any password, and use same password onwards)
Start a new topic: (If you have any question related to this post/category then you can start a new topic and people can participate by answering your question in a separate thread)
Title/Question: (55 Chars. Maximum)
Comment/Detailed description:* (No HTML / URL Allowed)

Characters left

Verification code:*

(If you cannot see the verification code, then refresh here)

CBSE Board, UP Board, IGNOU, JNU, MBA MCA, BBA and other educational boards of India

Disclaimer: For documents and information available on, we do not warrant or assume any legal liability or responsibility for the accuracy, completeness, or usefulness of any information. Papers, Results, Syllabus, Logo and other educational contents are owned by Indian Education Board and BoardGuess does not hold any copyright on it. The format of materials, being displayed on this website, comes under the copyright act., All Rights Reserved ©