Skip to content
Gblog 100 Days of Code – A Complete Guide For Beginners and Experienced
Do you want to become a successful software developer and dreaming about getting into the big tech companies? Are you someone who is already working… Read More
Online Round: There were 20 MCQs based on basic programming, C output questions, OS. There were 2 programming questions. 1. Given an array with only… Read More
Given a string s, partition s such that every string of the partition is a palindrome. Return all possible palindrome partitioning of s.  Example : … Read More
Below was my experience with Snapdeal SDET Bangalore Location. Round-1: Telephonic Interview -Skype —————————————————- Basic questions on Java (Since it was mentioned in my resume).… Read More
The SequenceInputStream class allows you to concatenate multiple InputStreams. It reads data of streams one by one. It starts out with an ordered collection of… Read More
In any 2-Dimensional plane, if we connect two points (x0, y0) and (x1, y1), we get a line segment. But in the case of computer… Read More
It was a very good experience to face interview at Qualcomm (Hyderabad-2016) I have attended the interview for a position of Software Engineer and My… Read More
Java.io.StreamTokenizer class parses input stream into “tokens”.It allows to read one token at a time. Stream Tokenizer can recognize numbers, quoted strings, and various comment… Read More
Suppose M1 and M2 are two TM’s such that L(M1) = L(M2). Then (A) On every input on which M1 doesn’t halt, M2 doesn’t halt… Read More
Let, init (L) = {set of all prefixes of L}, Let L = {w | w has equal number of 0’s and 1’s} init (L)… Read More
Consider 2 scenarios: C1: For DFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* C2: For NFA (ϕ, Ʃ, δ,… Read More
A packet addressed to 128.48.64.0 came to a router having routing table as follows. Which interface will it be forwarded to ? (A) A (B)… Read More
Consider an array consisting of –ve and +ve numbers. What would be the worst case time complexity of an algorithm to segregate the numbers having… Read More
You are given an array A[] having n random bits and a function OR(i,j) which will take two indexes from an array as parameters and… Read More
Consider a graph where all edge weights are positive. We have computed shortest path using Dijkstra’s shortest path algorithm and total weight of shortest path… Read More
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of… Read More

Start Your Coding Journey Now!