320 likes | 456 Views
THE SUMMER TRAINING PROJECT. By : Abdul Wahid. TRAINING ORGANIZATION. Software Technology Group (Int.) Ltd . Jodhpur centre. Well known as STG. DIRECTOR : Mr.P.S.Bhadu GUIDED BY: 1.Mr.Amit Rathore 2.Mrs.Sandya Harsh.
E N D
THE SUMMER TRAINING PROJECT By : Abdul Wahid
TRAINING ORGANIZATION Software Technology Group (Int.) Ltd. Jodhpur centre • Well known as STG • DIRECTOR : • Mr.P.S.Bhadu • GUIDED BY: • 1.Mr.Amit Rathore • 2.Mrs.Sandya Harsh
THE PROJECT NAME : AALEEF TASKS : 1.File compression/decompression 2.File encryption/decryption SCOPE : All types of files
WHY CODEC AND ENDEC Previous interests 2.Real world importance 3.Uncertainty about completion 4.Concurrent learning of java
TEAM ORGANIZATION • Single person project • Project manager to Tester – Abdul Wahid
GOALS TO BE ACHIEVED • Implementation of object oriented concept • Easiest help & user interface • Reusability & future extensibility • Other general facilities to user
PROJECT PLAN • TITLE- AALEEF • SCOPE-All types of files • SWDLC : Component based model • MODULES : 1.Endec 2.Codec 3.Help
REQUIREMENT ANALYSIS A. Functional Requirements 1.Overall Requirements(Services) 2.Functional Requirement of GUI B. Non functional Requirements
SYSTEM ANALYSIS ALGORITHM DESIGNING : CODEC: STANDARD CANONICAL HUFFMAN ENDEC: SELF DEVELOPED
: SYMBOL PROB a 0.4 b 0.3 f2 0.3 SYMBOL PROB a 0.4 SYMBOL PROB b 0.3 a 0.4 f1 0.2 c 0.1 b 0.3 c 0.1 d 0.1 e 0.1 ALGORITHM DESIGNING HUFFMAN COMPRESSION : 1 2
: SYMBOL PROB f3 0.6 a 0.4 SYMBOL PROB f4 1.0 ALGORITHM DESIGNING THE HUFFMAN TREE : 0 1 0 1 0 1 0 1 3 4
ALGORITHM DESIGNING THE CODES : Codes Length a=0 1 b=11 2 c=100 3 d=1010 4 e=1011 4 Bits required in huffman coding=14 Bits required in fixed length coding=15
ALGORITHM DESIGNING MESSAGE ENCODING & DECODING : Original message b e a b d a c Fixed length encoding 001 100 000 001 011 000 010 Huffman encoding 11 1011 0 11 1010 0 100 0 1 0 1 0 1 0 1
THE CANONICAL HUFFMAN STEPS FOR BASE CODES : Symbol Length a 1 b 2 c 3 d 4 e 4 Repet from i=max code length to 1 Code=Code+Number of last codes Code>>1; Start_code[i]=Code Number of= no.of codes in last codes current length Symbol BaseCode d 0000 c 001 b 01 a 1
THE CANONICAL HUFFMAN STEPS FOR ACTUAL CODES : Symbol BaseCode d 0000 c 001 b 01 a 1 Symbol Code a 1 b 01 c 001 d 0000 e 0001 1.Sort list in symbolic order 2.Increment last code and assign codes
ALGORITHM DESIGNING THE ENCRYPTION ALGORITHM : 1.Read password and calculate len= password length. 2.Write len and password to destination file. 3.Read bytes from source file and to destination file write : byte=byte value-(password length+2)
ALGORITHM DESIGNING THE DECRYPTION ALGORITHM : After matching the entered password with the password in file 1.Read bytes from source file and to destination file write : byte=byte value+(password length+2)
THE DFD’s Level zero(0) DFD :
THE DFD’s LEVEL ONE(1) DFD FOR Codec :
THE DFD’s LEVEL TWO(2) DFD FOR Codec : Compress
THE DFD’s LEVEL TWO(2) DFD FOR CODEC :Decompress
THE DFD’s LEVEL ONE(1) DFD FOR Endec
THE DFD’s LEVEL TWO(2) DFD FOR ENDEC : Encrypt
THE DFD’s LEVEL TWO(2) DFD FOR ENDEC : Decrypt
SYSTEM DESIGN User’s responsibility: Familiarity with working with files. Validations: 1.Software must dynamically interact with user. 2.User friendly message should be shown if required. 3.Level of compression/encryption should be shown by extensions. 4.Facility for showing password should be given. Interface design: Background colour:gray Window’s W/H ratio:3:2 Window’s size:600:400 pixels
SYSTEM DESIGN INTERFACE DESIGN : Main screen:
SYSTEM DESIGN INTERFACE DESIGN : When “Codec” pressed:
SYSTEM DESIGN INTERFACE DESIGN : When “Endec” pressed:
CONCLUSION • PRESENT VERSION OF AALEEF • FUTURE PLANS • TRAINING EXPERIENCE
? QUERIES