Job Sequencing with DeadlineWe are given a set of n jobs. Associated with each job I, di>=0 is an integer deadline and pi>=O is profit. For any job...
2019
Huffman codingHuffman coding is an algorithm for the lossless compression of files based on the frequency of occurrence of a symbol in the file that is...
Fractional Knapsack Problem Statement: A thief has a bag or knapsack that can contain maximum weight W of his loot. There are n items and the weight...
CLIENT SERVER ARCHITECTURE Client/server architecture is a computing model in which the server hosts, delivers and manages most of the...
Dynamic Programming: Dynamic Programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems,...
Max and Min FindingHere our problem is to find the minimum and maximum items in a set of n elements. We will see two methods here first one is iterative...
Heap Sort A heap is a nearly complete binary tree with the following two properties:Structural property: all levels are full, except possibly the...
HeapA heap is a complete tree with an ordering-relation R holding between each node and its descendant. Note that the complete tree here means tree can...
Tree Data StructuresTree is a collection of nodes. If the collection is empty the tree is empty otherwise it contains a distinct node called root (r)...
![C Program For Caesar Cipher [Encryption & Decryption] | C Programming](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjMWDSyhlAGQpRSM3FQvevUZQRm_Ol0xsv80NIAAFFYnIKGmMJWmT96-aOfXPlbDXnwtnc8H9EWa-_zJEzfKep29BVltBY9gTbeHzPRCDW8o-clleCt46vzhPDK-ijWRyiS0A-dmz9pCW_M/w410-h200-c/Edit.jpg)
Caesar CipherThe Caesar cipher is one of the earliest known and simplest ciphers. It is a type of substitution cipher in which each letter in the plaintext...
Chi-Square Test• Formalizes this notion of distribution fit– Oi represents...
Subscribe to:
Posts (Atom)