With the help of suitable example, explain the functioning of switch statement.

Featured

July 7, 2021 in C and CPP

A lucas sequence is given below:

a) A lucas sequence is given below:
1, 3, 4, 7, 11, 18, 29
The third number is sum of previous two numbers. Write a program to print first 10 numbers of lucas sequence.

July 7, 2021 in C and CPP

An example of volatile memory is ________.

A. OR B. 0 (Logn) C. 32 KB
D. open source software E. RAM F. And
G. stdio.h H. single I. insertions sort
J. 0 (nlogn) K. 64 KB L. Dijkstra’s algorithm
M. goto

4.1 An example of volatile memory is ________.
4.2 The ________ operator is true only when both the operands are true.
4.3 LINUX is an example of ________.
4.4 By default a real number is treated as ________.
4.5 Header file in which NULL macro is defined is ________.
4.6 Memory that can be allocated in a single call to macro is ________.
4.7 Total number of comparison in bubble sort is ________.
4.8 Arranging pack of cards by picking one by one is an example of ________.
4.9 All pair shortest path problem can be solved by ________.
4.10 Avoid the use of ________ statement in the program.

July 7, 2021 in C and CPP

A command that lets you change one or more fields in a record is look up.

Each statement below is either TRUE or FALSE. Choose the most appropriate one and
ENTER in the “OMR” answer sheet supplied with the question paper, following
instructions therein.

2.1 A command that lets you change one or more fields in a record is look up.
2.2 In relational schema each tuple is divided into fields called relations.
2.3 The best average SORTING behavior is shown by merge sort.
2.4 The data structure that is needed to convert infix notation to prefix notation is graph.
2.5 The best case and worst case time for searching an element using linear search is 1, n.
2.6 Forest is a set of N>=0 disjoint trees, which are obtained when root is removed.
2.7 PERT graph is a graph used to perform PERT calculation.
2.8 Priority queue is a queue that is used to store priority data.
2.9 A symmetric diagraph is a directed graph such that for every edge VW there is reverse edge WV.
2.10 Maximum degree in any vector in a graph with n vertices is n-1.

July 7, 2021 in C and CPP

The do..while looping statement

1.7 The do..while looping statement
A) is executed only once if the conditions is true
B) is also known as entry-controlled loop
C) is executed at least once if the conditions is false
D) the unconditional loop