JAVA PROGRAM TO FIND THE TRANSPOSE OF A MATRIX (A transpose of an array obtained by interchanging the elements of the rows and columns) . WITH COMMENTS AND DETAILS TO HELP YOU UNDERSTAND THE…Full description
Program of singly link list in c++ with insertion ,deletion and traversing optionsFull description
NOTE: it usually takes some time to reply to your queries because i have a lot of work and i'm not on scribd frequently so please be patient. thanks The project deals with VHDL implementat…Full description
Touchscreen program using AVRDescripción completa
Descrição completa
3rd Sem Diploma in INformation science
C program for Binary Search TreeFull description
Wireless CommunicationFull description
With the onset of High Rise Buildings in metropolitan cities, planning and scheduling has become a major concept to be considered for a smooth execution of construction works. Completing a project within the scheduled time frame and estimated cost is
C program for Binary Search Tree TraversalFull description
3rd Sem Diploma in Computer Science
This book is more beneficial for beginner in C++.It has all basic definition of C++ and we can learn "How to start the C++?".You can send feedback mail on "[email protected]".
Full description
Deskripsi lengkap
Full description
Implementing the Elevator using VHDL or Verilog based design IP cores.Full description
Resolution, Speed, and Power consumption are the three key parameters for an Analog-to-Digital Converter (ADC) and Flash ADCs are the fastest type of ADC. In this paper an effort is made …Full description
In theoretical computer science, combinatorial optimization problems are about finding an optimal item from a finite set of objects. Combinatorial optimization is the process of searching for maxima or minima of an unbiased function whose domain is a
Implementing the Elevator using VHDL or Verilog based design IP cores.Description complète
Descripción: Investigacion array dinamico
Parallel computing is a type of computation in which many processing are performed concurrently often by dividing large problems into smaller ones that execute independently of each other. There are several different types of parallel computing. The
I have tried to explain thoroughly the functioning and programming of the PWM mode of the Output Compare Module of the dsPIC33FJ12GP202. I have tried to discuss in detail the generation of t…Descripción completa
LIST IMPLEMENTATION USING ARRAY
#include #include #define MAX 20 //maximum no of elements in the list //user defined datatypes struct { int list[MAX]; int element; //new element to be inserted int pos; //position of the element to be inserted or deleted int length; //total no of elements }l; enum boolean { true, false }; typedef enum boolean boolean; //function prototypes int menu(void); //function to display the list of operations void create(void); //function to create initial set of elements void insert(int, int); //function to insert the given element at specified position void delet(int); //function to delete the element at given position void find(int); //function to find the position of the given element, if exists void display(void); //function to display the elements in the list boolean islistfull(void); //function to check whether the list is full or not boolean islistempty(void); //function to check whether the list is empty or not void main() { int ch; int element; int pos; l.length = 0; while(1) { ch = menu(); switch (ch) { case 1: l.length = 0; create(); break; case 2:
if (islistfull() != true) { printf("\tEnter the New element : "); scanf("%d", &element); printf("\tEnter the Position : "); scanf("%d", &pos); insert(element, pos); } else { printf("\tList if Full. Cannot insert"); printf("\nPress any key to continue..."); getch(); } break; case 3: if (islistempty() != true) { printf("Enter the position of element to be deleted : "); scanf("%d", &pos); delet(pos); } else { printf("List is Empty."); printf("\nPress any key to continue..."); getch(); } break; case 4: printf("No of elements in the list is %d", l.length); printf("\nPress any key to continue..."); getch(); break; case 5: printf("Enter the element to be searched : "); scanf("%d", &element); find(element); break; case 6: display(); break; case 7: exit(0); break; default: printf("Invalid Choice"); printf("\nPress any key to continue..."); getch(); }
} } //function to display the list of elements int menu() { int ch; clrscr(); printf("\n\t\t********************************************\n"); printf("\t\t******LIST Implementation Using Arrays******\n"); printf("\t\t********************************************\n\n"); printf("\t1. Create\n\t2. Insert\n\t3. Delete\n\t4. Count\n\t5. Find\n\t6. Display\n\t7. Exit\n\n\tEnter your choice : "); scanf("%d", &ch); printf("\n\n"); return ch; } //function to create initial set of elements void create(void) { int element; int flag=1; while(flag==1) { printf("Enter an element : "); scanf("%d", &element); l.list[l.length] = element; l.length++; printf("To insert another element press '1' : "); scanf("%d", &flag); } } //function to display the elements in the list void display(void) { int i; for (i=0; i
printf("\n\nCannot insert at zeroth position"); getch(); return; } if (pos-1 > l.length) { printf("\n\nOnly %d elements exit. Cannot insert at %d postion", l.length, pos); printf("\nPress any key to continue..."); getch(); } else { for (i=l.length; i>=pos-1; i--) { l.list[i+1] = l.list[i]; } l.list[pos-1] = element; l.length++; } } //function to delete the element at given position void delet(int pos) { int i; if(pos == 0) { printf("\n\nCannot delete at zeroth position"); getch(); return; } if (pos > l.length) { printf("\n\nOnly %d elements exit. Cannot delete", l.length, pos); printf("\nPress any key to continue..."); getch(); return; } for (i=pos-1; i
for (i=0; i
Create Insert Delete Count Find Display Exit
Enter your Choice: 1 Enter an element: 25 To insert another element press 1: 1
Enter an element: 50 To insert another element press 1: 0 Enter your Choice: 6 Element in the List are 1. 25 2. 50 Enter your Choice: 2 Enter an element: 5 Enter the position: 1 Element in the List are 1. 25 2. 50 Enter your Choice: 3 Enter the position: 3 Enter your Choice: 6 Element in the List are 1. 5 2. 25 Enter your Choice: 4 Number of Elements: 2 Enter your Choice: 7 More useful programs @ http://www.gethugames.in/blog/
