PRACTICAL FILE
of
COOPERATE COMMUNICATION
(ENG102)
Session 2025-26
Submitted to: Submitted by:
Ms. ANTARA BISWAS Student Name: Aman
Roll No: 25A11D2008
SCHOOL OF
LIBERAL ARTS SAP ID : 1000029593
DIT University
Index
Index TOPIC Date Faculty Signature
[Link] Etiquette: Making an
1 appointment and answering calls (Role Play)
2 Business Presentations (PPT Presentation)
1
3 INTERVIEW SKILLS
Check whether a given number is positive or
4
negative
5 Find the factorial of a number
Implement push operation in a stack using
6
array
Implement pop operation in a stack using
7
array
Implement queue operations (insertion,
8
deletion, display)
9 Insert a node in a singly linked list
10
-1
Objective – Write a C program to check whether a given number is even or odd.
ANSWER:
#include <stdio.h>
int main() {
[Type here]
Practical
int n; printf("Enter
an integer: "); scanf("%d", &n); if(n
% 2 == 0) printf("%d is even.", n);
else printf("%d is odd.", n); return 0;
Practical -2
Objective: Write a C program to check whether a given character is a vowel or
consonant.
ANSWER:
#include <stdio.h> #include <ctype.h> int main()
{ char c; printf("Enter a character: ");
scanf(" %c", &c); c = tolower(c); if(c == 'a' ||
c == 'e' || c == 'i' || c == 'o' || c == 'u')
printf("%c is a vowel.", c); else printf("%c is a
consonant.", c); return 0;
3
}
-3
Objective: Write a C program to find the largest number among three numbers.
ANSWER:
#include <stdio.h>
int main() {
int a, b, c; printf("Enter three numbers: ");
scanf("%d %d %d", &a, &b, &c); if(a >= b && a
>= c) printf("%d is largest.", a); else if(b >= a && b
>= c) printf("%d is largest.", b); else printf("%d is
largest.", c); return 0;
[Type here]
Practical
Practical -4
Objective: Write a C program to check whether a given number is positive or
Negative.
ANSWER:
#include <stdio.h>
int main() {
int n; printf("Enter a number: ");
scanf("%d", &n); if(n >= 0)
printf("%d is positive.", n); else
printf("%d is negative.", n); return 0;
5
-5
Objective: Write a C program to find the factorial of a number.
ANSWER:
#include <stdio.h>
int main() {
int n, i;
unsigned long long fact = 1;
printf("Enter an integer: "); scanf("%d",
&n); for(i = 1; i <= n; ++i) fact *= i;
printf("Factorial of %d = %llu", n, fact);
return 0;
[Type here]
Practical
Practical -6
Objective: Write a C program to implement push operation in a stack using
array.
ANSWER: #include <stdio.h>
#define MAX 5 int stack[MAX];
int top = -1; void push(int val) {
if (top == MAX - 1)
{ printf("Stack Overflow!\
n");
} else { stack[+
+top] = val;
} int main() { push(10); push(20); if (top
!= -1) { printf("Top element is: %d\n",
stack[top]);} return 0;
7
-7
Objective : Write a C program to implement pop operation in a stack using
array.
ANSWER:
#include <stdio.h> int
stack[5], top = -1; void pop()
{ if(top == -1)
printf("Stack Underflow!\
n");
else
printf("Popped: %d\n", stack[top--]);
} int
main()
{ pop();
return 0;
[Type here]
Practical
Practical -8
Objective : Write a C program to implement queue operations (insertion,
deletion, display).
ANSWER:
#include <stdio.h>
#define MAX 5
int q[MAX], f = -1, r = -
1; void enqueue(int v)
{ if(r < MAX-1) q[++r]
= v;
} void
dequeue() {
if(f < r)
printf("Dequeued: %d\n", q[++f]);
} int main()
{ enqueue(1
0);
dequeue();
return 0;
9
Practical -9
Objective: Write a C program to insert a node in a singly linked list.
ANSWER:
#include <stdio.h>
#include <stdlib.h> struct
Node {
int data; struct
Node* next;
};
struct Node* insert(struct Node* head, int val) { struct Node*
newNode = (struct Node*)malloc(sizeof(struct Node)); if (newNode
== NULL) { printf("Memory allocation failed!\n"); return
head;
newNode->data = val;
newNode->next = head;
return newNode;
} void display(struct Node* head)
{ struct Node* temp = head;
while (temp != NULL)
{ printf("%d -> ", temp-
>data); temp = temp->next;
[Type here]
}
printf("NULL\n");
int main() { struct Node*
head = NULL; head =
insert(head, 10); head =
insert(head, 20); head =
insert(head, 30);
printf("Linked List: ");
display(head); return 0;
Practical -10
Objective : Write a C program to delete a node from a singly linked list and
display the list.
11
ANSWER:
#include <stdio.h>
#include <stdlib.h>
struct Node
{ int data;
struct Node* next;
} *head = NULL;
void insert(int val) { struct Node* newNode = (struct
Node*)malloc(sizeof(struct Node)); newNode->data = val;
newNode->next = head; head = newNode;
}
void deleteNode() { if (head == NULL) {
printf("List is empty, nothing to delete.\n");
return;
}
struct Node* temp = head;
head = head->next;
printf("Deleting node with value: %d\n", temp->data);
free(temp); // Essential to prevent memory leaks
}
void display() { struct Node*
temp = head; while (temp !=
NULL) { printf("%d -> ",
temp->data); temp = temp-
>next;
}
printf("NULL\n");
}
int main() { insert(10);
insert(20); printf("Before
deletion: "); display();
deleteNode();
printf("After deletion: ");
display();
return 0;
}
[Type here]
13
[Type here]