Sookshmas | Recent Posts

Can you guess the output of the following C Code given below??

#include stdio.h
int main()
{
printf("%d", printf("New ton"));
return 0;
}

Posted on February 08,2023 at 05:54 PM by Hema D Poojar

Programming Languages

C Language

Engineering Placement

52Score(s)

1Comment(s)

68View(s)

What will be the output of the following program?

#include stdio.h    void main()
    {
        double ch;
        printf("enter a value between 1 to 2:");
        scanf("%lf", &ch);
        switch (ch)
        {
           case 1:
              printf("1");
              break;
           case 2:
              printf("2");
              break;
        }
    }

Posted on February 08,2023 at 05:15 PM by Archana Digraj

Artificial intelligence

Machine learning

Java

20Score(s)

0Comment(s)

32View(s)

Predict the output:

#include iostreamusing namespace std;
int main() {
for(int i=1;i10;i=i+8)
 {  
   coutiendl;
   }
 int i=0;
 for(;;)
  {
   coutiendl;
   }
}

Posted on February 08,2023 at 03:54 PM by Madhu Bharadwaj

24Score(s)

1Comment(s)

43View(s)

In a circular queue implementation using array of size 5, the array index starts with 0 where front and rear values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place.

Posted on February 08,2023 at 11:23 AM by Vamshi s

Programming Languages

24Score(s)

1Comment(s)

72View(s)

Q Cells in G0 phase .
(a) terminate the cell cycle
(b) exit the cell cycle
(C) enter the cell cycle
(d) suspended the cell cycle

Posted on February 08,2023 at 11:13 AM by Pallavi Gupta

0Score(s)

0Comment(s)

4View(s)

def heapify(arr, n, i):    largest = i
    l = 2 * i + 1
    r = 2 * i + 2

    if l  n and arr[i]  arr[l]:
        largest = l
    if r  n and arr[largest]  arr[r]:
        largest = r
    if largest != i:
        arr[i], arr[largest] = arr[largest], arr[i]
        heapify(arr, n, largest)

def heap_sort(arr):
    n = len(arr)
    for i in range(n, -1, -1):
        heapify(arr, n, i)

    for i in range(n - 1, 0, -1):
        arr[i], arr[0] = arr[0], arr[i]
        heapify(arr, i, 0)

arr = [5,0,4,6,3,7,2,8,1,9]
heap_sort(arr)
print("Sorted array is:", arr)

What is the output of the following python program