AdiPat

# rest_client.py
import time
import uuid
import random
from typing import Any, Dict, Optional, Union

import requests
from requests import Response
from requests.exceptions import Timeout, ConnectionError

AdiPat

/**
 * @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
 *

AdiPat

AdiPat

Arrays

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

Linked Lists

AdiPat

/* Drop old tables */ 

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

/* Create table */ 

AdiPat

/*
* @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.

AdiPat

/*
* @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.