10 a]Discuss the use of #define and #include in C programming SL NO Preprocessor syntax Description 1 Macro #define This macro defines constant value and can be any of the basic data types. 2 Header file inclusion #include<file_name> The source…
09 c]How union is different from struct? Give example. Structure : A structure is a user-defined data type available in C that allows to combining data items of different kinds. Structures are used to represent a record. Defining a structure: To…
09 b] Give the general syntax to initialize a structure to store a Book information After defining a structure format we have declare variables of that type. A Structure variable declaration is similar to the declaration of variables of any…
09 a]Write a C program to swap two integer values using pointers. swapping two integer values using pointers below example shows the before swap and after swap
08 c]List any five built-in functions and explain any two of them. Answer:- printf() scanf() puts() gets() printf() :- In C programming language, printf() function is used to print the (“character, string, float, integer, octal and hexadecimal values”) onto the…
8 b]Write a C program to find factorial of a given number using recursion function. ➢ Recursion is the repetitive process in which a function calls itself.➢ All recursive functions have two elements each call either solves one part of…
8 a]Discuss the various ways of passing parameter to the functions. Void Functions without parameters – No arguments and no return values ➢ When a function has no arguments, it does not receive any data from the calling function.➢ Similarly,…
6. B) Using suitable code, discuss the working of the following string functions: i.strcat ii.strcmp iii.strcpy iv.strlen v.strstr Answer:
6. A) Write a C program to implement Selection Sort technique (ascending order). Trace the steps for the input: 9, 1, 6, 3, 2, 0, 5 Answer:
5. C) With the help of suitable example explain the working of Binary Search technique. Answer: Binary Search: Binary search works on sorted arrays. A binary search begins by comparing the middle element of the array with the target value.…
