QxCoding

Posts

c++ typing speed tester project using graphics.h header file

INTRODUCTION I have made project “ Typing speed tester “. In this software we can test our speed and efficiency for typing via general keyboard. In this programme we have to type the characters which are displayed on the user screen. Now, coming to technical aspects of this software, all data are maintained in binary files, concepts of function and little bit use of graphical colours. LOGIN INFORMATION USERNAME: jatin PASSWORD: password Header Files Ø iostream.h Ø dos.h Ø stdio.h Ø conio.h Ø time.h Ø string.h Ø stdlib.h Ø "tt.h" SOFTWARE RECQURIMENTS OS: Windows Platform RAM : 512 MB Processor : Pentium 3 or Above Compiler : Turbo C++ or Borland C...

How to clear cache in python

What is Caching? The process of caching enables storing of temporary data, the result of which is faster access, load times and speedier experience for the user. Deleting it makes the process to reload assets again. Why to remove cache? It is a good idea to clear your browser cache because it: prevents you from using old forms protects your personal information helps our applications run better on your computer Python code for clearing cache: ''' Clear cache files ''' import os if __name__=='__main__': outer = os.getcwd() cache = os.path.join(outer, 'cache') for f in os.listdir(cache): f = os.path.join(cache, f) os.remove(f) print("Removed {} files.".format(count)) if any doubts or queries please comment

Series Finder App for Android

Series Finder is An android app which works on Linear regression ML Model and predicts the next term of the given series (sequence of correlated terms) . Series finder app takes only 5(*6) terms of a series to predict the next term with accuracy of up to 95 percent. The links to download the app are given below: Direct Download Link (update) seriesFinder_build2.apk ( mirror download ) Play Store Link (Currently not available) if any doubts or queries please comment

How to convert binary number to decimal number using recursion in C

Recursive function: int binary(int num,int step){ if(!num){ return num; } printf("step %d: binary no=%d,rem=%d \n",step,num,num%10); num=num%10+2*binary(num/10,step+1); printf("backtrack res step %d (decimal)=%d\n",step,num); return num; } the above function recursively calls itself by passing the binary number whose last digit is removed and stored in num%10 (remainder) which will be added and multiplied by two in each phase while backtracking. num=num%10+2*binary(num/10,step+1); the output of the code along with the values of variables in forward and backward stage are given below: Source Code: // https://www.qxcoding.com/ //binary to decimal include int binary(int num,int step){ if(!num){ return num; } printf("step %d: binary no=%d,rem=%d \n",step,num,num%10); num=num%10+2*binary(num/10,step+1); printf("backtrack res step %...

How to merge two sorted singly linked list

here we will discuss ,how to merge two sorted linked list such that the final list is sorted in ascending order the structure ( node ) definition is given below: typedef struct node{ int val; struct node* next; }* node; Explanation: we will insert (merge ) the elements of list 2 (f2) in f1 by comparing each nodes value. ALGORITHM: traverse both lists till one of them is completely traversed compare the values of node and if the value of node of list f1 is smaller then move to next node of f1 and increment the value of pos. the pos variable will be used after complete traversal to join the remaining elements of f2 if any. and if f2 nodes value is smaller then insert it before the current node in f1 and set f1 to previous node that is the node of f2 and increment f2 to next node. after completely traversing one of the lists , append the remaining elements of f2 if any in f1 . void merge_ll(node *first){ delete_ll(*first);*first=NULL; int pos=0; printf(...

How to Reverse a Singly linked list ? C/C++ Program

To reverse a given linked list ,we have to point the next (link) of each node to its previous node(ie: the node which is pointing to it.) for that we will maintain three pointers : 1) prev : will point to the node which is pointing to the current node. 2) cur : will point to the node in which we have to change the next(link) to the previous node. 3) next: in the process of changing the cur->next to prev the cur->next will be lost so to store the address of cur->next we use next pointer. Node definition: typedef struct node{ int val; struct node* next; }* node; as given above the node contains two members value and a pointer pointing to its own datatype which will store the address of another node . reverse_ll(node *first) : function : void reverse_ll(node* first){ node prev=NULL; node cur=(*first); node next=NULL; while(cur){ next=cur->next; cur->next=prev; pr...

How to find the occurrence's of a pattern in a given string Using KMP algorithm?

For finding the pattern in a given string , we are going to use KMP algorithm for individual occurrence of the pattern and print the reference index of the original string. The function which will find the pattern in a given string : int KMP(char * str,char* find,int s){ int sl=strlen(str); int fl=strlen(find); for(int i=s;i<sl-fl+1;i++){ int i1=i; for(int j=0;j<fl;j++,i1++){ //cout<<j<<fl<<endl; if(j==fl-1)return i; if(str[i]!=find[j])break; } } return -1; } For finding all the places (positions/index) where the pattern is present, we have to call the above function repetitively with passing the index from where it has to resume the search as a parameter to the function. The same is implemented in the function below: int print_occurence(char* str,char* find){ int sl=strlen(str); int fl=strlen(find); int occ=0; for(int i=0;i<sl;i++){ ...