Bikki Mahato

Saturday, 30 September 2017

Norton's Theorem

Norton's Theorem. Any collection of batteries and resistances with two terminals is electrically equivalent to an ideal current source i in parallel with a single resistor r. The value of r is the same as that in the Thevenin equivalent and the current i can be found by dividing the open circuit voltage by r.
In this video lecture we will learn about Norton's Theorem , its procedure and its example.

Follow :)
Youtube: https://www.youtube.com/c/BikkiMahato
Facebook: https://www.facebook.com/mahatobikki
Facebook Page:https://www.facebook.com/youtubebikki
Twitter:https://twitter.com/mahato_bikki
Instagram:https://www.instagram.com/bikkimahato
Google+:https://plus.google.com/u/0/+BikkiMahato
Blogger:https://bikkimahato.blogspot.in

Support :)
Paytm : 8100147475
PhonePe : 8100147475
Patreon : https://www.patreon.com/bikkimahato
Instamojo : https://www.instamojo.com/@bikkimahato
Paypal : https://www.paypal.me/bikkimahato

,Thanks

Bikki Mahato

Thevenin's Theorem

In this video lecture we will learn about thevenin's theorem, its procedure and example.

Thevenin's Theorem. Any combination of batteries and resistances with two terminals can be replaced by a single voltage source e and a single series resistor r. The value of e is the open circuit voltage at the terminals, and the value of r is e divided by the current with the terminals short circuited

,Thanks

Bikki Mahato

Tuesday, 13 December 2016

Data Structure & Algorithms | Queue

DATA STRUCTURE

QUEUE

Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first.

#include<stdio.h>
#include<stdlib.h>
#define Max 5
int a[Max];
int rear=-1;
int front=-1;
void insert(int);
void delete();
void display();
void main()
{
    int c,item;
    do
    {
        printf("\nPress 1:Insert\nPress 2:Delete\nPress 3:Diplay\nPress 0:Exit\n");
        scanf("%d",&c);
        switch(c)
        {
            case 1:printf("Enter Element\n");
                    scanf("%d",&item);
                    insert(item);
                    break;
            case 2:delete();
                    break;
            case 3:display();
                    break;
            case 0:exit(0);
        }
    }while(1);
}
void insert(int item)
{
    if(rear==Max-1)
    printf("Insertion not Possible\n");
    else
    {
        rear++;
        a[rear]=item;
    }
}
void delete()
{
    if(rear==front)
    printf("Deletion not Possible\n");
    else
    {
        front++;
        printf("Deleted Element %d",a[front]);
    }
}
void display()
{
    int i;
    printf("Queue :");
    for(i=front+1;i<=rear;i++)
    printf("%d ",a[i]);
}

,Thanks

Bikki Mahato

Friday, 9 December 2016

Canon Combo of PG-88 Fine And CL-98 Ink Cartridge (PG-88 Black:CL-98 Color)

Buy this amazing canon combo ink cartridges, i.e , PG-88 Black , CL-98 Color

Features:-

Canon CL-98 Ink Cartridge is compatible with Pixma E510 / E610
Canon PG-88 ink cartridge is compatible with the Pixma E 500 and E 600 printer
Color Type : PG 88- Black, CL 98- Color
Cartridge breathes life into every print, high-quality make and diligent performance
Package content: 2 ink cartridge

Buy from the link below to get discounts and cashbacks!!!
http://amzn.to/2ha08uH

Technical Details:-

Brand	Canon
Colour	Tri-color
Item Height	10 Centimeters
Item Width	10 Centimeters
Item Weight	141 g
Product Dimensions	10 x 10 x 10 cm
Item part number	CNNCMB_88_98-02

Sunday, 6 November 2016

Data Structure & Algorithms | Stack

DATA STRUCTURE

STACK

A stack is a basic data structure that can be logically thought as linear structure represented by a real physical stack or pile, a structure 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 your 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. This structure is used all throughout programming.
The basic implementation of a stack is also called a LIFO (Last In First Out) to demonstrate the way it accesses data, since as we will see there are various variations of stack implementations.
There are basically three operations that can be performed on stacks . They are 1) inserting an item into a stack (push). 2) deleting an item from the stack (pop). 3) displaying the contents of the stack(pip).

#include<stdio.h>
#include<stdlib.h>
#define Max 5
int a[Max];
int top=-1;
void push(int);
void pop();
void display();
void main()
{
    int c,item;
    do
    {
        printf("Press 1:Push\nPress 2:Pop\nPress 3:Display\nPress 4:Exit\n");
        scanf("%d",&c);
        switch(c)
        {
            case 1:printf("Enter Element\n");
                    scanf("%d",&item);
                    push(item);
                    break;
            case 2:pop();
                    break;
            case 3:display();
                    break;
            case 4:exit(0);
        }
    }while(1);
}
void push(int item)
{
    if(top==Max-1)
    printf("\nStack is Full");
    else
    {
        top++;
        a[top]=item;
    }
}
void pop()
{
    if(top==-1)
    printf("\nStack is Empty");
    else
    {
        printf("\nDeleted Element %d",a[top]);
        top--;
    }
}
void display()
{
    int i;
    printf("Stack : ");
    for(i=top;i>=0;i--)
    printf("%d ",a[i]);
    printf("\n");
}

,Thanks

Bikki Mahato

Wednesday, 1 June 2016

Maximum Power Transfer Theorem

In this video lecture we will learn about maximum power transfer theorem , its statement , its proof and its examples.

,Thanks

Bikki Mahato

Superposition Theorem

In this video lecture we will learn about superposition theorem, its procedure and see some example.

,Thanks

Bikki Mahato