BCA

Circular Doubly linked list

2011-03-25T23:20:00.002+05:30

/*Program on circular doubly linked list without any header node.*/

#include<stdio.h>
#include<stdlib.h>
struct list
{
int num;
struct list *next;
struct list *prev;
};

struct list *node;
void create(struct list *n)
{
char ch;
node=n;
printf("\nWant to create location(y/n):-");
scanf("%c",&ch);
fflush(stdin);
while(ch!='n')
{
fflush(stdin);
node->next=(struct list *)malloc(sizeof(struct list));
node->next->prev=node;
node=node->next;
printf("\Enter value:-");
scanf("%d",&node->num);
fflush(stdin);
printf("\Any more (y/n)");
scanf("%c",&ch);
}

node->next=n;
n->prev=node;
}

void display(struct list *n)
{
node=n->next;
while(node!=n)
{
printf("%d\n",node->num);
node=node->next;
}
}

void main()
{
struct list *start=NULL;
clrscr();
create(start);
printf("Now display the value of the circular lists:-\n");
display(start);
getch();
}

Circular Doubly linked list

2011-03-25T23:19:00.000+05:30

/* Another program on circular doubly linked list with header node*/

/*In this program insertion of new created node at any location
of the circular doubly linked list can be done.*/

#include<stdio.h>
#include<stdlib.h>
struct list
{
int num;
struct list *next;
struct list *prev;
};
struct list *node;

void create(struct list *n)
{
char ch;
node=n;
printf("\nWant to create location(y/n):-");
scanf("%c",&ch);
fflush(stdin);
while(ch!='n')
{
fflush(stdin);
node->next=(struct list *)malloc(sizeof(struct list));
node->next->prev=node;
node=node->next;
printf("\Enter value:-");
scanf("%d",&node->num);
fflush(stdin);
printf("\Any more (y/n)");
scanf("%c",&ch);
}

node->next=n;
n->prev=node;
}

void display(struct list *n)
{
node=n->next;
while(node!=n)
{
printf("%d\n",node->num);
node=node->next;
}
}

void insert(struct list *n)
{
struct list *node,*new1;
int c=1,count;
node=n;
new1=(struct list*)malloc(sizeof(struct list));
printf("\nEnter the location where the new location will be inserted:");
scanf("%d",&count);
printf("\Enter value:-");
scanf("%d",&new1->num);
do
{
if(c==count)
break;
node=node->next;
c++;
}while(node!=n);

new1->next=node->next;
node->next->prev=new1;
node->next=new1;
new1->prev=node;
}

void main()
{
struct list *start;
clrscr();
start=(struct list*)malloc(sizeof(struct list));

/* header node without any value */

create(start);
printf("Now display the value of the circular lists:-\n");
display(start);
insert(start);
printf("\nAfter insertion, the list is\n");
display(start);
getch();
}

CS-60 Previous Year Question Paper

2011-03-21T10:27:00.000+05:30

CS-60 Previous Year Question Paper

Download complete 5 years question of CS60 paper here..... Click to download

Some Motivational Books

2011-03-21T03:33:00.000+05:30

1.	The Secret	Download
2.	Secrets-Of-The-Millionaire	Download
3.	The Law of Attraction	Download
4.	As A Man Thinketh - James Allen	Download

fee structure for bca

2011-03-21T00:42:00.001+05:30

FEES Rs. 6800 /- per annum + Rs.600 /- for MTE-03 + Rs. 3 ,000 /- for CIC for non-Maths Students

Admission fee : Rs.4800/-

Per semester fee: Rs.4300/-

Per exam fee: Rs.60 per paper and practical

ELIGIBILITY FOR ADMISSION TO BCA

2011-03-21T00:37:00.001+05:30

10+2 or its equivalent with Maths as a distinct subject
OR 10+2 or its equivalent without Mathematics as a distinct subject.
This category of students will have to register for MTE-03 and CIC in 1 st Semester of BCA and successfully complete before registering for the 3 rd Semester of the BCA Programme. OR 10+2 vocational stream in Computer Techniques/ Applications, or its equivalent, without Maths as a distinct subject. This category students will have to register for MTE-03 in the 1 st semester of BCA and successfully complete before registering 3 rd Semester of BCA.
Min age as on 1 st Jan. of the Academic Year - No Bar COURSE DETAILS Duration (Min) - 3 years
Duration (Max) - 6 years Medium of Instruction - English ADMISSION DETAILS Admission notification is generally released in May/ June and the last date for submission of filled-in application forms will be September 30 for January session and March 31 for July session. However students are requested to check with the official admission notification for the exact dates related to
admission

syllabus for bca ignou

2011-03-21T00:33:00.001+05:30

SYLLABUS

Ist Semester

CS-610 Foundation Course in English for Computing
FHS-01 Foundation Course in Humanities and Social Science
CS-611 Computer Fundamentals And PC Software

IInd Semester

CS-612 P.C. Software Application skills
CS-60 Foundation Course in Mathematics in Computing
CS-62 'C' Programming & Data Structure

IIIrd Semester
FST Foundation Course in Science & Technology
CS-63 Introduction to System Software
CS-05 Elements of System Analysis and Design

IVth Semester

CS-06 Introduction of DBMS
CS-64 Introduction to Computer Organisation
CS-65 Window Programming
CS-66 Multimedia
CS-67 RDBMS Lab

Vth Semester

CS-68 Computer Network
CS-69 TCP/IP Programming
CS-70 Introduction to Software Engineering
CS-71 Computer-Oriented Numerical Techniques

VIth Semester

CS-72 C++ and Object Oriented Programming
CS-73 Theory of Computer Science
CS-74 Introduction to Internet Programming (JAVA, ACTIVE x)
CS-75 Intranet Administration
CS-76 Project

how to get admission to ignou bca

2011-03-21T00:25:00.001+05:30

HOW TO APPLY
Student Handbook & Prospectus would be available from the
Registrar (SR&E),
IGNOU, Maidan Garhi,
New Delhi- 110 068
and at all Regional Centres, Study Centres, and IGNOUARMY, NAVY, AIR FORCE AND ASSAM RIFLES Recognised Regional Centres.
Prospectus can be download from
http://ignou.ac.in

Student Handbook and Prospectus is also available on university’s website www.ignou.ac.in candidates downloading the Form from website are required to send a Demand Draft of Rs. 550 /- ( Rupees five hundred fifty only) drawn in favour of IGNOU payable at New Delhi . Advertisements inviting applications for MP are released in leading national and local dailies in April and October.

BCA at IGNOU

2011-03-21T00:17:00.001+05:30

best university in the world. Ignou is affiliated by AICTE, ministry of information technology, ugc.

There is two session :-
1. January
2. July
you can apply for the admission all over year and your admission will granted to next session from date of submission of admission form automatically.

Ignou study cente - Marwari College, Bhagalpur