background preloader

A computer science portal for geeks

A computer science portal for geeks
Following questions have been asked in GATE CS 2014 exam. Read More » Read More » I attended Expedia interview for SDE-II role. Here are the questions on each round. Read More »

Related:  capetrel

SVG and CSS - Cascading Style Sheets It is possible to style your SVG shapes using CSS. By styling is meant to change the looks of the shapes. This can be stroke color and width, fill color, opacity and many other properties of your shapes. There are 6 ways to style the shapes in your SVG images.

Sorting Applications Sorting algorithms and priority queues are widely used in a broad variety of applications. Our purpose in this section is to briefly survey some of these applications. Sorting various types of data. Demo of a simple CRUD RESTful PHP service used with AngularJS and MySQL <?php require_once(""); class API extends REST {

What not to do during an interview Whenever you find yourself doing one of the following things during an interview, just don’t. OK? Don’t suck at something you say you’re an expert at Seriously, how often do I talk to Java experts who don’t know how to use the most basic java.util classes? Or bash experts who don’t know how to grep? Or 3D math experts who don’t know anything about the dot and cross products? Front-end Developer Handbook 2017 · GitBook Written by Cody Lindley sponsored by — Frontend Masters This is a guide that anyone could use to learn about the practice of front-end development. It broadly outlines and discusses the practice of front-end engineering: how to learn it and what tools are used when practicing it in 2017. It is specifically written with the intention of being a professional resource for potential and currently practicing front-end developers to equip themselves with learning materials and development tools. Secondarily, it can be used by managers, CTOs, instructors, and head hunters to gain insights into the practice of front-end development.

Lecture Slides for An Introduction to the Analysis of Algorithms These slides are for the first half of an undergraduate course taught at Princeton, developed to provide an overview of An Introduction to the Analysis of Algorithms and Analytic Combinatorics. The course format is "introduce-read-discuss". We introduce a set of topics in lecture; students read about the topics and work selected exercises between lectures, and we discuss any questions about the reading and the exercises at the beginning of the next lecture.

Introduction to Programming in Java: An Interdisciplinary Approach a textbook for a first course in computer sciencefor the next generationof scientists and engineers Textbook. Our textbooks Introduction to Programming in Java [Amazon · Pearson · InformIT ] and Computer Science [Amazon · Pearson · InformIT ] are an interdisciplinary approach to the traditional CS1 curriculum with Java. We teach the classic elements of programming, using an "objects-in-the-middle" approach that emphasizes data abstraction. We motivate each concept by examining its impact on specific applications, taken from fields ranging from materials science to genomics to astrophysics to internet commerce.

The Many Faces of Functions in JavaScript - - Bocoup If you’ve had any contact with JavaScript code, you’re probably very familiar with how to define and call functions, but are you aware of of how many different ways you can define a function? This is a common challenge of writing and maintaining tests in Test262—especially when a new feature comes into contact with any existing function syntax, or extends the function API. It is necessary to assert that new or proposed syntax and APIs are valid, against every existing variant in the language. Efficient binary tree traversal with two pointers without using a stack - debforit In this article, we will be discussing about space complexity optimized binary tree traversal techniques. Four modes of traversals are used quite often in a binary tree. They are pre-order walk, in-order walk, post-order walk and level first walk. Except the level first traversal, all the others are recursive and hence require a stack for traversal. We would talk here about in-order traversal.

Markov Chains – Explained Markov Chains is a probabilistic process, that relies on the current state to predict the next state. For Markov chains to be effective the current state has to be dependent on the previous state in some way; For instance, from experience we know that if it looks cloudy outside, the next state we expect is rain. We can also say that when the rain starts to subside into cloudiness, the next state will most likely be sunny. Not every process has the Markov Property, such as the Lottery, this weeks winning numbers have no dependence to the previous weeks winning numbers. Usually when we have data, we calculate the probability of a state by counting the amount of times it occurs within a total of all states, we then end up with 0.5(50%) cloudy, 0.3(30%) rain, 0.2(20%) Sunny days of a year; Containing no information about when they occur relating to each other. The Transition Matrix transitions from Row to Column as in the Markov Table.

The Big List Of Royalty Free Music And Sounds (Free Edition) The Big List Of Royalty Free Music And Sounds (Free Edition) A list of sites where you can download royalty free sounds and music. The first list shows those sites that offer free downloads. The second list shows those sites that offer paid downloads. Adnan Aziz Elements of Programming Interviews We're excited to release a free soft copy sampler of EPI. Specifically, this PDF shows the organization, content, style, topics, and quality of our book.