Ignou Bca Assignment 2009 For 2nd Semester

  • May 2020
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View Ignou Bca Assignment 2009 For 2nd Semester as PDF for free.

More details

  • Words: 628
  • Pages: 5
BACHELOR OF COMPUTER APPLICATIONS (BCA)

BCA/ASSIGN/II/YEAR/2009

ASSIGNMENTS Year, 2009 (2nd Semester)

CS-612

CS-60

CS-62

SCHOOL OF COMPUTER AND INFORMATION SCIENCES INDIRA GANDHI NATIONAL OPEN UNIVERSITY MAIDAN GARHI, NEW DELHI – 110 068

1

CONTENTS

Course Code

Assignment No.

Submission-Schedule For Jan-June Session

For July-Dec Session

30th April,2009

30th October,2009

Page No.

CS-612

BCA(2)-612/Assignment/09

CS-60

BCA(2)-60/Assignment/09

30th April,2009

30th October,2009

4

CS-62

BCA(2)-62/Assignment/09

30th April,2009

30th October,2009

5

2

3

Course Code Course Title Assignment Number Maximum Marks Last Date of submission

: : : : :

CS-612 PC Software and Application Skills BCA(2)-612/Assignment/2009 25 30th April, 2009/30th October, 2009

There are Five questions in this Assignment. Answer all the questions. Q.1

(i) Explain in detail all the options/items on the Menu bar and Tool bar of Internet Explorer. (3 Marks) (ii) What is Internet Firewall? Find Internet Firewall by browsing the Internet. List the browsed URLs and the information associated with them. (3 Marks)

Q.2

(a) Find the smallest number n, which has the following properties: i) Its decimal representation has 4 as the last digit; ii) It is divisible by 6 and 8. iii) It is a square number (3 Marks) (b) For any prime p >= 5, prove that p2+2 is composite.

Q.3

Q.4

(2 Marks) Explain with example how charts are used in analysis. Also explain the different types of charts available in Excel. (4 Marks) Create a work book in Excel which include following for an IGNOU BCA Study Centre: (i)

(ii) (iii) (iv)

Q.5

Records of personal information (name, age, address, sex, semester etc) of all the students in various semesters. A separate worksheet for each semester should be used. Student’s monthly attendance status semester wise, in a separate work sheet should be stored in ascending order on enrollment numbers. Students allocation trend in last five years in various semesters (I – VI). Proper chart should be used to reflect the trend graphically. Attendance record subject–wise at the end of semester should be stored for each course.

You can suggest the way how one component for keeping information of marks obtained by students in assignments of various courses can be incorporated in your work book. (6 Marks) Prepare appropriate Chart using Excel for representing ii, iii, and iv of Question 4 given above. (4 Marks)

3

Course Code Course Title

: :

Assignment Number Maximum Marks Last date of Submission

: : :

CS-60 Foundation Course in Mathematics in Computing BCA(2)-60/Assignment/2009 25 30th April, 2009/30th October, 2009

There are five questions in this assignment. Answer all the questions. Q. 1

Trace the following curves y = x/(1+x2)

(5 marks)

Q. 2

Obtain fifth roots of 4+3i

(5 marks)

Q. 3

Prove that ⏐4x−5y⏐≤ 4⏐x⏐+5⏐y⏐.

(5 marks)

Q. 4

If α, β, γ are the roots of the equation 5x3─8x2 + 7x + 6 = 0 Find the equation whose roots are α2 + β2 + βα , β2 + γ2 + γ β, γ2 + α2 + γα

Q. 5

Find the perimeter of the cord r = a (1+cos θ)

4

(5 marks) (5 marks)

Course Code Course Title Assignment Number Maximum Marks Last Date of Submission

: : : : :

CS-62 ‘C’ Programming & Data Structure BCA (2)-62/Assignment/ 2009 25 30th April, 2009/30th October, 2009

There are four questions in this assignment. Answer all the questions. You may use illustrations and diagrams to enhance your explanations.

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)

5

Related Documents