DSA-BCS304-PPT

 

INTRODUCTION TO DATA STRUCTURES 
ARRAYS and STRUCTURES: STACKS:
QUEUES  LINKED LISTS  Additional List Operations

TREES:GRAPHS:

HASHING: PRIORITY QUEUES: INTRODUCTION TO EFFICIENT BINARY SEARCH TREES:

Written Assignment

 Please solve all queations for QP available in Below Link

If question is repeated concider it as void

Question paper Link

Assignment -Project Cipher Text

This cipher encrypts and decrypts a sequence of characters by dividing the sequence into blocks of size n, where n is specified by the encryption key. If the input text has a length that is not a multiple of input text has a length that is not a multiple of n, the last block is padded with null characters ('\0'). In addition to In addition to n, the key also specifies two parameters a and b. For each block, the i-th output character, starting from 0 as usual, is set to the j-th input character, where j = (ai + b) mod n. For appropriate choices of a and b, this will reorder the characters in the block in a way that can be reversed by choosing a corresponding decryption key (n, a′, b′).

 

For example, if n = 3, a = 2, and b = 3, the string Hello, world! would be encrypted like this: