# Tag Archives: 2015-16

## Write an Algorithm and a Program that accepts a Binary Tree as input and checks whether it is a Height Balanced Tree – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-033 Course Title : Data and File Structures Lab Assignment Number : BCA(III)/L-033/Assignment/2015 Maximum Marks : 50 Weightage : 25% Write an Algorithm and a Program that accepts a Binary Tree as input and checks whether it is a Height Balanced Tree. #include <stdio.h> #include <stdlib.h> struct tnode… Read More »

## Write a program to do linear search for an integer in 20 distinct numbers. The program should return the location of an element – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-045 Course Title : Introduction to Algorithm Design Lab Assignment Number : BCA(IV)/L-045/Assignment/2015 Maximum Marks : 50 Weightage : 25% Write a program to do linear search for an integer number in an array of 20 distinct numbers. The program should return the location of an element if… Read More »

## Write a program to sort data using a selection sort algorithm – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-045 Course Title : Introduction to Algorithm Design Lab Assignment Number : BCA(IV)/L-045/Assignment/2015 Maximum Marks : 50 Weightage : 25% Write a program to sort data using a selection sort algorithm. #include<stdio.h> void main() { int MIN,MIN_POS,I,J,TEMP,List[]={6,3,0,4,8,2,5,9,1,7}; int N=10; clrscr(); printf(“\n****SELECTION SORT****\n”); printf(“\n\nList Before Sorting :\n\n”); for(J=0;J<N;J++) {… Read More »

## Implement merge sort algorithm – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-045 Course Title : Introduction to Algorithm Design Lab Assignment Number : BCA(IV)/L-045/Assignment/2015 Maximum Marks : 50 Weightage : 25% Implement merge sort algorithm.   #include<stdio.h> int numbers[10]={2,8,4,1,0,7,9,3,5,6}; int temp[10],array_size=10; void mergeSort(int numbers[],int temp[],int array_size); void m_sort(int numbers[],int temp[],int left,int right); void merge(int numbers[],int temp[],int left,int mid,int right);… Read More »

## Write a program that finds the two smallest numbers in an array of n numbers – IGNOU BCA Assignment 2015 – 16

BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-045 Course Title : Introduction to Algorithm Design Lab Assignment Number : BCA(IV)/L-045/Assignment/2015 Maximum Marks : 50 Weightage : 25% Write a program that finds the two smallest numbers in an array of n numbers. #include<stdio.h> void main() { int I,J,Temp,List[]={6,3,0,4,8,2,5,9,1,7}; clrscr(); printf(“\nElement in Array :\n\n”); for(J=0;J<10;J++) {… Read More »

## Write a program in C language that will accept a Graph as input and will generate its Minimum Cost Spanning Tree – IGNOU MCA Assignment 2015 – 16

MASTER OF COMPUTER APPLICATIONS Course Code : MCSL-025 Course Title : Lab Course Assignment Number : MCA(II)/L-025/Assignment/15-16 Maximum Marks : 50 Weightage : 25%   Write a program in C language that will accept a Graph as input and will generate its Minimum Cost Spanning Tree. #include <stdio.h> #define MAXVERTICES 10 #define MAXEDGES 20 typedef… Read More »

## Write a program in C language for addition of two numbers which have at least 20 digits each – IGNOU MCA Assignment 2015 – 16

MASTER OF COMPUTER APPLICATIONS Course Code : MCSL-025 Course Title : Lab Course Assignment Number : MCA(II)/L-025/Assignment/15-16 Maximum Marks : 50 Weightage : 25% Write a program in C language for addition of two numbers which have at least 20 digits each.   #include<stdio.h> void main() { int I,J,NUM1[20],NUM2[20],RES[21]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; char N1[21],N2[21];/*getchar is excepts NewLIne charter… Read More »

## Write an algorithm for the implementation of a multiple queues in a single dimensional array – IGNOU MCA Assignment 2015 – 16

MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(II)/021/Assignment/15-16 Maximum Marks : 100 Weightage : 25% Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them .   #include <stdio.h> #define MAX 20 void insert_que1(int *,int *,int *,int); void insert_que2(int… Read More »

## Write an algorithm for the implementation of a Dequeue – IGNOU MCA Assignment 2015 – 16

MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(II)/021/Assignment/15-16 Maximum Marks : 100 Weightage : 25% Write an algorithm for the implementation of a Dequeue .   #include <stdio.h> #define max 10 int top1, top2, stk_arr[max]; void push(); void pop(); void display(); void main() { int… Read More »

## Answer the following queries in SQL – IGNOU MCA Assignment 2015 – 16

MASTER OF COMPUTER APPLICATIONS Course Code : MCS-023 Course Title : Introduction to Database Management Systems Assignment Number : MCA(II)/023/Assignment/15-16 Maximum Marks : 100 Weightage : 25%   Consider the following EMP table: ENAME DEPT-NAME DESIGNATION SALARY DATE-OF-JOIN KARAN ACCOUNTING DIRECTOR 50000 Nov 17, 2012 FARAH RESEARCH ANALYST 30000 Dec 03, 1991 SCINDIA RESEARCH ANALYST… Read More »