Grid Computing

 








Comments

Post a Comment

Popular posts from this blog

Types of Addressing modes

Image
  Implied / Implicit Addressing Mode Stack Addressing Mode Immediate Addressing Mode Direct Addressing Mode Indirect Addressing Mode Register Direct Addressing Mode Register Indirect Addressing Mode Relative Addressing Mode Indexed Addressing Mode Base Register Addressing Mode Auto-Increment Addressing Mode Auto-Decrement Addressing Mode 1. Implied Addressing Mode-   In this addressing mode, The definition of the instruction itself specify the operands implicitly. It is also called as  implicit addressing mode .   Examples-   The instruction “Complement Accumulator” is an implied mode instruction. In a stack organized computer, Zero Address Instructions are implied mode instructions. (since operands are always implied to be present on the top of the stack)   2. Stack Addressing Mode-   In this addressing mode, The operand is contained at the top of the stack.   Example-   ADD This instruction simply pops out two symbols contained at the top o...
Read more

Tokens in C

  Character Set of C The C Character Set Character set is set of valid characters that a language can recognise. A character represents any letter, digit, or any other sign that can be used in a program. C ategory Character Set Lowercase & Uppercase Letters a-z, A to Z Digits 0-9 Special Characters ,.;:`?!&^*-+<>()|\~-$?[]()%#=@ White Spaces Tab, space, newline Tokens In C A token is the smallest element of a program that is meaningful to the compiler. Tokens can be classified as follows: Keywords Identifiers Constants Strings Special Symbols Operators Keyword Keywords are pre-defined or reserved words in a programming language. Each keyword is meant to perform a specific function in a program. Since keywords are referred names for a compiler, they can’t be used as variable names because by doing so, we are trying to assign a new meaning to the keyword which is not allowed. You cannot redefine keywords. C language supports 32 keywords which are given below: auto else ...
Read more

Queue - Data Structures

Image
  Queue is the data structure that is similar to the queue in the real world. A queue is a data structure in which whatever comes first will go out first, and it follows the FIFO (First-In-First-Out) policy. Queue can also be defined as the list or collection in which the insertion is done from one end known as the   rear end   or the   tail   of the queue, whereas the deletion is done from another end known as the   front end   or the   head   of the queue. The real-world example of a queue is the ticket queue outside a cinema hall, where the person who enters first in the queue gets the ticket first, and the last person enters in the queue gets the ticket at last. Similar approach is followed in the queue in data structure. Now, let's move towards the types of queue. Types of Queue There are four different types of queue that are listed as follows - Simple Queue or Linear Queue Circular Queue Priority Queue Double Ended Queue (or Deque) Let...
Read more