Mishal Shah mishal23

## l2fwd-l3fwd-lpm.lua
--
-- L2fwd, L3fwd-LPM test script
-- Send packets for x seconds; return how many packets has been sent.
--
-- Copyright (c) 2020 mishal23. All rights reserved.
--

package.path = package.path ..";?.lua;test/?.lua;app/?.lua;"

require "Pktgen";

## blockstack.txt
Verifying my Blockstack ID is secured with the address 1GiLy1W4nUxu74ds7bgFqA1bz3D3HvvbaS https://explorer.blockstack.org/address/1GiLy1W4nUxu74ds7bgFqA1bz3D3HvvbaS

## first.html
<!DOCTYPE html>
<html>
<head>
	<title>First</title>
</head>
<body>
<h1>My first Reop</h1>
</body>
</html>

## subarray-atleast-k-numbers.cpp
#include "bits/stdc++.h"

using namespace std;
int main()
{
	int n,i,k;
	cin>>n;
	vector<int> v;
	for(i=0;i<n;i++)
	{

## save-gotham.cpp
/*
	Problem:- Save Gotham!
	Link:- https://practice.geeksforgeeks.org/problems/save-gotham/0
	Author:- Mishal Shah
*/
#include "bits/stdc++.h"
#define MOD 1000000001
using namespace std;
int main()
{

## matrix-search.cpp
#include "bits/stdc++.h"
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,m,x,i,j;
		cin>>n>>m;

## .travis.yml
language: python

python:
  - 3.5

services: postgresql

env:
  - DJANGO=2.0.4
  - DB=postresql

## matrix-addition.cu
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <cuda.h>

#define row 10000
#define col 10000

int matrixA[row][col], matrixB[row][col], matrixC[row][col], matrixD[row][col];

## matrixMul.cu
/**
 * Copyright 1993-2015 NVIDIA Corporation.  All rights reserved.
 *
 * Please refer to the NVIDIA end user license agreement (EULA) associated
 * with this source code for terms and conditions that govern your use of
 * this software. Any use, reproduction, disclosure, or distribution of
 * this software and related documentation outside the terms of the EULA
 * is strictly prohibited.
 *
 */

## reverse stack using recursion.c
/*
	Program:- Reverse Stack using recursion
*/
#include "stdio.h"
#include "stdlib.h"
#include "string.h"
struct node{
	int data;
	struct node *next;
};
	--
	-- L2fwd, L3fwd-LPM test script
	-- Send packets for x seconds; return how many packets has been sent.
	--
	-- Copyright (c) 2020 mishal23. All rights reserved.
	--

	package.path = package.path ..";?.lua;test/?.lua;app/?.lua;"

	require "Pktgen";
	<!DOCTYPE html>
	<html>
	<head>
	<title>First</title>
	</head>
	<body>
	<h1>My first Reop</h1>
	</body>
	</html>
	#include "bits/stdc++.h"

	using namespace std;
	int main()
	{
	int n,i,k;
	cin>>n;
	vector<int> v;
	for(i=0;i<n;i++)
	{
	/*
	Problem:- Save Gotham!
	Link:- https://practice.geeksforgeeks.org/problems/save-gotham/0
	Author:- Mishal Shah
	*/
	#include "bits/stdc++.h"
	#define MOD 1000000001
	using namespace std;
	int main()
	{
	language: python

	python:
	- 3.5

	services: postgresql

	env:
	- DJANGO=2.0.4
	- DB=postresql
	#include <stdio.h>
	#include <stdlib.h>
	#include <time.h>
	#include <cuda.h>

	#define row 10000
	#define col 10000

	int matrixA[row][col], matrixB[row][col], matrixC[row][col], matrixD[row][col];
	/**
	* Copyright 1993-2015 NVIDIA Corporation. All rights reserved.
	*
	* Please refer to the NVIDIA end user license agreement (EULA) associated
	* with this source code for terms and conditions that govern your use of
	* this software. Any use, reproduction, disclosure, or distribution of
	* this software and related documentation outside the terms of the EULA
	* is strictly prohibited.
	*
	*/
	/*
	Program:- Reverse Stack using recursion
	*/
	#include "stdio.h"
	#include "stdlib.h"
	#include "string.h"
	struct node{
	int data;
	struct node *next;
	};