Noob Data Engineer

In this example program, we are building a python program to safely store and retrieve the password. It stores passwords in a file. Passwords are totally secured. This program also contains a master password to use the application. Option available in the program is you can get previously-stored password. You can also add your new password. You can also check for all stored usernames. So let's start writing Python Program to build a Simple Password Saver. Note:  This program is not a fully secure program to store your important passwords. This is just an idea to create one, you can make some modifications and suggestions to us via comments.  Algorithm Upon Entry validity of user is checked by a master password, which is currently hardcoded as (rahulkumar). If validated then we enter into an endless while loop which will show you menu to do various things. If validation failed error message will be shown and program exits. we will be store all passwords as key and value pairs....

Top 5 Programming Languages need to learn in 2020 If you're new to software development. The first question that comes to mind is where to start? This is probably true! There are hundreds of choices. How are you going to discover that this is the language I want to learn? What will be the most appropriate for you, your interests and your professional goals? One of the easiest ways to choose the best programming language to learn in 2020 is to listen to what the market says. Where the technology trend is heading ... What to learn in 2020 1. JavaScript Without Javascript, you cannot think of interactive web pages. That is the main reason JavaScript is so much popular among software developers. Today, it seems impossible to be a software developer without the use of JavaScript. First from the list is JavaScript, it seems impossible to imagine software development without JavaScript. In Stack Overflow 2018 for developers, JavaScript is the most widely used by developers in t...

In this post, we are learning about the facts that are needed before investing in any mutual funds. First Of All, let's talk about  what is Mutual Funds. Mutual Funds Introduction Mutual Funds  are professionally managed by expert Fund Managers after extensive market research for the benefit of investors. A mutual fund is an inexpensive way for investors to get a full-time professional fund manager to manage their money. WARNING: Mutual funds are a market of risks. Investors should do its own research. There are a few things you need to remember in case of mutual funds in India. SIP/One Time Risk Level NAV (Net Asset Value) Exit Load  Is it good or not? So we will discuss one by one. SIP/One Time This is a type of money investing like how you want to invest the money on a monthly basis or in a single time. According to expert opinion, one who is a beginner in this market should start with SIP because it can work in the fluctuating market. Risk Level There are several leve...

This program is used to calculate tax in the Python programming language. Tax calculating Program in Python This Tax calculating algorithm is very in this program we can improve this algorithm a lot. Note:  this is a very basic implementation of tax calculation. One should not use this to calculate the real tax to submit in real life, this is just a simulator for practice purposes. Algorithm:  First, we are asking for user input to get the total income and total saving, then we are checking for total taxable income by reducing savings from total_income. Then we are checking for various checks for tax bands. Implementation:  Code #code #Tax calculating program in python #By Rahul Rajput total_income=int(input("Please enter you total income: ")) print("700000") total_saving=int(input("Please enter you total saving: ")) print("50000") tax_exemption_limit=500000 tax_10_percent=750000 tax_20_percent=1000000 tax_30_percent=1250000 total_taxable_income...

The second equation of motion is used to calculate the displacement of an object under constant acceleration. Algorithm:  Without wasting any of your precious time let's try to understand how the algorithm is implemented. want to check the implementation of the Third equation of motion,   click here. The second equation of motion is s = u*t + 1/2 * a * t * t s: total displacement u: initial velocity t: time taken by the journey a: constant acceleration as you can see in our program we are considering  u=0  if you want you can set initialVelocity variable value as per your choice or you can ask it from user too also acceleration value is 9.8 equal to the gravity of earth. want to check the implementation of the first equation of motion,   click here. In a function  fallingDistance  we have implemented the equation. total_dist = 9.8 * i * i * 1/2 + u * i ; total_dist = (4.9 * i * i) + (u * i); Code: #include // this is the implementation of 2nd equation...

The third equation of motion is used to deduce the relation between initial velocity, final velocity, displacement, and acceleration without time. Third equation of motion Algorithm: Without wasting any of your precious time let's try to understand how the algorithm is implemented. want to check the implementation of Second equation of motion , click here. Third equation of motion is v * v = u * u + 2 * a * s s: total displacement u: initial velocity v: final velocity a: constant acceleration In function CalculateDisplacement, we are calculating the value of displacement. want to check the implementation of First equation of motion, click here. as you can see in our program we are considering u=0 if you want you can set initialVelocity variable value as per your choice or you can ask it from user too. Code: #include stdio.h //please make it correct // this is the implementation of 3rd equations of motion. void CalculateDisplacement(float a,float u,float v){ float displacement=...

