Stack Using Single Link List

#include<stdio.h>
#include<conio.h>
/*  **********************************
Girfa Student Help
Stack Using Single Link List
Programmer Name : Mritunjoy Sengupta
for DS program visit :http://girfahelp.blogspot.in/p/data.html
    *************************************/
typedef struct n
{
int data;
struct n *next;
}node;
node *start=NULL;
node* create(int);
void push(int);
void pop();
void print();

Double Link List Complete Program

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

/* ************************************
Girfa Student Help
Double Link List Program
for More DS Program Visit : http://girfahelp.blogspot.in/p/data.html
Programmer Name : Mritunjoy Sengupta
   ***************************************
*/

typedef struct n
{
int data;
struct n *pre,*next;
}node;
node* start=NULL;

node* create(int);
void addfirst(int);
void addlast(int);
void addbefore(int);
void addafter(int);
void del(int);
void print();

UGC Net General Paper July-16 Set4

43. What are the barriers to effective communication?
  (1) Moralising, being judgemental and comments of consolation.
  (2) Dialogue, summary and self-review.
  (3) Use of simple words, cool reaction and defensive attitude.
  (4) Personal statements, eye contact and simple narration.
Answer : 1

44. The choice of communication partners is influenced by factors of
   (1) Proximity, utility, loneliness
   (2) Utility, secrecy, dissonance
   (3) Secrecy, dissonance, deception
   (4) Dissimilarity, dissonance, deviance
Answer : 1

Single Link List Through C

#include<stdio.h>

#include<conio.h>

/* *****************************

 Girfa Student Help

 Programmer Mrityunjoy Sengupta

 for more DS Code : Visit :http://girfahelp.blogspot.com/p/data.html

   ******************************

*/

typedef struct n

{

 int data;

 struct n *next;

}node;

/* Function Prototype */

node *start=NULL;/* Global Variable point first node*/

node* create(int);/* Create dynamic space for Node */

void addbegin(int);/* Add an Item to starting position of list  */

void addlast(int);/* Add an Item to last position of list  */

void addbefore(int);/* Add item before a number */

void addafter(int); /* Add item after a number */

void del(int);

void print();

void main()

{

 int n,s,opt;

 do

 {

  clrscr();

 printf("\n1. Print\n2. Add First\n3. Add Last\n4. Add Before\n5. Add After\n6. Delete\n0. Exit\n\nEnter Your Choice>> ");

  scanf("%d",&opt);

  switch(opt)