Skip to main content

SOLUTION OF THE 2019-2020 PAPER

                                                                SECTION-A

A).Name different storage class with one example each.

Ans: Register Storage classes  

        Static Storage classes 

        External Storage classes

B).Describe the functionalities of Operating System.

Ans: The functionality of operating system are as follows:

        1.security                                                    4.coordination b/w software and users.

        2.control over system performance            5.processor management 

        3.memory management                              6. file management

        

C). Diffrentiate between Implicit and Explicit Type Conversion.

Ans: IMPLICIT TYPE CONVERSION: This is the method in which the compiler converts one data type to another data type by itself.

EXPLICIT TYPE CONVERSION. This is the method of converting one data type to another data type by forcing or commanding the compiler.

D).What do you understand by mixed operands?

Ans: In an expression, when operands of diffrent data types are used, they are called "mixed operands ".

example: int a +float b 

E).What do you mean by the prototype of the function?

Ans:A function prototype or function interface is a declaration of the function that specifies the function name and type signature but omits the function body.

F). Differentiate between while and do-while loop.

Ans: while loop : In this loop first the condition is checked and then the execution the program starts.

        Do-while loop: In this loop first the programs runs and then the condition is checked. 

H).Differentiate Structure and union.

Ans:



I).Explain the role of C preprocessor.

Ans. The preprocessor provides the ability of include the header files , macro expansion and line control.

J). What do you mean by pointer arithmetic?

Ans: A pointer in c is an address which is a numeric value. Therefore we can perform arithmetic operation on a pointer.


Comments

Popular posts from this blog

Firebase 9.0: A New Era of App Development

Firebase 9.0: A New Era of App Development Firebase, Google's mobile and web development platform, has just released its latest version, Firebase 9.0. This major update brings a number of new features and improvements, making it easier and faster than ever to build and deploy high-quality apps. Here are some of the highlights of Firebase 9.0: New AI Extensions powered by the PaLM API Firebase now includes a number of new AI Extensions that can be used to add powerful features to your apps, such as natural language processing, image recognition, and machine translation. Introducing the Extensions publishing experience Firebase Extensions are now available to be published and shared with the community. This makes it easy for developers to find and use the extensions they need, and it also gives developers the opportunity to share their own extensions with the world. Cloud Functions for Firebase 2nd gen supports Python Cloud Functions for Firebase is a serverless platform that lets y

BEE ASSIGNMENT

 Here is the solution of BEE ASSIGNMENT    QUESTION 1 - QUESTION 5 Question 6 to Question 10  For maths assignment : click here  

Index Sequential Search

 Code for Index Sequential Search  import java . util .*; public class Index_search {     public static void main ( String [] args ) {         int i , a = 0 ;         Scanner in = new Scanner ( System . in );         int arr [] = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 };         System . out . println ( "Please enter the number to be find: " );         int num = in . nextInt ();         System . out . println ( "Please enter the steps to left" );         int steps = in . nextInt ();         in . close ();         for ( i = 0 ; i < arr . length ; ) {             if ( num == arr [ i ] ) {                 System . out . println ( "Number found in the first one. " + i );                 a = 1 ;                 break ;             }             else if ( num < arr [ i ]){                 break ;             }             i = i + steps ;         }         if ( a == 0 ) {             for ( int j = ( i - steps )+ 1 ; j < i ; j +