Data Structure in C - HashMap

Posted on Nov. 10, 2017
data-structure-in-c-hashmap

​In this part of Data Structure in C tutorial series, I will explain what is HashMap and I will show you - how to write a HashMap from scratch in C. HashMap is a very important data structure and is often asked in interviews. Candidates are asked to explain and write complete HashMap code from scratch
Read More

Career paths for fresh Graduates

Posted on Nov. 10, 2017
career-paths-for-fresh-graduate

Many fresh graduates ask me how to proceed with their career, which technology to work on etc. Depending upon one's area of interest and expertise the answer may swing to many different directions. The competition now is insane compared to five years back. If you are not careful enough during the initial years, you may end up losing your precious time and energy in vain. In this article I will discuss different routes a fresh graduate can take to have a rewarding career.
Read More

Algorithms in C - Depth First Search

Posted on Nov. 10, 2017
algorithms-in-c-depth-first-search

In this part of Algorithms in C tutorial series, I will explain what is Depth First Search and I will show you - how to write a Depth First Search from scratch in C. Depth First Search is one of the very important Algorithms. Many programming problems are efficiently solved using Depth First Search or DFS. This is often asked in interviews.
Read More

How to get started with Giraph

Posted on Nov. 10, 2017
get-started-with-giraph

Giraph is powerful Big data processing distributed computing platform. Facebook extensively uses Giraph for their graph processing and Facebook engineers have heavily contributed to this open source project. It sits on top of Hadoop. Giraph works using message passing and it's installation is very easy. It's the exact same procedure that they explain in their site. However once we you are done with the setup and want to do your own customization, then it's a real pain as there is no good documentation available. You have to rely on the mailing list and go through many trials and errors. In this article I will explain with a detailed example how to do your own customization and safely ride the Giraph.
Read More

Theory of Computation - 8 (Primes are not Regular)

Posted on Nov. 10, 2017
theory-of-computation-8-primes-not-regular

In this Lecture I will prove that Language/Set of Strings where length of the string is a prime number is not Regular using the Pumping Lemma. We will then try to use the Pumping Lemma to prove that Language/Set of Strings where length of the string is a composite number is not Regular and we will see the limitation of the Pumping Lemma in doing so.
Read More

The impatient new Blogger in search of Organic Traffic

Posted on Nov. 10, 2017
new-blogger-organic-traffic-search

I have recently started a blog. Since the day I have started the blog, I am worried about traffic and wondering why the heck people are not coming to check out my awesome content. Every now and then like a soldier in alert, I peek into the Google Analytics live feed to check if some active user is there in my blog or not. I get impatient when I don't see any organic traffic flowing into my blog. I repeatedly search the web for best practices for SEO and how to get some back-links. After doing research and following some awesome articles, I have come to some conclusions on how a new blogger must NOT try to generate traffic for her blog and what are the good ways that will generate steady growing traffic to your blog.
Read More

Theory of Computation - 7 (Palindromes are not Regular)

Posted on Nov. 10, 2017
theory-of-computation-7-palindromes-not-regular

In this Lecture I will prove that Language/Set of Palindromes is not Regular using Pumping Lemma. Therefore, you cannot construct a DFA which accepts only Palindromes. I will first explain the proof informally taking concrete example and then we will see how to write formal proofs.
Read More

Theory of Computation - 5 (DFA closure properties)

Posted on Nov. 10, 2017
theory-of-computation-5-DFA-closure-properties

In the previous lecture I gave you a hint about closure properties of DFA or Deterministic Finite state machine. In this lecture, I will discuss the closure properties of DFA and towards the end I will leave you with the teaser of the famous Pumping Lemma. Let's get started.
Read More

Theory of Computation part -2 (FSM)

Posted on Nov. 10, 2017
theory-of-computation-2

This is the second lecture of the course Theory of Computation. In this lecture I will discuss some more examples of Finite state machines so that you become comfortable with it. Then we will dive into Non deterministic Finite State Machine (NFA) and we will see if it gives us any extra power. Let's get started.
Read More

Theory of Computation part -1 (FSM)

Posted on Nov. 10, 2017
theory-of-computation-1

​This is the most abstract course in computer science. Because of this course itself, we call computer science a science. This course is not going to teach you how to write a program for say. This course is about what we can compute and what we cannot. In this first lesson I will discuss how to build a Finite State Machine and concepts associated with it.
Read More

profile image

Kaushik Baruah


ABOUT

My name is Kaushik Baruah and I am the chief blogger on this Blog and here I like to share my experience as software engineer and research engineer with my online readers. I will try to focus on career planning, latest emerging technologies and tutorials on various computer science subjects. You can follow me on Twitter, Facebook and Google+

GET FREE UPDATES

POPULAR POSTS