TCCI-Tririd Computer Coaching Institute is focused on providing Quality education with practical sessions.Satisfaction of our student is our priority. We pride ourselves for providing proficient IT solutions. We have a highly qualificated and expereinced faculties, who, not only handle teaching, but also aspire to provide the best possible solution through their technical expertise.
Thursday, April 22, 2021
Tuesday, March 2, 2021
TCCI Coaching Classes – Coaching/Training Development
All computer courses for BCA, MCA, BSC-MSc. IT, Diploma-Degree Engineering, school-students (any standard), and any person are taught at the institute by highly qualified and experienced faculties. The institute provides corporate trainings to many of the IT companies & other educational institutes.
Services Provided By TCCI
Mobile Application Development
Web Application Development
Search Engine Optimization
To Learn More about Project Training Institute In Ahmedabad, basic Computer Course in Ahmedabad, Programming Language in Ahmedabad, TCCI
Contact us @ 98256 18292
Mail to tccicoaching@gmail.com
Get information from https://tccicomputercoaching.wordpress.com/
Thursday, June 18, 2020
Wednesday, June 17, 2020
Queue IN Data Structure - tccicomputercoaching.com
What is Queue?
Queue is also an abstract data type or a linear data structure, in which the first element is inserted from one end called REAR (also called tail), and the deletion of existing element takes place from the other end called as FRONT (also called head). This makes queue as FIFO data structure, which means that element inserted first will also be removed first.Like Stack, Queue is also an ordered list of elements of similar data types.
A queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed.
Real Example of Queue:
A queue at window of movie-ticket. The person who is standing first, its turn comes first, he/her comes first out.Queue can be implemented using an Array, Stack or Linked List. The easiest way of implementing a queue is by using an Array. A bounded queue is a queue limited to a fixed number of items.
One characteristic of a queue is that it does not have a specific capacity. Regardless of how many elements are already contained, a new element can always be added. It can also be empty, at which point removing an element will be impossible until a new element has been added again.
Fixed length arrays are limited in capacity, but it is not true that items need to be copied towards the head of the queue.
Operations –
- createQueue Operation– This operation takes the maximum number of elements (maxElements) the Queue can hold as an argument, creates a Queue according to it and returns a pointer to the Queue.
- Enqueue Operation – This Operation takes the pointer to the top of the queue Q and the item (element) to be inserted as arguments. Check for the emptiness of queue.
- Dequeue Operation – This Operation takes the pointer to the top of the stack S as an argument and will then dequeue an element.
- Front function – This function takes the pointer to the top of the queue Q as an argument and returns the front element of the queue Q.
If you like this post then please share and like the post.
To Learn More About data structure in ahemdabad and , Computer Class
Visit us @ tccicomputercoaching.com
Call us @ 98256 18292
Monday, April 27, 2020
TCCI Coaching Classes – Coaching/Training Development- tccicomputercoaching.com
Services Provided By TCCI
- Mobile Application Development
- Web Application Development
- Search Engine Optimization
Get information about TCCI,
Visit us @ tccicomputercoaching.com
Call us @ 98256 18292.
Sunday, December 30, 2018
Saturday, December 29, 2018
User Defined Function in C-Tccicomputercoaching.com
What is User Defined Function?
A User Defined Function is a block of code developed by user to perform specific task.Using user Defined Function we can divide a complex problem into smaller modules. So we can decrease complexity and lengthy.
C allows programmer to define functions according to their need. These functions are known as user-defined functions. For example:
Suppose, a program which includes addition, subtraction, division and multiplication of two numbers in same program. You can create user defined functions for each operation individually to solve this problem:
For example,
#include <stdio.h>
#include <conio.h>
Void add(int, int); // function prototype
Void sub (int, int); // function prototype
Void mul (int, int); // function prototype
Void div (int, int); // function prototype
void main ()
{
inta,b;
printf(“enter the value of a and b);
scanf(“%d %d”,&a,&b);
clrscr ();
add (a,b);
sub (a,b);
mul (a,b);
div (a,b);
}
Void add (int x,int y)
{
Int c;
C=x+y;
printf(“%d”,c)
}
void sub ()
{
Int c;
C=x-y;
printf (“sub=%d”,c)
}
Void mul ()
{
int c;
C=x *y;
printf (“%d”, c)
}
Void div ()
{
int c;
C=x/y;
Printf(“div=%d”,c)
}
User Defined Function has 3 sections:
Function Prototype
Function Call
Function Definition
Function prototype:
Syntax of function prototype :
returnTypefunctionName(type1 argument1, type2 argument2,...);
A function prototype is simply the declaration of a function that specifies function's name, parameters and return type. It doesn't contain function body. Parameters names are optional.
Function Call:
Syntax of Function Call:
Function name (argument1, argument2);
We can use only value also. i. e. add (5, 6);
Compiler starts compilation from main () function, so to jump control from main to user defined function, have to use function call. When this function call executes, control jumps from main to that particular user defined function.
Function Definition:
Syntax of Function Definition:
returnTypefunctionName(type1 argument1, type2 argument2,...)
{
Body of function
}
When a function is called, the control of the program is transferred to the function definition. And, the compiler starts executing the codes inside the body of a function.
Passing arguments to a function:
In programming, argument refers to the variable passed to the function. In the above example, two variables a and b are passed during function call.
The parameters x and y accepts the passed arguments in the function definition. These arguments are called formal parameters of the function.
The type of arguments passed to a function and the formal parameters must match, otherwise the compiler throws error.
Return Statement:
The return statement terminates the execution of a function and returns a value to the calling function. The program control is transferred to the calling function after return statement.
TCCI-Tririd Computer Coaching Institute is focused on providing Quality education with practical sessions. At TCCI student can learn various programming languages like c , c++, Java, Data Structure, Python etc...
If you like this post then please share and like this post.
Call us @ 98256 18292.
Visit us @ tccicomputercoaching.com
Tuesday, July 4, 2017
Wednesday, June 28, 2017
MISSION OF TCCI COMPUTER INSTITUTE - TCCI
MISSION OF TCCI COMPUTER INSTITUTE - TCCI
Tuesday, June 6, 2017
Monday, February 6, 2017
MISSION OF TCCI COMPUTER INSTITUTE - tccicomputercoaching.com
MISSION OF TCCI COMPUTER INSTITUTE - tccicomputercoaching.com
Thursday, November 17, 2016
TCCI Coaching Classes – CoachingTraining Development
- Mobile Application Development
- Web Application Development
- Search Engine Optimization



