Aditya Patange AdiPat

## dummy-pdf.worker.js
/**
 * @licstart The following is the entire license notice for the
 * Javascript code in this page
 *
 * Copyright 2020 Mozilla Foundation
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *

## cc_fraud.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                AdiPat
                / cc_fraud.ipynb
            
            
              Last active
              April 8, 2019 09:31
            
              
                Credit Card Fraud Detection: Case study for Data Mining and Business Intelligence Course.
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## README.md

      
              19 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                AdiPat
                / README.md
            
            
              Last active
              November 6, 2016 16:51
            
              
                DSA practical question bank solutions.
              
          
    Arrays


Menu driven program to implement queue using array.
Menu driven program to implement stack using array.
Infix to postfix using stack
Evaluation of a postfix expression using stack.
Multiple stacks in one array

Linked Lists


## dbms_pracs_sample_1.sql

/* Drop old tables */

drop table works_on;
drop table project;
drop table employee;
drop table dept;

/* Create table */

## InfixToPostfix.c
/*
* @author: Aditya Patange
*
* Conversion of infix expression to postfix expression using stack.
* -All uppercase and lower case alphabets are treated as operands
* -Valid operators: -,+,/,*,^ in increasing order of precedence.
* -For now only round brackets are valid. Square and curly braces are invalid.
* Example: (A+B+(C+D)) is valid. {A+B+(C+D)} is invalid.
* -The following code simply converts a "valid" infix expression to a postfix expression
*  in order to check validity of an infix expression , an additional subroutine must be added.

## SinglyLinkedList.c
/*
* @author: Aditya Patange
*
* Singly Linked list implementation.
* In this implementation , I have not used "head" to store data,
* it simply points to the first node.
* If head is NULL , it means the list is invalid.
*
* All insertion and deletion subroutines return a success/failure flag
* to test the status of the operation.
	/**
	* @licstart The following is the entire license notice for the
	* Javascript code in this page
	*
	* Copyright 2020 Mozilla Foundation
	*
	* Licensed under the Apache License, Version 2.0 (the "License");
	* you may not use this file except in compliance with the License.
	* You may obtain a copy of the License at
	*

	/* Drop old tables */

	drop table works_on;
	drop table project;
	drop table employee;
	drop table dept;

	/* Create table */
	/*
	* @author: Aditya Patange
	*
	* Conversion of infix expression to postfix expression using stack.
	* -All uppercase and lower case alphabets are treated as operands
	* -Valid operators: -,+,/,*,^ in increasing order of precedence.
	* -For now only round brackets are valid. Square and curly braces are invalid.
	* Example: (A+B+(C+D)) is valid. {A+B+(C+D)} is invalid.
	* -The following code simply converts a "valid" infix expression to a postfix expression
	* in order to check validity of an infix expression , an additional subroutine must be added.
	/*
	* @author: Aditya Patange
	*
	* Singly Linked list implementation.
	* In this implementation , I have not used "head" to store data,
	* it simply points to the first node.
	* If head is NULL , it means the list is invalid.
	*
	* All insertion and deletion subroutines return a success/failure flag
	* to test the status of the operation.