Quiz for DAA 

Click here to answer Quiz

 Updated PPT for BCS401 Contains refrence material for Module-1 to Module-5

Assignemnt 1 , 2 are available in blog

Assignment 3 Solve numericals and submit

 Assignment 1  Total Max Marks 15

Click here to view assignment

 Analysis and Design Of Algorithm BCS401 PPT -Click here to download

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:

Syllabus Covered and PPT DATA STRUCTURES AND APPLICATIONS (BCS304)

 Syllabus Covered 

Module-1 8Hours

INTRODUCTION TO DATA STRUCTURES: Data Structures, Classifications (Primitive & Non-Primitive), Data structure Operations Review of pointers and dynamic Memory Allocation, ARRAYS and STRUCTURES: Arrays, Dynamic Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, representation of Multidimensional Arrays, Strings STACKS: Stacks, Stacks Using Dynamic Arrays, Evaluation and conversion of Expressions 

Text Book: Chapter-1:1.2 Chapter-2: 2.1 to 2.7 Chapter-3: 3.1,3.2,3.6

Reference Book 1: 1.1 to 1.4

Module-2 8Hours

QUEUES: Queues, Circular Queues, Using Dynamic Arrays, Multiple Stacks and queues. LINKED LISTS : Singly Linked, Lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials

Text Book: Chapter-3: 3.3, 3.4, 3.7 Chapter-4: 4.1 to 4.4

Module 3 8Hours

LINKED LISTS : Additional List Operations, Sparse Matrices, Doubly Linked List. 

Power Pint Presentation 

If any discripancies are found write back to dhananjay@gndecb.ac.in