This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
"""Forked from here : https://github.com/yask123/ipu_result""" | |
import os | |
from urllib.request import urlopen | |
data ='' | |
link='' | |
print ('Running on feature 1 ') | |
for line in urlopen('http://www.du.ac.in/du/index.php?page=students-welfare'): | |
data = data+str(line) | |
run = True |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class node: | |
def __init__(self): | |
self.data = None | |
self.next = None | |
class linked_list: | |
def __init__(self): | |
self.current_node=None | |
def add_node(self,data): |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
execute pathogen#infect() | |
syntax enable | |
syntax on | |
filetype plugin indent on | |
set backspace=2 | |
set background=dark | |
let g:solarized_termtrans = 1 | |
let g:solarized_visibility = "high" | |
let g:solarized_contrast = "high" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Node: | |
def __init___(self,data=0,next=None): | |
self.data = data | |
self.next = next | |
class LinkedList: | |
def __init__(self): |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
graph = {'0': set(['1', '2']), | |
'1': set(['2']), | |
'2': set(['0', '3']), | |
'3': set(['3'])} | |
visited = {} | |
for each in graph: | |
visited [each]=False | |
queue = [] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
graph = { 'A':set(['B', 'C']), | |
'B': set(['A', 'D', 'E']), | |
'C': set(['A', 'F']), | |
'D': set(['B']), | |
'E': set(['B', 'F']), | |
'F': set(['C', 'E'])} | |
s= 'A' | |
visited = set() | |
stack = [s] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
graph = {'A': set(['B', 'C']), | |
'B': set(['A', 'D', 'E']), | |
'C': set(['A', 'F']), | |
'D': set(['B']), | |
'E': set(['B', 'F']), | |
'F': set(['C', 'E'])} | |
def dfs (graph,start,visited=None): | |
if visited is None: | |
visited=set() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# include <stdio.h> | |
int add(int a[][10],int b[][10],int n,int m,int r[10][10]) | |
{ | |
int i,j; | |
for(i=0;i<n;i++) | |
{ | |
for(j=0;j<m;j++) | |
{ | |
r[i][j]= a[i][j] + b[i][j]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# include <stdio.h> | |
double f(double x,double y) | |
{ | |
return (x+y); | |
} | |
int main() | |
{ | |
double h=0.2; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# include <stdio.h> | |
# include <math.h> | |
double f(double x) | |
{ | |
return ( exp(x*x) ); | |
} | |
int main() | |
{ | |
double l1=0; |