C Program for generating Fibonacci Series

Fibonacci series is a series of integer numbers where the first two numbers in the series are 1 and 1, or 0 and 1, depending on the chosen starting point of the series, and each subsequent number is the sum of the previous two numbers  ie. Fn = Fn-1  +  Fn-2.


For example:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ….

Or

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ….

How to create a class in Java?

This example shows how to define and use a class in Java. Let us consider a rectangle class which has two properties and four methods.

Samsung has launched its new Phablet Galexy Note 4

Samsung has introduced its new Phablet Galexy Note 4 in a Consumer Electronics Fare, I. F. A, in Berlin, Germany. It comes with Quad HD Display -  2560 x 1440 resolution -  with AMOLED  screen. The newborn gadget is designed to compete with  Apple iPhone 6.

SanDisk Premieres World’s Highest Capacity SD Card for High Performance Video and Photo Capture

SanDisk in a press release announces the launch of the world’s highest capacity SD card (SanDisk Extreme PRO SDXC UHS-I memory card) for the video and photographic professionals.

 SanDisk Extreme Pro UHS-I SDHC/SDXC memory cards are available in various capacities like 128GB, 256GB, and 512GB worldwide. The company announced that the 512GB Extreme Pro SDXC UHS-I card will be available at $799.99 (Rs. 48,000 approximately).

C program to check if a given matrix is a sparse matrix or not

A sparse matrix is a matrix in which most of the elements are zero.

For example let us consider two matrices  A and B

Matrix A
1 0 0
1 1 0
0 1 0

Matrix B
1 1 1
0 1 0
1 0 1

Java Program to implement stack using array

A stack is a data structure which is a  logical representation of  a real physical stack or pile of objects, where insertion and deletion of items takes place at one end called top of the stack. The basic concept can be illustrated by thinking of the data set as a stack of plates or books where you can only take the top item off the stack in order to remove things from it. In a stack last added item is deleted first and so it is called a LIFO (Last In First Out) data structure.

C Program to implement a Queue using array

Queue 

 A queue is a a linear collection of objects, where objects are inserted and removed according to the first-in first-out (FIFO) principle. An example of a queue is a line of people in a ticket counter. New additions to the line is made to the back of the queue, while removal (or serving) happens in the front. In a queue only two operations are allowed enqueue/insert and dequeue/delete. Enqueue means to insert an item into the back of the queue, dequeue means deleting the front item. 

How to upload a file using PHP script

In this article let us discuss how to upload a file to a web server using PHP script. It is implemented as a function in this example in upload.php file. To upload a file, you have to create an HTML form with a file input control by using the input tag like this: "<input type=file>". 

While creating the HTML form, enctype attribute of the form should have the value "multipart/form-data". So the form tag will be like this:

<form action="upload.php" method="post"  enctype="multipart/form-data">

HTML code to crate the form

<form action="upload.php" method="post" autocomplete="off" enctype="multipart/form-data">

        <table align="center" width="100%">

           

            <tr bgcolor="#ababee">

                <td colspan="2" align="center"><h2>Upload your file</h2></td>

            </tr>

            <tr>

                <td >Select file to upload</td>

                <td ><input type="file" name="file" id="file" style="left:0;">               

                </td>

            </tr>   

                          

           

            <tr>

                <td colspan="2">               

                <input type="submit" name="upload" value="Upload">

                </td>

            </tr>                

           

        </table>       

   </form>

Database Connection using VB.Net class

This Class, implemented in VB .Net, is  used to connect and execute queries on Microsoft SQL Server database. It uses Data.SqlClient library to perform database operations.

Methods implemented in this class

C Program to implement stack using array

A stack is a data structure which is a  logical representation of  a real physical stack or pile of objects, where insertion and deletion of items takes place at one end called top of the stack. The basic concept can be illustrated by thinking of the data set as a stack of plates or books where you can only take the top item off the stack in order to remove things from it. In a stack last added item is deleted first and so it is called a LIFO (Last In First Out) data structure.