Skip to main content

Posts

PUBLIC KEY INFRASTRUCTURE

PUBLIC KEY INFRASTRUCTURE A public key infrastructure (PKI) supports the ·        Distribution and identification of public encryption keys ·        Enables users and computers to exchange data over networks   ·        Verify the identity of the other party ·        Enables people and businesses to utilize a number of secure Internet applications. For example, secure and legally binding emails and Internet based transactions, and services delivery can all be achieved through the use of PKI Key Elements of PKI:- A trusted party( certificate authority (CA) )- act as a root of trust and provides services that authenticate the identity of individuals, computers and other entities A registration authority (subordinate CA)- certified by a root CA to issue certificates for specific uses permitted by the ro...

ARRAY vs ARRAYLIST

ARRAY vs ARRAYLIST Array is an object used to save similar data type elements and its size is limited . Array is static in nature. Once created we cannot change size of array. ·        Random access, linear data structure ·        Fixed size once created ·        Can contain objects and primitives ·        Must declare element type ·        It is not a class ·        Elements accessible with index number Eg: int[] ar=new int[3]; //stores complete integer types Arraylist is a part of Collection Framework of util package to store different data type objects and it is growable . Arraylist is dynamic in nature. It can be re-size itself when needed depending upon capacity and load factor. ·        Random access, linear data structure · ...

DYNAMIC PROGRAMMING

Dynamic programming  (referred to as  DP  ) is a very powerful technique to solve a particular class of problems. It demands elegant formulation of the approach and simple thinking. The idea is very simple, If you have solved a problem with the given input, then save the result for future reference, so as to avoid solving the same problem again. If the given problem can be broken up into smaller sub-problems and these smaller sub-problems are in turn divided into smaller ones, and in this process, if you observe some over-lapping sub-problems, then its a big hint for DP. Also, the optimal solutions to the sub-problems contribute to the optimal solution of the given problem. There are two ways of doing this. 1.) Top-Down :  Start solving the given problem by breaking it down. If you see that the problem has been solved already, then just return the saved answer. If it has not been solved, solve it and save the answer. This is usually easy to think of...

Questions based on dynamic programming

Q.1 The owner of a chain of four grocery stores has purchased six crates of fresh strawberries.The estimated probability distribution of potential sales of the strawberries before spoilage differ among the four stores.The following table gives the estimated total expected profit at each store, when it is allocated various numbers of crates:                                                                     Store                                                                  1          2          3            4              ...

THE UNINVITED (Indian After Partition)

I never gave thought on how drastically people are changing. The only way I can see humanity being defined is CART FULL OF HUSK ­­­­ – dry, emotionless, and ignite into blazes by spark of information which can be fully or partially true or by one which has nothing to do with the truth. Last night’s event shook me from within. “Who bought her here?”-Shouted a women shrieking voice, enough to make people near-by go deaf. Pitch high enough to give complex to an Opera singer. “I am here to attend my best friend’s marriage. She invited me.” Said the girl in low defensive voice. By now, people gathered around the two. “Don’t you understand my daughter invited you out of courtesy? You yourself should not have come here. You have Lung Cancer and it is highly communicable, especially for those who breathe in same air.” I saw people covering their nose and stepping back muttering among themselves that how insensitive and careless she is towards other member of society. My glance fle...

Graphical Method to Solve a Linear Programming Problem

The graphical method is applicable to solve the LPP involving two decision variables x 1 , and x 2 , we usually take these decision variables as x, y instead of x 1 , x 2 . To solve an LPP, the graphical method includes two major steps: a)   The determination of the solution space that defines the feasible solution.  Note that the set of values of the variable x 1 , x 2 , x 3 ,....x n which satisfy all the constraints and also the non-negative conditions are called the feasible solutions of the LPP. b)   Finding the optimal solution from the feasible region. a)To determine the feasible solutions of an LPP, we have the following steps: Step 1: Consider only the first quadrant of xy-coordinate plane(because both the variables x 1 and x 2 are non-negative). Step 2: Each equation is of the form ax+by≤c or ax+by≥c. Draw the line ax+by=0. For each equation, the line divides the first quadrant into two region...