Solved bca assignment

Saturday 9 March 2013

22:49 -

Define the following terms. i. Database ii. Database Management System iii. Data Model iv. Schema v. Data Independence

Database:

A collection of related information stored in a structured format. Database is often used interchangeably with the term table (Lotus Approach, for instance, uses the term database instead of table). Technically, they're different: A table is a single store of related information; a database can consist of one or more tables of information that are related in some way. For instance, you could track all the information about the students in a school in a students table. If you then created separate tables containing details about teachers, classes and classrooms, you could combine all four tables into a timetabling database. Such a multi-table database is called a relational database..

22:28 -

Fundamentals of Database Management

What are the Roles and Responsibilities of database administrator?

The Database Administrator (DBA) is the super-user of the system.

The role of the DBA is very important and is defined by the following functions.

Ø Defining the Schema

The DBA defines the schema which contains the structure of the data in the application. The DBA determines what data needs to be present in the system and how this data has to be represented and organized.

22:11 -

Computer Organization and Architecture

Describe the different number representations

Number Representations

Computers are built using logic circuits that operate on information represented by two valued electrical signals. We label the two values as 0 and 1; and we define the amount of information represented by such a signal as a bit of information, where bit stands for binary digit. The most natural way to represent a number in a computer system is by a string of bits, called a binary number. A text character can also be represented by a string of bits called a character code.

Friday 8 March 2013

05:21 -

Data Structures using C

Implement the following basic operations on a singly linked list: a) Insertion at the front b) Insertion at the rear c) Insertion at an arbitrary position in the list

/*Program of singly linked list*/

#include<stdio.h>

#include<malloc.h>

struct node /*linked list’s node structure*/

{

int info; /*for data*/

struct node *link; /*self referenced pointer*/

}*start;

/*function for insertion at the front end*/

insert_front(int data)

{

05:05 -

Data Structures using C

Implement the following basic operations on double ended queues: a) Insertion at the rear end b) Insertion at the front end

a) insertion at the rear end on a double ended queue

/*function to insert an item at the rear end on a double ended queue*/

void insert_rear(int item, int q[], int *r)

{

if (qfull(*r))/*check if queue is full*/

{

printf(“Queue Overflow\n”);

}

/*queue is not full*/

q[++(*r)]= item;

}

04:57 -

Data Structures using C

Write a program in C using integers to perform all stack operations.

Program that performs all stack operation using array of integers.

/*Program of stack using array*/

#include<stdio.h>

#define MAX 5

int top=1;

int stack_arr[MAX];

main()

Wednesday 6 March 2013

22:14 -

Data Structures using C

Write a function in C to sort a single dimensional array of 10 integers using Bubble Sort technique.

Function to arrange numbers in ascending order using bubble sort technique.

#include<stdio.h>

#define MAX 10

/*function for sorting using bubble sort*/

void bubble_sort(int a[];int n)