Showing posts with label II Semester. Show all posts
Showing posts with label II Semester. Show all posts

Feb 29, 2012

IGNOU BCA 2nd sem (Revised syllabus) MCS-015 Solved Assignment 2012

IGNOU BCA second semester (revised/new syllabus) students can download “Communication Skills” (MCS-015) solved assignment of 2012.



NOTE: To get better marks answer all the questions in your own words.



Course Code : MCS-015

Course Title : Communication Skills

Assignment Number : BCA(II)/015/Assign/2012

Maximum Marks : 100

Weightage : 25%

Last date of submission : 30th April, 2012




BCA 2nd Sem (Revise Syllabus) MCS-013 Solved Assignment 2012

 IGNOU BCA second semester (revised syllabus) students can now download “Discrete Mathematics” (MCS-013) solved assignment of 2012. This assignment is uploaded in PDF file format so that you can easily print it. You can also view this solved assignment online by clicking view online link below.


Course Code : MCS-013

Course Title : Discrete Mathematics

Assignment Number : BCA(II)/013/Assign/2012

Assignment Marks : 100

Weightage : 25%

Last Date of Submission : 30th April, 2012



BCA 2nd Sem(New Syllabus) MCS-012 Solved Assignments 2012

IGNOU BCA second semester (New or Revised syllabus) and IGNOU MCA first semester (new syllabus) students can now download “Organisation and Assembly Language Programming” (MCS-012) solved assignment of 2012. This assignment is uploaded in PDF file format so that you can easily print it.


Course Code: MCS-012

Course Title: Computer Organisation and Assembly Language Programming

Assignment Number: MCA (1)/012/Assign/2011

Maximum Marks: 100

Weightage: 25%

Last Dates for Submission:

  • 15th April, 2011 (For January Session)
  • 15th October, 2011 (For July Session)





Feb 28, 2012

Download IGNOU BCA Assignment 2012


Download All semester BCA Assignment Question 2012



BCA
I Semester         
(.PDF/.DOC)
II Semester
(.PDF/.DOC)
III Semester
(.PDF/.DOC)
IV Semester
(.PDF/.DOC)
V Semester
(.PDF/.DOC)
VI Semester
(.PDF/.DOC)
BCA Revised 2st Sem
CS-76 Project Guideline




Aug 17, 2011

CS-62: 'C' Programming & Data Structure June 2010




IGNOU BCA CS-62: 'C' PROGRAMMING & DATA STRUCTURE - JUNE 2010 QUESTION PAPER

BACHELOR IN COMPUTER APPLICATIONS

Term-End Examination

June, 2010CS-62: 'C' PROGRAMMING & DATA STRUCTURE


Time : 2 Hours


Max. Marks : 60



Note : Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' language.


1. (a) Write an algorithm to implement bubble sort, and sort the following list in descending order by using the algorithm.

15, 12, 4, 16, 9, 10, 94

What is the average run-time complexity of the bubble sort? [10]

(b) What do you mean by traversal of a tree? Explain the difference between preorder and post order with the help of illustrations. [10]



(c) Show how a polynomial can be represented using linked list. Write an algorithm to add two polynomials containing minimum of four terms. [10]



2. (a) Write an algorithm which accepts a stack as input and reverses the element of the stack using one additional queue. [6]

(b) Write at least two differences between a structure and a union in ‘C’ language. Give an example of each. [4]



3. (a) Find the minimum coast spanning tree of the following graph using PRIM’s algorithm. Graph Will Be Available Soon At WWW.MYIGNOUBCA.BLOGSPOT.COM [5]



(b) Explain indexed sequential file organisation. Name the data structure most appropriate for this file organisation. [5]



4. (a) Write an algorithm for implementation of Breadth First Search (BFS). [5]

(b) What is binary search tree? List its advantages. [5]



5. Given two sorted lists L1 and L2, write an algorithm to compute L1 U L2. [10]





CS-60 - Study Material

Download IGNOU CS-612 Study Materials Books

IGNOU CS-612 : PC Software and Application Skills Study Materials and Book. Download IGNOU CS-612 : PC Software and Application Skills study materials / books in .pdf file format. Please note that these books are password protected. Just enter this website URL i.e.myignoubca.blogspot.com as the password to unlock the books! Enjoy!!

This course has three blocks of books containing four, eight and four chapters respectively!


CS-612 : PC Software and Application Skills Study Materials and Books
Block-1 Problem Solving Techniques
  • Central Methods
  • The Higher Arithemetic -11
  • The Higher Arithemetic-2
  • Classical Problems and Puzzles
Block-2 Introduction to MS Excel
  • Automating Worksheet
  • Focus on Analysis
  • Database Power of Excel
  • Charts
  • Calculations in Worksheet
  • Formatting and Printing Worksheet
  • Introduction to EXCEL
Block-3 Internet Awareness
  • Visiting Web Sites
  • Browsers
  • Internet Tools: E-mail, FTP and Telnet
  • Internet: An Overview

Download

Download IGNOU CS-612 Study Materials Books

