sudikrt

sudikrt / node_recursive_dir_reader.js

Last active July 26, 2017 08:56

	function filewalker(dir, done) {
	let results = [];

	fs.readdir(dir, function (err, list) {
	if (err) return done(err);

	var pending = list.length;

	if (!pending) return done(null, results);

sudikrt / loki_find_example.js

Created August 2, 2017 13:12

loki js find ()

	app.post('/find', async (req, res) => {
	var lokiDbRef = new Loki(`${DB_PATH}/${DB_NAME}`, { persistenceMethod: 'fs' });
	var col = await loadCollection(COLLECTION_NAME, lokiDbRef);

	var result = col.find({ isActive: true });

	res.send({ 'success': true, 'data': result, 'length': col.find({ isActive: true }).length });
	})

sudikrt / print_section.html

Created August 2, 2017 18:08

HTML to print section CSS

	<html>
	<head>
	<style>
	@media print {
	body * {
	visibility: hidden;
	}
	#section-to-print, #section-to-print * {
	visibility: visible;
	}

sudikrt / NumberToWords.php

Created August 2, 2017 18:14

sudikrt / transitive_closer.c

Created August 4, 2017 18:20

	#include<stdio.h>
	#include<conio.h>
	main()
	{
	int a[10][10],b[10][10];
	int n,i,k,j;
	printf("Enter the number of vertices\n");
	scanf("%d",&n);
	printf("Enter the adjacency matrix\n");
	for(i=0;i<n;i++)

sudikrt / quest.doc

Created August 4, 2017 18:23

sudikrt / matrix.c

Created August 4, 2017 18:24

	#include<stdio.h>
	main()
	{
	int m,n,m1,n1,i,j,k,a[10][10],b[10][10],r[10][10];
	printf("\nEnter the first matrix row & coloumn size:");
	scanf("%d%d",&m,&n);
	printf("Enter the matrix element:");
	i=0;
	r1:if(i<m)
	{

sudikrt / fake_coin.c

Created August 4, 2017 18:25

	//http://polynomialtimes.com/algorithms/decrease-and-conquer/fake-coin-algorithm/
	#include<stdio.h>
	#include<conio.h>
	char a[10],c1[10],c2[10],c3[10];
	int w[10],n,i,m,sum1=0,sum2=0,sum3=0,tot,k,b[10],c[10],d[10],k1=0,k2=0,k3=0;
	void min(int f[],int k,char r[])
	{
	for( i=0;i<k-1;i++)
	{
	if(f[i]>f[i+1])

sudikrt / dfs.c

Created August 4, 2017 18:27

sudikrt / bfs.c

Created August 4, 2017 18:27