Business Model Canvas :

The Business Model Canvas, is a strategic management and entrepreneurial tool. It allows you to describe, design, challenge, invent, and pivot your business model. 

Image:

Designed by: Strategyzer AG. The makers of Business Model Generation and Strategyzer.
Source: Wiki, Strategyzer.
Download: Click here to download BMC


Business Model Canvas Report Format (for GTU Project-II):

1. Title
2. Description
3. Introduction
4. Canvas Elements
   • Customer Segment
   • Value Proposition
   • Customer Relationship
   • Channels
   • Key Activities
   • Key Resources
   • Key Partnerships
   • Cost Structures
   • Revenue Streams
5. Conclusion

 

Here is the link to download Management 1 PPTs.
These ppts are given by Management teacher. Contains 5 chapters. May this help you for your exam.

Click here to download

OOPC Linked List Using Stacks Code :

#include<iostream>
//using namespace std;
class node
{
public :
    int d; //data
    node *p; // contains the address of the next node
};
class linked
{

public :
    node *start;
public :
    linked()
    {
        start=NULL;
    }
    void insert_at_beg();
    void insert_at_mid();
    void insert_at_end();
    int remove();
    void display();
};
void linked :: insert_at_end()
{
    node *temp;
    if(start==NULL)
    {
        start=new node [1];
        start->p=NULL;
        cout<<"\n Enter Data to insert \n";
        cin>>start->d;
    }
    else
    {
        temp=start;                                       
        while(temp->p!=NULL)
            temp=temp->p;
        temp->p= new node [1];
        temp=temp->p;
        cout<<"\n Enter Data to insert \n";
        cin>>temp->d;
        temp->p=NULL;
    }
}
void linked :: insert_at_mid()
{
    node *temp,*next;
    int x;
    temp=start;
    cout<<"\n Enter the Neighbour element \n";
    cin>>x;
    while(temp->d!=x)
        temp=temp->p;
    next=temp->p;
    temp->p=new node [1];
    temp=temp->p;
    temp->p=next;
    cout<<"\n Enter data to insert \n";
    cin>>temp->d;
}
void linked :: insert_at_beg()
{
    node *temp;
    temp=new node [1];
    temp->p=start;
    start=temp;
    cout<<"\n Enter element to insert \n";
    cin>>temp->d;
}
int linked :: remove()
{
    node *temp,*prev;
    int x;
    if(start==NULL)
    {
        cout<<"\n Underflow -- No element to Delete \n";
        return 0;
    }
    cout<<"\n Enter element to delete \n";
    cin>>x;
    if(start->d==x && start->p==NULL)
    {
        delete start;
        start=NULL;
        cout<<"\n Deletion successfull \n";
        return 0;
    }
    if(start->d==x)
    {
        temp=start->p;
        delete start;
        start=temp;
        cout<<"\n Deletion Successfull \n";
        return 0;
    }
    temp=start;
    while(temp->d!=x)
    {
        prev=temp;
        temp=temp->p;
    }
    prev->p=temp->p;
    cout<<"\n Deletion Successfull \n";
    return x;
}
void linked :: display()
{
    node *temp;
    temp=start;
    cout<<"\n Linked List elements are \n";
    while(temp->p!=NULL)
    {
        cout<<""<<temp->d<<" ";
        temp=temp->p;
    }
    cout<<temp->d<<endl;
}
int main()
{
    int n=0,a;
    linked l;
    do
    {
        cout<<"\n ************** M E N U **************\n";
        cout<<"\n1.Insert at beginning\n2.Insert at middle\n3.Insert at end\n4.Delete\n5.Display elements";
        cout<<"\n6.Exit\n";
        cout<<"Enter option \n";
        cin>>a;
        switch(a)
        {
        case 1:
            l.insert_at_beg();
            break;
        case 2:
            l.insert_at_mid();
            break;
        case 3:
            l.insert_at_end();
            break;
        case 4:
            l.remove();
            break;
        case 5:
            l.display();
            break;
        case 6:
            n=1;
            break;
        default :
            cout<<"\n Invalid Entry \n";
            break;
        }
    }while(n!=1);
    return 0;
}

Exam Time Table

Semester 4

 

Semester 3

The exam schedule is here. Check it out.

Exam Timetable Summer 2014

Students of B.e/mca/maba/b.pharm/m.pharm/diploma/hm/me can follow the below mentioned steps to check the mid semester marks;-

1. Go to the below web url
   http://14.139.122.69/instinfo/midmark.jsp
2. Enter your Enrollment No.
3. you will get your mid semester marks.

Note:- The portal is on updation mode, you can keep on checking the portal to check your mid semester marks. There are chance that particular subject and particular college may not updated the mid semester marks, in such case you need to wait to get your marks updated.

For any trouble shooting, please comment below your query for more information. you can keep visiting us for free updates on mid semester exam marks.

 

Regular Sem 3 :

Branch 31 : Computer Science & Engineering
130704	Computer Organization and Architecture	26-11-2013	02:30 to 05:00
130701	Digital Logic Design	28-11-2013	02:30 to 05:00
130703	Database Management System	30-11-2013	02:30 to 05:00
131101	Basic Electronics	03-12-2013	02:30 to 05:00
130001	Mathematics-3	05-12-2013	02:30 to 05:30
130002	Advanced Engineering Mathematics	05-12-2013	02:30 to 05:30
130702	Data and File Structure	07-12-2013	02:30 to 05:00

 IMPORTANT INSTRUCTION FOR STUDENTS APPEARING IN ABOVE MENTION EXAMINATIONS:

1.      All the students required to carry hall ticket with them issued by the university during exam time.
2.      They must be in their respective examination hall 30 minutes before exam time failing which entry will not be permitted.
3.      Any type of printed/handwritten/typed material, Mobile phone, Pager, or programmable calculator, PDA or any other objectionable material which breaches the code of conduct of university and falls under unfair means as per GTU circular dated 3^rd November, 2010 is not allowed to carry in examination hall
4.      They must bring their own instruments such as scientific calculator etc. to be used in examination as its exchanges will not be permitted under any circumstances during exam time.