Websites that can be helpful for developers during work time

-

 https://imgur.com/     -     the image of the internet.

https://www.wallpaperflare.com/   - Best wallpapers free download.

Comments

Post a Comment

Please do not enter any spam link in the comment box.

Popular posts from this blog

MAKING POWERPOINT SLIDES

-
Making PowerPoint Slides Avoiding the Pitfalls of Bad Slides   Tips to be Covered    Outlines  Slide Structure  Fonts  Color  Background  Graphs  Spelling and Grammar  Conclusions  Questions   Outline    Make your 1 st or 2 nd slide an outline of your presentation – Ex: previous slide  Follow the order of your outline for the rest of the presentation  Only place main points on the outline slide – Ex: Use the titles of each slide as main points     Slide Structure – Good    Use 1-2 slides per minute of your presentation  Write in point form, not complete sentences  Include 4-5 points per slide  Avoid wordiness: use key words and phrases only     Slide Structure - Bad   This page contains too many words for a presentation slide. It is not written in point form, making it difficult both for your audience to read and for you to present each point. Although there are exactly the same number of points on this slide a...
Read more

AUTOMATA DEFINITIONS

-
 AUTOMATA DEFINITIONS THIS SUBJECT IS FULLY BASED ON EXAMPLES, DEFINITIONS, GRAMMAR RULES, DIAGRAMS AND THEOREMS. IMPORTANT DEFINITIONS:  DFA:    A Deterministic Finite State Automaton (DFSA) is denoted by M and it is a set of 5-tuples i.e. M=(Q, Σ, δ, q 0 , F) where, * Q is a non-empty finite set of states * Σ is a non-empty finite set of input symbols *  q 0 is the initial state or starting state. (q0 ∈ Q) * F is a non-empty finite set of final state. (F ⊆ Q). * δ (pronounce delta) is the transition function. Q x Σ → Q. δ(q,a) = p means, if  the automation is in state q and reading a symbol a, it goes to state p in the next instant, moving the pointer one cell to the right. NDFA:    A Non-Deterministic Finite State Automaton (NFSA) is denoted by M and it is a set of 5-tuples i.e. M=(Q, Σ, δ, q 0 , F) where, * Q is a non-empty finite set of states * Σ is a non-empty finite set ...
Read more

DMA IN MP

-
  What is DMA and Why it is used? Direct memory access (DMA) is a mode of data transfer between the memory and I/O devices. This happens without the involvement of the processor. We have two other methods of data transfer, programmed I/O and Interrupt driven I/O. Let’s revise each and get acknowledge with their drawbacks. In programmed I/O, the processor keeps on scanning whether any device is ready for data transfer. If an I/O device is ready, the processor fully dedicates itself in transferring the data between I/O and memory. It transfers data at a high rate, but it can’t get involved in any other activity during data transfer. This is the major drawback of programmed I/O. In Interrupt driven I/O, whenever the device is ready for data transfer, then it raises an interrupt to processor. Processor completes executing its ongoing instruction and saves its current state. It then switches to data transfer which causes a delay. Here, the processor doesn’t keep scanning for periphe...
Read more

Java Interview Questions

-
  Java Interview Questions 1. What are the differences between C++ and Java? C++ is not platform-independent; the principle behind C++ programming is “write once, compile anywhere.” In contrast, because the byte code generated by the Java compiler is platform-independent, it can run on any machine, Java programs are written once and run everywhere. ·         Languages Compatibility. C++ is a programming language that is based on the C programming language . Most other high-level languages are compatible with C++. Most of the languages of Java are incompatible. Java is comparable to those of C and C++. ·         Interaction with the library. It can access the native system libraries directly in C++. As a result, it’s better for programming at the system level. Java’s native libraries do not provide direct call support. You can use Java Native Interface or access the libraries. ·         Characteristics. C++ distinguishes it...
Read more

TONGUE TWISTER ENGLISH

-
  Tongue twisters are a great way to practice and improve pronunciation and fluency. They can also help to improve accents by using alliteration, which is the repetition of one sound. They’re not just for kids, but are also used by actors, politicians, and public speakers who want to sound clear when speaking. Below, you will find some of the most popular English tongue twisters. Say them as quickly as you can. If you can master them, you will be a much more confident speaker. Peter Piper picked a peck of pickled peppers A peck of pickled peppers Peter Piper picked If Peter Piper picked a peck of pickled peppers Where’s the peck of pickled peppers Peter Piper picked? Betty Botter bought some butter But she said the butter’s bitter If I put it in my batter, it will make my batter bitter But a bit of better butter will make my batter better So ‘twas better Betty Botter bought a bit of better butter How much wood would a woodchuck chuck if a woodchuck could chuck wood? He would ch...