IGNOU CS-612 : PC Software and Application Skills Study Materials and Book. Download IGNOU CS-612 : PC Software and Application Skills study materials / books in .pdf file format. Please note that these books are password protected. Just enter this website URL i.e.myignoubca.blogspot.com as the password to unlock the books! Enjoy!!

This course has three blocks of books containing four, eight and four chapters respectively!


CS-612 : PC Software and Application Skills Study Materials and Books
Block-1 Problem Solving Techniques
  • Central Methods
  • The Higher Arithemetic -11
  • The Higher Arithemetic-2
  • Classical Problems and Puzzles
Block-2 Introduction to MS Excel
  • Automating Worksheet
  • Focus on Analysis
  • Database Power of Excel
  • Charts
  • Calculations in Worksheet
  • Formatting and Printing Worksheet
  • Introduction to EXCEL
Block-3 Internet Awareness
  • Visiting Web Sites
  • Browsers
  • Internet Tools: E-mail, FTP and Telnet
  • Internet: An Overview

Download

Jul 9, 2011

CS-60: Question Paper - June 2010


BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
June, 2010
CS-60: FOUNDATION COURSE IN
MATHEMATICS IN COMPUTING
Time : 3 hours                                                               Maximum Marks : 75
Note: Question No. 1 is compulsory. Attempt any three questions from questions No. 2 to 6. Use of calculator is permitted.
1.      
(a)      Show that the function f (x) = 3x —1 ;                                 15x3=45
Is one-one and onto.
(b)     Tell for each whether the statement is true or false :
                                                          (i)      R, the set of Real Numbers, is closed under addition operation.
                                                       (ii)      In R, the operation of multiplication is not commutative
                                                     (iii)      The relation '>' of 'greater than in R is transitive.
(c)      The function:
Is one-one
(d)      Find
(e)      Evaluate
(f)       Prove that the points  and  are the vertices of an isosceles triangle.
(g)      Find the equation of a straight line which passes through the  points
(h)     Find the equation of a straight line which meets x-axis in (5,0) and y-axis in (0,-3).
(i)        Find the equation of the parabola whose focus is the point (3,4) and directrix is the straight line 2x-3y+5=0.
(j)        Find the equation of a circle with radius 5 units and centre as (2, -3).
(k)     Find the coordinates of the vertices and the foci and the length of the latus rectum of the hyperbola.
(l)        Solve the system of simultaneous equations:
 
(m)    If
Find  
(n)     Evaluate
(o)     Obtain

in the form of
.

2.                  
(a)     Evaluate the integral                                                      3+4+3
(b)    Evaluate the integral
(c)     Find the area of the region bounded by the curve
 And lying above the x-axis.

3.                                                                                                                 4+3+3
(a)      Find the equation of the circle circumscribing the triangle with vertices
(b)      Find the equation of parabola with focus and directrix Find the equation of the axis.
(c)       Find the standard equation of the hyperbola with eccentricity

4.                                                                                                                4+3+3
(a)      Find the equation of the plane which is perpendicular to the plane and which is contains the line of intersection of the planes
(b)      Find the equation to the sphere through the circle

and the point
.
(c)       Find the equation to the cone whose vertex is origin and which passes through the curve given by


5.                                                                                                                3+3+4
(a)       Prove that .
(b)       Solve the equation
(c)       Expand in terms of the cosines of multiples of.

6.                                                                                                                4+3+3
(a)       Find the maxima and minima of the following faction
(b)      Find the equations of the tangents and the normal to the following faction
(c)       Trace the curve.



Jul 6, 2011

CS-62: 'C' Programming & Data Structure June 2011 Question Paper


BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
June, 2011
CS-62: 'C' PROGRAMMING & DATA STRUCTURE
Time : 2 Hours
Max. Marks : 60


Note : Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' language.

1. (a) What are Arrays? How are Two-dimensional arrays stored in memory? Write a program to multiply two 2-dimensional arrays.

(b) Write the algorithm for Binary search. Also apply this algorithm on the following data.
22, 44, 11, 88, 33, 55, 77, 66
Show all possible steps.

(c) Define the following terms using suitable examples.
(i) Degree of Tree
(ii) Height of Thee
(iii) Internal Node of a Tree
(iv) Strongly connected graph
(v) Adjacency Matrix

(d) Write an algorithm to convert any Infix expression to its corresponding Postfix notation. Using this algorithm convert the following expression to postfix:
(a + b) / (c – d)

2. (a) What is circular Linked List ? Write an algorithm to add a node at the end of a circular linked list.
(b) Write a program in ‘C’ to add a node to a queue.

3. (a). Define Inorder and Postorder traversals of a tree using suitable example. Construct a Binary tree using the following data.
INORDER: - BGDKHAEICJF
POSTORDER: - GKHDBEIJFCA

(b) ) What is a Heap? Define its types and properties using suitable examples.

4. (a) What is Heapsort? Apply heapsort on the given data.


Show the steps involved.

(b) Write a program in ‘C’ to count the number of Vowels present in a text file. Display the count of each vowel separately.

5. Write short notes on.
(a) Priority Queue
(b) Storage Pool
(c) Quick Sort
(d) Loops in ‘C’ programming
(e) BPS Algorithm