The first equation of motion is used to calculate the final velocity of an object under constant acceleration. Algorithm:  Without wasting any of your precious time let's try to understand how the algorithm is implemented. The first equation of motion is want to check the implementation of Second equation of motion ,  click here. v = u + a * t u: initial velocity t: time taken by the journey a: constant acceleration as you can see in our program we are considering u=0 if you want you can set initialVelocity variable value as per your choice or you can ask it from user too, accel=5 and timeOfJourney=7. want to check the implementation of the Third equation of motion,   click here. In function, finalVelocityWithConstantAcceleration we have implemented the equation. final_velocity = u * a * i Code: #include // this is the implementation of 1st equations of motion. void finalVelocityWithConstantAcceleration(int accel,float u,int xtime){ float final_velocity=0; printf...

Bubble sort is the simplest Sorting algorithm available. It works by repeatedly swapping the adjacent or neighbor element if they are in the wrong order. Working Actually in the first-pass bubble sort sets the largest element to its position, in the second pass algorithm sets the second largest element this continues till the list or array is not finally sorted. Here is the example image. To work with the algorithm you first have to understand what is swapping and how it is done. What is Swapping ?? Swapping is a technique to interchange the content of the two variables, using another variable called a temporary variable. In python programming language swapping works in two ways, both of them are shown below. For the program in Python arr = [64, 34, 25, 12, 22, 11, 90] n = len(arr) for i in range(n): # Last i elements are already in place for j in range(0, n-i-1): # traverse the array from 0 to n-i-1 # Swap if the element found is greater # than the next element if ...

What is the Fibonacci series The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The next number is found by adding up the two numbers before it. The 2 is found by adding the two numbers before it (1+1) The 3 is found by adding the two numbers before it (1+2), And the 5 is (2+3), and so on! Example: the next number in the sequence above is 21+34 =  55 code for Fibonacci series is terms = int(input("how many terms? : ")) #taking the input from the user #using recursion to print the series def recur_fibo(n,a1,a2): if n <= 1: #return this if terms is less than 1 print(a1) return else: print(str(a1) , end=" , ") return(recur_fibo(n-1,a2,a1 + a2)) #checking for the negative number and single terms if terms <= 0: print("Please enter a positive integer") elif terms == 1: print("Fibonacci Sequence of 1 terms : ") print(0) else: recur_fibo(terms,0,1) to veri...

In the process of learning the basic of C language people often create shapes using the *, and these shapes question are also asked in the interview question and selection exam of various companies so it is very good to learn how to make various shapes. Rectangle we can also make multiply etc. Multiply Code for the above images it is in the order of images. #include <iostream> using namespace std; int main() { int size; cout << "Enter Number "; cin >> size; cout << endl; for(int i=0;i<size;i++){ for(int j=0;j<size;j++){ cout << "*"; } cout << endl; } cout << endl; for(int i=0;i<size;i++){ for(int j=0;j<size;j++){ if(i == j) cout << "*"; else cout << " "; } cout << endl; } cout << endl; for(int i=0;i<size;i++)...

What is selection sorting The selection algorithm sorts an array by repeatedly finding the smallest element (considering increasing or ascending order) from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given group. 1) Subarray that is already sorted. 2) Remaining subarray that is unsorted. At each iteration of selection, the minimum value (with regard to rising order) is sorted from the unsorted subarray and moved to the sorted subframe. Code #include <stdio.h> void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } void selectionSort(int a[], int n) { int i, j, minIndex; printf("sorting array of length %d...\n",n); // n-1 changed to n for (i = 0; i < n; i++) { // in selection sort we find the smallest element // from array and put it aside, then we // find the next smallest in the remaining array // again, and go on and go on // pri...

what is Julian Day Number Julian Day is the continuous number of days since the beginning of the Julian period and is mainly used by astronomers and in software to easily calculate past days between two events (eg, food production date and sales by date). Code #include<iostream> #include <limits> using namespace std; void input_data(int &month, int &year, int &day,int &bmonth, int &byear, int &bday); void calculations(int month, int year, int day, int &jdn); void output_results(int &month, int &year, int &day, int &jdn,int d); void calculate_dow(int &jdn , int &dow); void calculate_difference_and_print(int jdn , int bjdn); void pause(); int main() { int bday; int bmonth; int byear; int bjdn; int day; int month; int year; int jdn; int dow; int bdow; input_data(month, year, day,bmonth, byear, bday); // calculate JDN for the present day calculations(month, year, day, jdn); // calculat...

