![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1675407617704-C%20Programs.jpg\")
<\/p>\n<\/p>\n
Many interviews generally include questions about C programs. These programs can be used to handle files, arrays, strings, pointers, linked lists, and other fundamental data types.<\/p>\n
Dennis Ritchie developed the general-purpose computer language C at Bell Laboratories in 1972. Despite being an ancient language, it is quite popular.
\nSince the UNIX operating system was created using C, the two are closely related.<\/p>\n
Calculate the Percentage of 5 Subjects<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Convert infix to postfix<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Odd Even Program<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Find area of a circle<\/strong><\/a> Where the value of pie = 3.14 and the radius will be given by the user.<\/p>\n Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Convert Celsius to Fahrenheit<\/strong><\/a> Formula<\/strong><\/p>\n Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Add two numbers<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Binary Search program in C<\/strong><\/a> Input:<\/strong><\/p>\n 40 Priority Scheduling program in C<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Processes Burst time Waiting time Turn around time Average waiting time<\/strong> = 9.33333 Find roots of quadratic equation<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Convert binary numbers to decimal number<\/strong><\/a> Input:<\/strong> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Ascending order program in C language<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n SJF Scheduling program in C<\/strong><\/a> Output:<\/strong><\/p>\n average waiting time<\/strong> = -16382.000000 Menu Driven program for all operations on the doubly linked list in C.<\/strong><\/a> Output:<\/strong><\/p>\n FCFS Scheduling program in C<\/strong><\/a> Output:<\/strong><\/p>\n Average waiting time<\/strong> = 8.33333 Swap two Numbers<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n Compound Interest Program<\/strong><\/a> Input:<\/strong><\/p>\n Output:<\/strong><\/p>\n
\nIt is simple to calculate the percentage of five subjects, all you need to do is add all of the marks and multiply that total by 100. Then divide that by the total number of marks a student is permitted to receive. You will ultimately receive the results as a percentage of the 5 subjects.<\/p>\n50 20 30 40 80<\/code><\/pre>\nEnter marks of five subjects:\nTotal marks = 220.00\nAverage marks = 44.00\nPercentage = 44.00<\/code><\/pre>\n<\/li>\n
\nAny operation may be written as an infix, prefix, or postfix, in this C language tutorial, we’ll see how to do this. Two approaches have been covered: the array-based stack approach and the struct-based stack approach.<\/p>\n((p+(q*r))-s)<\/code><\/pre>\npqr*+s-<\/code><\/pre>\n<\/li>\n
\nA number is taken into consideration even though it may be split by two equally. The remainder that is not precisely divisible by 2 is known as an odd number. Simply expressed, odd numbers adopt the form n = 2k+1, whereas even numbers take the form n = 2k. Each integer will be made up of either even or odd integers. <\/p>\n10<\/code><\/pre>\nEven<\/code><\/pre>\n15<\/code><\/pre>\nOdd<\/code><\/pre>\n<\/li>\n
\nEveryone knows the basics of mathematics,
\nFor finding the area of a circle, we can get this by performing some<\/p>\nArea = Pie * Radius * Radius<\/code><\/pre>\n10<\/code><\/pre>\nThe radius of the circle is 10\nThe area of a given circle is 314.000000<\/code><\/pre>\n<\/li>\n
\nIn the realm of programming, we may easily convert between celsius and fahrenheit by carrying out a few simple mathematical operations.
\nThe formula to change from celsius to fahrenheit is shown below.<\/p>\nFahrenheit Temperature = (1.8 * celsius) + 32;<\/code><\/pre>\n40<\/code><\/pre>\n104<\/code><\/pre>\n<\/li>\n
\nIn the C programming language, the phrase "sum of two integers" refers to adding two integer values and printing the addition of two integer values and the printing of the result. To combine two numbers, all we need to do is utilize the "+" operator. In the link above, we have also explained several techniques.<\/p>\n10 20<\/code><\/pre>\n30<\/code><\/pre>\n20 20<\/code><\/pre>\n40<\/code><\/pre>\n<\/li>\n
\nIn the C programming language, a sorted array may be searched using a technique called binary search by continually halving the search interval. In order to reduce the time complexity to O, binary search makes use of the fact that the array is sorted (LogN).
\nThis approach always searches the center of an array for the element.
\nThere are two ways to create a binary search program in C:<\/p>\n\n
[11, 14, 25, 30, 40, 45]<\/code><\/pre>\n
\nOutput:<\/strong><\/p>\nElement is present at position 4<\/code><\/pre>\n<\/li>\n
\nThe algorithms prioritize the processes that must be carried out and schedule them accordingly. A higher-priority process will receive CPU priority first, and this will continue until all of the processes are finished. Due to the process’ greater priority, the Priority Scheduling Algorithm is in charge of transferring it from the ready queue to the work queue.<\/p>\n{{1, 10, 2}, {2, 5, 0}, {3, 8, 1}}<\/code><\/pre>\nOrder in which processes get executed \n1 3 2<\/code><\/pre>\n
\n1 10 0 10
\n3 8 10 18
\n2 5 18 23<\/p>\n
\nAverage turn around time<\/strong> = 17<\/p>\n<\/li>\n
\nA quadratic has the formula y = ax^2 + bx + c, where a, b, and c are all integers and a must be 0. An illustration of a quadratic equation is 3×2 + 3x + 1.
\nLet’s talk about what a quadratic equation’s roots are and how to get them from the equation.
\nThe discriminant of a quadratic equation is the expression b2 – 4ac. It describes the roots’ character.<\/p>\na = 2.4 b = 4 c = 506<\/code><\/pre>\nroot1 = -0.87+1.30i and root2 = -0.87-1.30i<\/code><\/pre>\n<\/li>\n
\nIn order to convert a binary number to a decimal number, we must multiply each digit of the binary number starting at 0 by powers of 2 and then sum the results to obtain the decimal number.<\/p>\n
\n111
\nOutput:<\/strong><\/p>\n7<\/code><\/pre>\n0101<\/code><\/pre>\n5<\/code><\/pre>\n<\/li>\n
\nDifferent kinds of reasoning can be used to sort things. For the sake of simplicity, we shall employ a tried-and-true technique. We choose a certain element from an array, compare it to other elements, and then place it appropriately to sort the array.<\/p>\nArr[50, 20, 100, 25, 36]<\/code><\/pre>\n20 25 36 50 100<\/code><\/pre>\nArr[5, 8, 2, 1, 6]<\/code><\/pre>\n1 2 5 6 8<\/code><\/pre>\n<\/li>\n
\nOne of the CPU scheduling strategies is to select the shortest jobs first. It is an algorithm whose burst time-dependent procedure. In other words, a process with a lower burst time executes first. The shortest job next (SJN) is another name for the shortest job first (SJF). For instance, we have four processes, P1, P2, P3, and P4, with burst times of 5, 7, 6, and 2. Process P4 will now be run first since it has a shorter burst period. Processes P1, P3, and P2 will then be carried out in that order.<\/p>\nenter the no of processes: 2\nthe arrival time for process P1: 10\nthe burst time for process P1: 5\nthe arrival time for process P2: 6\nthe burst time for process P2 : 3\nP[10] | -22765 | -32764<\/code><\/pre>\n
\naverage turnaround time<\/strong> = -11382.500000<\/p>\n<\/li>\n
\nIn the menu-driven program in C, the user is given a variety of options, and some functionality is available based on these choices. These programs are used to give users the desired functions and a straightforward yet effective user interface.<\/p>\n 1 To see list\n 2 For insertion at starting\n 3 For insertion at end\n 4 For insertion at any position\n 5 For deletion of first element\n 6 For deletion of last element\n 7 For deletion of element at any position\n 8 To exit\n\nEnter Choice :\n2\n\nEnter number to be inserted: 4\n\n 1 To see list\n 2 For insertion at starting\n 3 For insertion at end\n 4 For insertion at any position\n 5 For deletion of first element\n 6 For deletion of last element\n 7 For deletion of element at any position\n 8 To exit\n\nEnter Choice :\n3\n\nEnter number to be inserted: 11\n\n 1 To see list\n 2 For insertion at starting\n 3 For insertion at end\n 4 For insertion at any position\n 5 For deletion of first element\n 6 For deletion of last element\n 7 For deletion of element at any position\n 8 To exit\n\nEnter Choice :\n3\n\nEnter number to be inserted: 9\n\n 1 To see list\n 2 For insertion at starting\n 3 For insertion at end\n 4 For insertion at any position\n 5 For deletion of first element\n 6 For deletion of last element\n 7 For deletion of element at any position\n 8 To exit\n\nEnter Choice:\n1\nData = 4\nData = 11\nData = 9<\/code><\/pre>\n<\/li>\n
\nThe CPU assigns work using a non-preemptive scheduling mechanism called First Come First Serve. According to the request that was made initially, as the name implies, the tasks are given the highest priority.<\/p>\nProcesses Burst time Waiting time Turn around time\n 1 10 0 10\n 2 5 10 15\n 3 8 15 23<\/code><\/pre>\n
\nAverage turnaround time<\/strong> = 16<\/p>\n<\/li>\n
\nWhen two numbers are changed, two variables’ values are also changed. Think about the variables var1 and var2 you have. Var1 is valued at 20, whereas Var2 is valued at 40. As a result, after swapping, var1 and var2 will have values of 40 and 20, respectively.
\nWe have discussed different methods such as:<\/p>\n\n
a = 20 b = 40<\/code><\/pre>\na = 40 b = 20<\/code><\/pre>\n<\/li>\n
\nTo calculate the amount of interest given by:
\nAmount of interest = P(1+R\/100)t
\nP = Principal amount
\nR = Rate of interest
\nT = The Time span
\nCompound Interest = Amount \u2013 P<\/p>\nPrincipal (amount): 1200\n Time: 2\n Rate: 5.4<\/code><\/pre>\nCompound Interest = 133.099243<\/code><\/pre>\n<\/li>\n