-
Say you want to download the binarySearch.py file through the terminal, just enter in the following command:
`wget https://raw.githubusercontent.com/kh4l1d/CL3-Codes/master/binarySearch.py` -
It's of the form:
`wget URL/file.txt` -
Although it is worth mentioning that repos should ideally be "git clone"-d like this: https://www.youtube.com/watch?v=oDUOWC4yib0
-
BE Sem1 CL1-Codes -> https://github.com/kh4l1d/CL1-Codes
-
TE Sem1 & Sem2 (Download link) -> https://www.dropbox.com/s/jlsz28bgrpkx7us/Khalid%27s%20Third%20Year.zip?dl=0
-
SE Sem1 & Sem2 (Download link) -> https://www.dropbox.com/s/158agkqibt2cgoh/Khalid%27s%20Second%20Year.zip?dl=0
-
Keep the files createXMLfile.py and quickSort.py in the same directory.
-
Simply run createXMLfile.py and you're done.
-
The syllabus vaguely mentions "encryption method overloading" - now I've searched online for this and found no results. I'm assuming this is a mis-print. However if you find a reasonable meaning to it (apart from function overloading), then please do notify me.
-
Python offers rich libraries (such as pycrypto) for a variety of encryption functions - but since here at SPPU we love re-inventing the wheel, the functions have been hard-coded.
-
Ideal PRNGs like https://en.wikipedia.org/wiki/Mersenne_Twister requires one to learn specific numbers & positions for it to be effective - just see the diagram in the wiki and you'll know what I mean. Thus, only simple PRNGs will be coded as and when encountered.
-
For the practical exam, if you get this code, you will have to probably club it with the SHA-1 code. Head to the SHA-1+PRNG directory. It's essentially the same code as SHA-1, the only difference being that the value of k (in SHA-1) is randomly generated for each session.
-
Steps for the SHA-1+PRNG code are simple. First create a blank file called "randomKeyForSession.txt" and then run "generateRandomKeyForSession.py". This will generate a random number and store it in the text file. Then normally run your server and client codes.
-
For this code to run, it's necessary to install a Python module called bitstring - which greatly simplifies tasks such as 2's complement. It can be installed by the following command :
`sudo pip install bitstring` -
If you don't have pip installed (it doesn't come bundled with some Python versions), install pip by the following commands :
`sudo apt-get install python-setuptools` `sudo easy_install pip`
-
For this code to run, it's necessary to install a Python module called flask - which is a micro web framework for Python. It can be installed by the following command :
`sudo pip install Flask` -
If you don't have pip installed (it doesn't come bundled with some Python versions), install pip by the following commands :
`sudo apt-get install python-setuptools` `sudo easy_install pip` -
Simply run plagiarismChecker.py and then open the browser at 127.0.0.1:5000
-
For this code to run, it's necessary to install a Python module called pymongo - which basically connects our MongoDB to our python code. It can be installed by the following command :
`sudo pip install pymongo` -
If you don't have pip installed (it doesn't come bundled with some Python versions), install pip by the following commands :
`sudo apt-get install python-setuptools` `sudo easy_install pip` -
MongoDB needs to be installed for this code to work. If the mongo shell doesn't open when you enter 'mongo' in the terminal, it's probably because the MongoDB daemon is not started. To resolve this, enter :
`sudo service mongod start`
- Both of these codes require a web application and as such Flask (a Python module has been used). To see the output on the browser at 127.0.0.1:5000 you HAVE to create a folder named "templates" and store the html files in it. Flask searches for html files to be rendered in a "templates" folder and if there isn't one, nothing would be displayed. `