Bubble sort is the simplest Sorting algorithm available. It works by repeatedly swapping the adjacent or neighbor element if they are in the wrong order. Working Actually in first pass bubble sort sets the largest element to its position, in the second pass algorithm sets the second largest element this continues till the list or array is not finally sorted. Here is the example image. To work with the algorithm you first have to understand what is swapping and how it is done. What is Swapping ?? Swapping is the technique to interchange the content of the two variables, using another variable called temporary variable. For the program in C #include <stdio.h> void bubbleSort(int s[],int size){ int c,swap,d; for (c = 0 ; c < size - 1; c++) { for (d = 0 ; d < size - c - 1; d++) { if (s[d] > s[d+1]) /* For decreasing order use < */ { swap = s[d]; s[d] = s[d+1]; s[d+1] = swap...

Distributed system DS is the subject mandatory subject in the seventh semester of the final year of Computer Science in Dr. APJ Abdul Kalam Technical University. Lab practical Questions. Assignment 1 Assignment 2 Assignment 3 Assignment 4 For the completed Answer of these assignments are in the link given below. Answers Thanks for being here. Subscribe to this blog for more post like this.

Welcome to the second part of this Series of C language. In this series, we will start with the basic of C language. Previous post Environment Setup Text Editor Install any of the text editor available in the market, suggestion consist of the Sublime Text Editor, notepad++ etc. I have been using Sublime Text Editor. Compiler Install the compiler if you have not previously then check out this post. Installing C/C++ (GCC) compiler On Windows Basics of C Before starting anything lets take a look at the minimum code required to run a C program. Now we are going to do the Most famous ritual of the programming, Program of Hello World. #include <stdio.h> int main(int argc, char const *argv[]) { printf("Hello World!\n"); return 0; } save this program as the hello.c this will give output as like Comments in C comment is of two types in C. first // this is single line comment in c Second, /* this is multiline comment in c language */ Semicolons in C A semicolon terminates the ...

Welcome to this tutorial series Learning C language. In this tutorial series, we start very easily with C language and learn it's concept easily and efficiently. We will learn by doing not by just the learning things and forgetting and again learning and forgetting. So to strengthen our concept we will do some example each tutorial so it will help us to build some experience and make our concept stronger. Remember with the Practice and Hard Work you can achieve anything in this so keep practicing Guys. After the startup motivation now we will start with the introduction of the C language. Note: I will try to keep tutorial short and easy so that they won't bother you of being too lengthy. Soooo without wasting much time let's start the tutorial. History First, let's start with the introduction. C language is an Imperative Procedural programming language developed by the Dennis Ritchie in 1972 at bell laboratories of AT&T (American Telephone & Telegraph), locat...

Here is the Code to create linked list #include <stdio.h> #include <stdlib.h> struct Node{ int data; struct Node *next; }; typedef struct Node *node; node createNewNode(){ node temp; temp = (node)malloc(sizeof(struct Node)); // allocate memory equal memory as the size using malloc() temp->next = NULL;// make next point to NULL (suppose this as last node) return temp; } node addNode(node head, int value){ node tmp,p; tmp = createNewNode(); tmp->data = value; if(head == NULL){ head = tmp; } else{ p = head; while(p->next != NULL){ p = p->next; } p->next = tmp; } return head; } int main() { node head = NULL; head = addNode(head,2); head = addNode(head,3); head = addNode(head,5); head = addNode(head,8); node p; p = head; while(p != NULL){ printf("%d\n",p->data); p = p->next; } ret...

Console Games Games that can be played using the console. Here is the program for the Blackjack Game of the cards. BlackJack Game Blackjack  is the American variant of a globally popular  banking game  known as  Twenty-One. in this game, one player has to make the total sum of their hands to lower than 21 to win while another player has the total sum is 21 or more, All the cards greater than 10 are considered as the 10 and Ace is considered as the 11 or 1 depending on conditions. The person who has less total of the cards is the winner (one player should have scored more than 21). import random class blackJack: player1Hand = 0 player2Hand = 0 deck ={'Ace of Spades':1, '2 of Spades':2, '3 of Spades':3, '4 of Spades':4, '5 of Spades':5, '6 of Spades':6, '7 of Spades':7, '8 of Spades':8, '9 of Spades':9, '10 of Spades':10, 'Jack of Spades':10, 'Queen of Spades':10, 'King of ...