Mathematics Group Presentation and Members SYBCA-2

Mathematics Group with Members

Matrices :
076,079,099,100,107,110

Graph Theory :
063,066,072,088,090,101

Connectives :
069,071,074,081,104,108

Normal forms and Theory of Interference :
068,077,092,105,109,111

Relational and Ordering :
064,075,082,089,096,113

Posets and Lattices :
061,067,078,087,095,106

Boolean Algebra :
062,073,083,091,097,112

Learn CSS3 Transition Duration Effect with Example

Here I have uploaded html file, from which you can learn some CSS3 effects. Download this html file and run in your browser. Don't forget to check coding you will get better idea about coding if you understand it.

Download HTML File

I have use : -wekit-transition-duration. so open this file in Google Chrome, Otherwise change -webkit- to your browser

You can use :

-webkit-       for Goog;e Chrome & Safari Browsers

-moz-           for Mozila Firefox

-ms-             for Microsoft Internet Explorer

If you have any doubt just comment below...

Introduction about Linux in C Programming ( Linux Material )

Introduction to Linux:-

Linux is a Unix-like computer operating system assembled under the model of free and open source software development and distribution.

The defining component of Linux is the operating system kernel first released 5 October 1991 by Linus Torvalds^.

Linux was originally developed as a free operating system for Intel x86-based personal computers.

It is a leading operating system on servers and other big iron systems such as mainframe computers and supercomputers.

WAP to Illustrate use of Malloc Function

#include<stdio.h>
#include<conio.h>

void main()
{
int n,i,*p,
clrscr;

Download Flash & Dreamweaver PDF Files

Download

Macromedia Flash

Macromedia Dreamweaver

Database Management System (DBMS) 2011 Question Paper (BCA Sem-2)

Download below DBMS pages

Page 1

Page 2

Page 3

Page 4

Page 5

Page 6

Normalization Flow Chart

Normalization step by steps:-

1.       Check, If there are any comma separated value. If yes then create a row for single data.

2.       Check for primary key, It must exist.

3.       Check weather Primary key -> Composite key. If no, then table is already in 2^nd Normalization Form. Else draw dependency diagram and follow the process to convert table in 2NF. It removes partial dependency.

4.       Check if there exists any Transitive dependency. If no, Table already in 3NF.

WAP Structure with File Handling

#include<stdio.h>
#include<conio.h>
struct product
{
int c;
char name[20];
int qty,cost;
}p[100];

How to Draw House,Tree & Sun with C-Graphics

#include<graphics.h>
#include<conio.h>
void main()
{
int gd=DETECT ,gm;
int p[]={320,150,420,300,250,300,320,150};
initgraph(&gd,&gm,"C:\\TC\\BGI");
cleardevice();

Collect Sem-2 C-Programs

You total C-Program must up to 40

Download .rar File

Maths Presentation Schedule

1.       Limit & Differentiation                        over

2.       Derivative                                          30 March

3.       Application of Derivative                    2 April

4.       Integration                                         4 April

5.       Application of Integration                   6 April

6.       Differential Equations                         9 April

IMP DBMS Information

1.       Problem with File System.

2.       Advantages & Disadvantages of DBMS.

3.       Function of DBMS.

4.       Relationship Types

5.       Hierarchical & Network Model

6.       Degree Data Abstract

7.       All kinds of Keys.

8.       Entity Rules

9.       Relation Set Operator

10.   Data Dictionary & Indexes

11.   ERModel & Normalization

12.   Cardinality, Weak Entity

o   DBMS                    -Database Management System

o   DBTG                     -Database Task Group

Download C- Graphics Material Files

Download File 2

Download File 1

Download Account Theory File .ppt

Download File

Download Sem-2 Lecture Time-Table .EXE

Download Application

Assignment 4 (DBMS)

1.       What is weak entity? How you know that a particular entity is a weak entity explain with example.

2.       When do we call that two entities have a strong relationship?

3.       Explain domain of any attributes.

4.       Write a very short note on existence dependence.

5.       Explain relationship participation in detail.

6.       What is relationship degree ?Explain all kind of relationship degree why entity relationship is called recursive?

7.       Explain associative entities.

Weak Entity and Strong Entities in DBMS

An entity set that does not possess sufficient attributes to form a primary key is called a weak entity set. One that does have a primary key is called a strong entity set.

 For example,
The entity set transaction has attributes transaction-number, date and amount.
Different transactions on different accounts could share the same number.
These are not sufficient to form a primary key (uniquely identify a transaction).

List of C programs to be written in File (2nd Sem)

Dear Students,

Here is a list of programs which you are supposed to write in your file.
I am not specifying all the programs which we have done in the lab, but only some of the basic programs. Make sure that you have at least recorded all of them in your files.

Structures in C :

1. To display mark sheet of one student, where student is defined as structure as per its attributes.
2. To display mark sheet of such n students, as per previous program.
3. Create a structure bank and perform following functions :
   

Download all C- Programs (sem-2)

Hello, Friends we have got all the C Programs which we have done in C Lab. If you want any program then download given below file, Its contains all the programs.

Download .rar File

Download C Materials for Semester 2

Image file 1

Image file 2

Image file 3

Image file 4

Image file 5