Skip to main content

Posts

The End Is near: January 19, 2038 3:14:07 GMT

  Year 2038 problem The Year 2038 problem is an issue for computing and data storage situations in which time values are stored or calculated as a signed 32-bit integer, and the number is interpreted as the number of seconds since 00:00:00 UTC on 1 January 1970 (the epoch). Systems working on 32-bit cannot encode times after 03:14:07 UTC on 19 January 2038, analogous to the Y2K problem , in which 2-digit values representing the number of years since 1900 could not encode the year 2000 or later. Most 32-bit Unix like systems store and manipulate time in this Unix time format, so the year 2038 problem is sometimes referred to as the  Unix Millennium  Bug by association. What is Unix time? The  Unix epoch   time  is the number of seconds that have elapsed since January 1, 1970 (midnight UTC/GMT), not counting leap seconds . Literally speaking the epoch is Unix time 0 (midnight 1/1/1970), but ‘epoch’ is often used as a synonym for ‘Unix time’. Many Unix systems...

Web Development the Beginning…

  As I mentioned in my latest gift(blog) that  web-development  can be done with the help of many tools such as, 1)  Node.js – open source, runtime environment for developing Web apps 2) AngularJs  — structural framework for dynamic Web apps 3)  Brackets  — a modern, open source text editor 4) Bootstrap  — Javascript framework for developing responsive Web apps 5) LESS  — the dynamic stylesheet language 6) Atom  — a text editor 7) Notepad ++  — a text editor To develop any web application, the things required are, 1) Code Editor  (Text Editor) 2) OS  (Operating System) and 3) Language  (in which we are coding) There are many  web-development   languages  but, the most  popular , easy to  code  and  dynamic  are , 1) HTML (Hypertext Markup Language) 2) CSS (Cascading Style Sheets) 3) XML (EXtensible Markup Language) 4) PHP (Hypertext Preprocessor) 5) SQL (Structured Query Languag...

Can We Play Games On Linux Distros??

Probably,Everyone thinks that open source is not for gaming and we cannot play games on open source.Now the above statement is absolutely not true,We can actually play games on open source linux distros.There are certain utilities which you need to play games on Linux. I am going to discuss about how we can play games on Linux.Games which are playable on Windows can be played on Linux. First,You need a utility called Wine which is a open source software made to run .exe files on Linux. For example, You can easily install wine on Ubuntu by simply using the apt-get installer of Ubuntu as follows: sudo apt-get install wine This will install wine on your Ubuntu system which will let you run the .exe files of windows directly on your Ubuntu. You can directly right click on an .exe file and choose to run with wine option to run that file. In this way you can play games directly on your Linux Distros. Simple N Fast As you can see I am playing the game called “I Am Alive” on Ubuntu Now,The the...

Deep Web

  We all use google website daily even though we don’t live without google.If I says that it’s just 1 to 2% of overall internet.We all know that there are different site available on google and we can access it.It just 4% of Internet. 96% of internet is working on deep web. The 4% of Internet that we usually work on it is known as surface net whereas 96% of net is known as deep web.It very risky to use deep web without any guidance go in deep web with an security and some expert person. To go in deep web you should have an tor browser . Firstly it is made by an United States Naval Research Laboratory .They use it to transfer data with highly secure no one should catch it.Basically tor browser is used to mask your ip and also send request to the server by travelling through pc to pc so it is very difficult to track those people who is sending the request. When you are in deep web don’t ever to give any mail or account deal on any website .You can do anything on deep web anonymously ...

Need of Open Source ?

You have already got what is  Open Source  from previous blogs. The simple reason is that why to pay if we get is free. Lets take an example you spend lots of money to buy an windows genuine some of the people don’t buy the licence copy of it but they buy an creak (DOS) version of windows but they have some problem in it. Some what same not a completely different OS are freely available in market then why should we pay for it ? You get high quality of software and hardware also in open source. They are very powerful and smooth running no lags get while working.They also give full support to solve your problem.Think an example of google you search on google and you get the result of what you search if google say that I want money for every search results then ?you will pay for it ? That the need of  open source .

Dynamic Programming optimizations for fibonacci series

  the sum of preceding two number. for example, f(n) = { 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , ……………..} mathematical function: f(n) = f(n-1) + f(n-2) , where n>=2 and f(0) = 0 , f(1) = 1 Sample program: /* simple recursive program for Fibonacci series */ int fibonacci(int n) { if (n<=1) return n; return fibonacci(n-1)+fibonacci(n-2); } Overlapping problem: In the above tree diagram we can see (for underlined subtrees) that the left subtree of fib(5) and right subtree of fib(4) are repeated likewise other subtrees are also repeated , to avoid this we use dynamic programming (here Memoization technique particularly). Optimized function code to reduce time complexity: int fibonacci(int n) { if (table [n] == -1) { if (n<=1) table [n] = n; else table [n] = fibonacci(n-1)+fibonacci(n-2); } return table [n]; } In above problem we created a lookup table to save values which are calculated first and use them again if required rather than recalculating it, it will reduce m...

What is Dynamic Programming ?

  What actually dynamic programming is ? In computer science or mathematics,  dynamic programming  is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions. Also known as  dynamic   optimization . Dynamic programming is similar to divide and conquer only difference is that dynamic programming is used when there is overlapping subproblem property and in divide and conquer there is no overlapping subproblem property. example, fibonacci series. When to use dynamic programming ? Following two attributes suggests that a problem can be solved using  dynamic programming  : optimal substructure overlapping sub-problems. Ways to of using dynamic programming : Top-Down :  Firstly, Start solving the given problem by breaking it down. If you see that the problem has been solved already, then just return the saved answer. If it has not been s...