Posts

Showing posts from December 8, 2019

Top 10 Programming Language to learn in 2023

Are you a programming enthusiast looking to stay ahead of the curve in 2023? With the ever-evolving tech landscape, keeping up with the Best Programming Language to learn can be a daunting task. Fear not, as we have compiled a list of the top 10 Programming Languages that you should consider learning in 2023. Python: This versatile language continues to dominate in 2023, with its ease of use, readability, and a vast library of modules. JavaScript: As web development grows increasingly popular, JavaScript remains a crucial player, with its ability to create dynamic and interactive web pages. Java: This language has stood the test of time and remains a popular choice for enterprise software development. C++: A staple in the gaming and systems development industries, C++ offers exceptional performance and memory management. Swift: Apple's preferred language for iOS app development, Swift continues to grow in popularity with its simplicity and reliability. R: As data science and machin...
Post a Comment
Read more

Implementation Of Mono Alphabetic Cipher Encryption-Decryption

Image
Mono Alphabetic Cipher Encryption-Decryption Introduction It is Better than Caesar Cipher. If, instead the “cipher” line can be any permutation of the key 26 alphabetic characters, then there are 26! Or greater than 4 * 10 26  possible keys. This is 10 orders of magnitude greater than the key space for DES and would seem to as a Mono-alphabetic substitution cipher, because a single cipher alphabet is used per message. There is however, another line of attack. If one analytically knows the nature of the plain text, then the analyst can exploit the regularities of the language. Limitations Monoalphabetic ciphers are easy to break because they reflect the frequency data of the original alphabet. A countermeasure is to provide multiple substitutes, known as homophones, for a single letter C Progrm to Encryp the imputed text using Mono Alphabetic Cipher. #include <stdio.h> #include <string.h> int main () {     char pt [ 52 ] = { 'A' , 'B' , 'C' , ...
Post a Comment
Read more

Recurrences And Their Solution Methods Continue

Image
Recurrences And Their Solution Methods Recursion Tree Just Simplification of Iteration method: Consider The Recurrences Second Example Example Three Master Method Cookbook solution for some recurrences of the form T(n) = a . T(n/b) + f(n) where a>=1, b>1, f(n) asymptotically positive Describe its cases 
Post a Comment
Read more

Recurrences And Their Solution Methods

Image
Recurrences Recursive algorithms are described by using recurrence relations. A recurrence is an inequality that describes a problem in terms of itself. For Example: Recursive algorithm for finding factorial   T(n)=1     when n =1 T(n)=T(n-1) + O(1)    when  n>1 Recursive algorithm for finding Nth Fibonacci number T(1)=1     when n=1 T(2)=1     when n=2 T(n)=T(n-1) + T(n-2) +O(1)     when n>2 Recursive algorithm for binary search T(1)=1     when n=1 T(n)=T(n/2) + O(1)    when n>1 Techniques for Solving Recurrences We’ll use four techniques: Iteration method Recursion Tree Substitution Master Method   – for divide & conquer Characteristic Equation   – for linear Iteration method Expand the relation so that summation independent on n is obtained. Bound the summation e.g.    T(n)= 2T(n/2) +1  when n>1 T(n)= 1  ...
Post a Comment
Read more

C Program To Check The String Is Valid Identifier Or Not | C Programming

Image
C Program To Check The String Is Valid Identifier Or Not #include <stdio.h> #include <conio.h> #include <string.h> int main () { char string [ 25 ]; int count= 0 ,flag; printf ( "Enter any string: " ); gets (string); if ( ( string [ 0 ]>= 'a' && string [ 0 ]<= 'z' )||( string [ 0 ]>= 'A' && string [ 0 ]<= 'Z' )||( string [ 0 ]== '_' )) {     for ( int i= 1 ;i<= strlen (string);i++)     {         if (( string [i]>= 'a' && string [i]<= 'z' )||( string [i]>= 'A' && string [i]<= 'Z' )||( string [i]>= '0' && string [i]<= '9' )||( string [i]== '-' ))     {     count++;     }        }     if (count== strlen (string))     {       flag= 0 ;     } } else {     flag= 1 ; } if (flag== 1 )     printf ( " %s is not valid identifier" ,string); else ...
Post a Comment
Read more

Popular posts from this blog

Array in C Programming | C Programming

Image
Array in C Array in C Programming The C language provides a capability that enables the user to define a set of ordered data items known as an array. Suppose we had a set of grades that we wished to read into the computer and suppose we wished to perform some operations on these grades, we will quickly realize that we cannot perform such an operation until each and every grade has been entered since it would be quite a tedious task to declare each and every student grade as a variable especially since there may be a very large number. In C we can define a variable called grade, which represents not a single value of grade but an entire set of grades. Each element of the set can then be referenced by means of a number called an index number or subscript. Declaration of arrays Like any other variable arrays must be declared before they are used. The general form of declaration is: type variable-name [50]; The type specifies the type of the elements that will be contained in the ar...
Read more

C program to Find Cartesian Product of Two Sets | C programming

Image
C program to find the Cartesian Product of two sets   Cartesian product  is a mathematical operation that returns a set (or  product set  or simply  product ) from multiple sets. That is, for sets  A  and  B , the Cartesian product  A  ×  B  is the set of all ordered pairs  ( a ,  b )  where  a  ∈  A  and  b  ∈  B . Products can be specified using set-builder notation, e.g. {\displaystyle A\times B=\{\,(a,b)\mid a\in A\ {\mbox{ and }}\ b\in B\,\}.}
Read more

Eliminating Epsilon transition (ε-Transitions) | Conversion of Epsilon-NFA to DFA | Conversion of Epsilon-NFA to NFA | Theory Of Computation (TOC)

Image
Theory Of Computation (TOC) | Eliminating  Epsilon Transition ( ε -Transitions) : Given any Epsilon NFA (ε-NFA) , we can find a DFA D that accepts the same language as E. The construction is close to the subset construction, as the states of D are subsets of the states of E. The only difference is that dealing with ε-transitions, which can be done by using ε-closure.
Read more