Showing posts with label FAQ. Show all posts
Showing posts with label FAQ. Show all posts

Friday, 16 August 2013

Google's feature: How to Set Timer in Google?

Google features a cool feature call set timer. pretty much same as our cell phone, or stopwatch offers.

diagram:



 try it ->
  • go to Google
  • write " set timer N minute" [ N= number of time u wish to set ]
  • hit "ENTER"
or just click here


Saturday, 27 July 2013

what is Binary Search Tree (BST) in Data Structure?

binary search tree (BST):
a node-based data structure, which at most can have two child nodes counting from the left child. also known as Ordered or Sorted Binary Search Tree.

properties:
  • each child must be either a leaf node or the root of another binary search sub tree.
  • left sub-tree can contain only nodes, whom are less than the parent node.
  • right sub-tree can contain only nodes, whom are greater than the parent node
  • non of the nodes can be alike.
diagram:

specialties:
  • basis for many of highly efficient sorting and searching algorithms
  • can be used to construct abstract data structures including sets, multi-sets, associative arrays etc.



Friday, 5 July 2013

how to access Google USA [ some might call it Original Google Head Office's server ] from any other country?

this question has been bugging me for a long time, i think i should share the best way to fix it with everyone.

for this you can change 'preference' form your Google account or can do many of hubble bubble stupid 'setting' stuffs.

OR

you can just use www.google.com/ncr to get access the USA Google server network (or you may call it the main Google server).

thank you :)




Wednesday, 26 June 2013

what is Stack and Queue? [ simplest yet every detail]

Stack:
a list of elements where insertion (push) or deletion (pop) is and can only be done at one same end.
the bookish name of it is LIFO. stands for Last In First Out.

special terminology:

  1. push: to insert any element into the stack.
  2. pop  ; to delete any element from the stack.

example:
its like a cookie jar. Top most cookie in the jar is only accessible.

application:
the whole "UNDO" concept or the thing we do by pressing CTRL+ Z is done by stack, or like in Maze puzzles.



Queue;
linear list of elements where insertion (rear)  and deletion (front) can only be done by different ends.
bookish name of it is FIFO, stands for First In First Out. queue has head and tail.

special terminology:

  1. enqueue (rear) : to operate insertion operation.
  2. dequeue (front): to operate deletion operation.

example:
like people waiting in a line for movie tickets, new ( or last) person will stand at the end of the line every time. or like a fancy restaurant where i can enter and get out using 2 different way, and can't mess it up :P .

application:
like in BFS( breadth first search) or DFS( deapth first search).

Tuesday, 25 June 2013

what is Doubly and Circular linked list? [ simple explanation ]

doubly linked list:
linked list containing nodes that carries two pointer one (left side one) for the previous node and the other for (right side one) the next node. so Doubly liked list's node carries 3 field.
  1. link to point the previous node
  2. integer value carrying field 
  3. link to point the next node.
this picture might help to understand :






circular linked list:
in short, linked list of which 1st node's link is stored in the link part of the last node.


little help with a diagram:


heads up:
non circular is mostly known as acyclic 

what is two-dimensional [ 2D ] and three dimensional [ 3D ] array [and subscript] ?

in short that array where elements are referenced by respectively by Two and Three subscripts.


*subscript:
in basic programming language, subscript is like a linear array inside a non-linear array.




Saturday, 22 June 2013

How to calculate log base 2 using a scientific calculator?

Our scientific calculator actually has 2 buttons are for Logarithm calculation, [see the photo]

1. "log" button: is to calculate log base 10 (known as Common Logarithm)
2. "ln" button: is to calculate log base e (known as Natural Logarithm)



Now to calculate log base 2, you can use any of these two, just that you will need to convert it into base 2.

You can do this by dividing your result by the "log" or "ln" of base 2. 

Let me give an example for each case.

Example:
If you to calculate log(x) base 2, then calculate log(x) base 10 then divide it by log2.
Or,
to calculate ln(x) base 2, do it with base 10 then divide it by ln2.

Calculation example:
log8 base 2 is 3. using calculator is should be log8 base 10 / log2.


Thank you :)
by Hasin Arefin Khan