Skip to main content

Posts

Showing posts from August, 2020

10 Amzing Windows Commands You Should Know

10 Amazing Windows Commands You Should Know There are some things you can only do from the command line—even in Windows. Some of these tools don’t have graphical equivalents, while others are just plain faster to use than their graphical interfaces. If you’re into using PowerShell over Command Prompt, you should note that all the commands we’re covering in this article work just the same in either tool. And obviously, we can’t possibly cover all the useful commands that these tools offer. Instead, we’ll be focusing on commands that should be useful even if you’re not a command-line person. RELATED:   10 Ways to Open the Command Prompt in Windows 10 ipconfig: Quickly Find Your IP Address RELATED:   10 Useful Options You Can Configure In Your Router's Web Interface You can find your IP address from the Control Panel, but it takes a few clicks to get there. The  ipconfig  command is a fast way of determining your computer’s IP address and other ...

How to Create the Ultimate USB Key Ring to Solve Any Computer Problem

How to Create the Ultimate USB Key Ring to Solve Any Computer Problem If you’re “the computer guy” (or girl) to your friends and family, you’re probably asked to diagnose and fix their problems on a regular basis. If you can’t stand to tell them to leave you alone, you might as well embrace your role and come prepared with one key ring full of flash drives to rule them all. With a set of drives filled with portable versions of useful PC repair and maintenance programs, along with some bootable troubleshooting utilities, you’ll be ready for just about any problem. Step One: Grab Your Drive(s) Any USB drive should work for this guide. You can fit most of the portable apps below on one single flash drive, though a few of the tools require a dedicated drive that you can boot from—this allows you to solve problems on computers that won’t even turn on. The best approach is probably to have a big, fast primary drive with most of the self-contained programs (and which you ...

The Foobar challenge: Google’s hidden test for developers

The Foobar challenge: Google’s hidden test for developers by Daniel Simmons & Smit Patel You’re just sitting at your desk, minding your own business, trying to get some work done. Then, as inevitably happens, you hit a minor roadblock: your code throws a cryptic error message. “No problem” you think. This isn’t your first rodeo. So you copy and paste the error message verbatim into Google and see what you get. No luck. There are plenty of search results, but none of them fit your situation closely enough to really provide a useful answer. And so begins the creative Googling process. You try several combinations of the error + the context that you’re using it in. You try including the name of the library that you’re using. You know you’re getting closer… Now on your sixth attempt, you try another combination of search terms and hit return. The page loads and you’ve just begun skimming over the results when, suddenly, your browser window splits open and y...

Design, Develop and Implement a menu driven Program in C for the following Array operations a. Creating an Array of N Integer Elements b. Display of Array Elements with Suitable Headings c. Inserting an Element (ELEM) at a given valid Position (POS) d. Deleting an Element at a given valid Position(POS) e. Exit. Support the program with functions for each of the above operations.

CODE IN Cpp Language  :- /** * * * @Author :- SMITPATEL */ #include"cstdlib" #include"iostream" #include"stack" using namespace std; const int MAX = 100;       int tp = -1;       int M[MAX]; void push(int item); int pop(); void palindrome(); void show();//display function void push(int item) {   if( tp == MAX - 1)   {     cout << "**__**__**__Stack Overflow__**__**__**" << endl;     return ;   }   tp = tp + 1;   M[tp] = item; } int pop() {   int item;   if( tp == -1)   {     cout << "**__**__**__Stack Underflow__**__**__**" << endl;     return -1;   }   item = M[tp];   tp = tp-1;   return item; } void show() {   int i;   if(tp == -1)   {     cout << "**__**__**__There is no Stack__**__**__**" << endl << endl;//Stack is empty.     return;   }   cout << endl ...

Design, Develop and Implement a Program in C for the following operations on Strings a. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP) b. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR with REP if PAT exists in STR. Report suitable messages in case PAT does not exist in STR Support the program with functions for each of the above operations. Don't use Built-in functions.

CODE IN C Language :- #include<stdio.h> #include<string.h> #include<stdlib.h> char strng[100], pt[100], rp[100]; int start = 0, patfound = 0; int lasts, lastp, lastr; void rplcptrn() {     int i, j;     lastr = strlen(rp)-2;       if(lastp != lastr)     {         printf("\n\tInvalid length of replace string");         exit(0);     }     else     {         i = start;         for(j=0; j<=lastr; j++)         {             strng[i] = rp[j];             i++;         }     }     return; } void fdptrn() {     int i, j, inmatch;     lasts = (strlen(strng))-2;     lastp = (strlen(pt))-2;     int endmatch;     for(...

Design a Program for the following operations on STACK of Integers (Array Implementation of Stack with maximum size MAX) a. Push an Element on to Stack b. Pop an Element from Stack c. Demonstrate how Stack can be used to check Palindrome d. Demonstrate Overflow and Underflow situations on Stack e. Display the status of Stack f. Exit Support the program with appropriate functions for each of the above operations

CODE in C++ language :- /** * * * @Author :- SMITPATEL */ #include"cstdlib" #include"iostream" #include"stack" using namespace std; const int MAX = 100; int tp = -1; int M[MAX]; void push(int item); int pop(); void palindrome(); void show();//display function void push(int item) { if( tp == MAX - 1) { cout << "**__**__**__Stack Overflow__**__**__**" << endl; return ; } tp = tp + 1; M[tp] = item; } int pop() { int item; if( tp == -1) { cout << "**__**__**__Stack Underflow__**__**__**" << endl; return -1; } item = M[tp]; tp = tp-1; return item; } void show() { int i; if(tp == -1) { cout << "**__**__**__There is no Stack__**__**__**" << endl << endl;//Stack is empty. return; } cout << endl <<"\tStack Element are : "<< endl; for( i=tp; i>=0; i--) { cout << ...

Total Pageviews