Read more

WRITE A 8085 ASSEMBLY LANGUAGE PROGRAM TO DIVIDE TWO 8-BIT NUMBERS USING 8085 MICROPROCESSOR AND PERFORM THE OPERATION BETWEEN PREDEFINED LOCATION. 3:2

-
  THEORY :       In 8085 microprocessor, There is no division operation. To get the result of the division, we should use the repetitive subtraction method. By using this program, we will get the quotient and the reminder. Here we also can be store the carry value. Then store the value of that performed resultant value. ALGORITHM : Step 1: LXI H,2000h; to point source memory location, register pair H-L is initialized.Step 2: MOV A, M; to move the value of memory to the accumulator.Step 3: INX H; to increment the value by 1 for the H-L register pair.Step 4:  MOV B, M; to move the value of memory to the B register.Step 5: MVI C,00h; to load the value 00h in register C.Step 6: CMP B; to compare the value of the accumulator and the B register.Step 7: JC ; to jump on carry in step 11.Step 8: SUB B; to subtract the accumulator and B register value.Step 9: INR C; to increment the value of C register.Step 10: JMP; to jump on step 6 Step 11: INX H; to incre...
Read more

IMPORTANT INTERVIEW RELATED QUESTION

-
 IMPORTANT INTERVIEW RELATED QUESTION > DATABASE -> CASANDRA, MONGODB SHORT NOTES > DATABASE STRUCTURE & UNSTRUCTURED WORK SHORT NOTES > APPLICATION LEVEL OF OPERATING SYSTEM > ROUTER CONFIGURATION PROCESS > IPV4 AND IPV6 USE INSTEAD, CONFIGURATION PROCESS > NETWORK STORAGE WITH DATABASE STORAGE WORK > OBJECT ORIENTED PROGRAMMING CONCEPTS > PROJECT PLANNING IDEA > DEFINE DAY TO DAY WISE PLANNING > ISDN IN NETWORK > MBPS AND BANDWIDTH WORKING CONCEPT > HOW UPDATATION INVOLVES WITH POPULARITY  > GATEWAY TECHNIQUE WITH BASIC EXAMPLE  > FIREWALL TECHNIQUE WITH BASIC EXAMPLE  > WHAT IS LOCALITY OF REFERENCE    HTML CSS 1> WHAT IS INLINE ELEMENT AND BLOCK ELEMENT ? 2> DOES INLINE ELEMENT CONTAIN BLOCK ELEMENT ? 3> DOES BLOCK ELEMENT CONTAIN INLINE ELEMENT ? 4> WHAT IS THE EXCEPTION IN INLINE ELEMENT THAT CONTAIN BLOCK ELEMENT ? <A> 5>  
Read more

INTERVIEW QUS ON AUTOMATA

-
                                .  INTERVIEW QUS ON AUTOMATA 1 There are ________ tuples in the finite state machine.   a)4 b)5   c)6 d)Unlimited 2 Transition function maps.   a)Σ * Q → Σ b)Q * Q→Σ   c)Σ * Σ → Q d)Q * Σ → Q 3 Number of states required to accept string ends with 10.   a)3 b)2   c)1 d)Can’t be determined 4 δ*(q,ya) is equivalent to .   a)δ((q,y),a) b)δ(δ*(q,y),a)   c)δ(q,ya) d)independent from δ notation 5 An automaton that presents output based on previous state or current input is called   a)Acceptor b)Classifier   c)Transducer d)None of the mentioned 6 If NFA of 6 states excluding the initial state is converted into DFA, the maximum possible number of states for the DFA is   a)62 b)32   c)128 d)127 7 NFA, in its name has ’non-deterministic’ because of :   a)The result is undeterm...
Read more

Git Cheat Sheet: A Beginner to Intermediate Guide

-
Certainly! Below is a refined and comprehensive guide to Git, tailored for beginners and intermediate users. This guide includes the Git basics, common commands, and additional commands like renaming branches. This should serve as a helpful reference for anyone looking to understand or refresh their knowledge of Git.  Git Cheat Sheet: A Beginner to Intermediate Guide  What is Git? Git is a distributed version control system that allows you to track changes in your codebase, collaborate with others, and manage different versions of your project. Git helps developers work on projects collaboratively, maintain different versions of their work, and track changes over time.  Basic Git Lifecycle  1. Initialize a Git Repository - Command:   git init - Purpose: Initializes a new Git repository in the current directory, turning the directory into a repository that Git can manage. 2. Clone a Repository - Command:   git clone <repository_url> - Purpose: Creates ...
Read more