Page 1 of 3
Birla Institute of Technology and Science, Pilani
TA C162 Computer Programming I
Comprehensive examination
PART B (CLOSED BOOK)
Date: 04-05-06
Time: 2 HOURS
Max Marks:
61
Attempt all parts in a sequence
writing complete program, including
the given partial code and the program structure:
Q1. The following skeleton program is intended to perform various operations defined on the set of
integers. Using the declarations and type definitions provide below, complete the implementation of the
following functions.
#include<stdio.h>
2+5+11+3+14+6+4+4+2=51M
#define SIZE 5
void scanList(int a[], int n)
{
}
void sort(int a[], int n)
{
}
/* The following function returns the size of modified list
*/
int removeAllDuplicates(int a[], int n)
{
int i=0,size,j,k;
size=n;
while(i<size)
{
}
return size;
}
/* A set contains an ordered list of distinct elements;
makeSet( )
takes a list of integers and constructs a set
*/
int makeSet(int a[], int n)
{
}
/* The
Union( )
finds the union of two sets
a, b
and stores it into the set U */
int Union(int a[],int aSize,int b[], int bSize,int U[])
{
This
preview
has intentionally blurred sections.
Sign up to view the full version.

This is the end of the preview.
Sign up
to
access the rest of the document.
- Spring '09
- SHANTA
- Computer Programming, 5m, Birla Institute of Technology and Science
-
Click to edit the document details