I hereby claim:
- I am k4rtik on github.
- I am k4rtik (https://keybase.io/k4rtik) on keybase.
- I have a public key whose fingerprint is E53F 7004 EAA7 3D1F 33CF 35AB 8868 ADA4 B129 C858
To claim this, I am signing this object:
#include <iostream> | |
using namespace std; | |
class DB; | |
class DM | |
{ | |
int metres; | |
int cms; | |
public: |
#!/bin/bash | |
sensors | |
aticonfig --odgt | |
answer="N" | |
if [ "$(whoami)" != "root" ]; then | |
echo -ne "\n\nDo you want to know hard disk temperature (requires sudo)? (y/N) " | |
read answer | |
if [ "$answer" == "y" ]; then |
" URL: http://vim.wikia.com/wiki/Example_vimrc | |
" Authors: http://vim.wikia.com/wiki/Vim_on_Freenode | |
" Description: A minimal, but feature rich, example .vimrc. If you are a | |
" newbie, basing your first .vimrc on this file is a good choice. | |
" If you're a more advanced user, building your own .vimrc based | |
" on this file is still a good idea. | |
"------------------------------------------------------------ | |
" Features {{{1 | |
" |
// Program to find the max sum in a subsequence in an array of numbers. | |
// | |
// Adapted from the linear time scanning algorithm described by Jon Bentley in | |
// his famouos collection of programming columns - Programming Pearls. | |
// | |
// Author: Kartik Singhal | |
// Date: October 1, 2012 | |
#include <stdio.h> |
// Program to find the max sum in a subsequence in an array of numbers. | |
// | |
// Adapted from the O(n lg n) algorithm described by Jon Bentley in his famouos | |
// collection of programming columns - Programming Pearls. | |
// | |
// Author: Kartik Singhal | |
// Date: October 1, 2012 | |
#include <stdio.h> |
#!/usr/bin/python | |
# Assume there is a 50 storey building and it has 4 lifts. You have to write a | |
# scheduler program for the lifts. All the 4 lifts will be controlled by | |
# single program and Waiting time for peoples waiting for lift should be | |
# minimum. | |
# | |
# Using the Nearest Car approach described at http://www.quora.com/Is-there-any-public-elevator-scheduling-algorithm-standard | |
# | |
# Some assumptions include direction of lift at top floor will always be down, | |
# and on ground floor it will be up. More assumptions obvious from the code. |
#!/bin/bash | |
echo Checking if required packages are installed... | |
rpm -q qemu-kvm python-virtinst libvirt | grep not | |
echo Done. | |
echo | |
echo Loaded kvm kernel modules: | |
lsmod | grep kvm_intel |
#!/usr/bin/env python | |
import os | |
import sys | |
import commands | |
status, domains = commands.getstatusoutput("virsh list | grep running | cut -f7 -d' '") | |
domains = domains.rsplit('\n') |
VERSION BUILD=6011206 RECORDER=CR | |
URL GOTO=http://a.drupal.website/admin/content/node | |
'REFRESH | |
WAIT SECONDS=1 | |
TAG POS=1 TYPE=INPUT:CHECKBOX FORM=ID:node-admin-content ATTR=* CONTENT=YES | |
TAG POS=1 TYPE=SELECT FORM=ID:node-admin-content ATTR=ID:edit-operation CONTENT=%delete | |
SET !TIMEOUT 2 | |
SET !ERRORIGNORE YES | |
TAG POS=1 TYPE=INPUT:SUBMIT FORM=ID:node-admin-content ATTR=ID:edit-submit-1 | |
TAG POS=1 TYPE=INPUT:SUBMIT FORM=ID:node-admin-content ATTR=ID:edit-submit |
I hereby claim:
To claim this, I am signing this object: