Recent Posts

भूगोल को मानव पारिस्थितिकी के रूप में परिभाषित करने वाला विद्धान कौन है ?
(A) एच. एच. बैरोज
(B) जीन ब्रून्श
(C) हेटनर
(D) इरैटोस्थनीज

Posted on January 19,2023 at 08:18 PM by Reetu

Civil Services Entrance Exams-Medium-Hindi

Oneday Exams-Medium-Hindi

General Study (GS)

Railway RRB NTPC

18Score(s)

1Comment(s)

54View(s)

Which of the following is used in internal organization of 1k*1 memory chip.?

Posted on January 19,2023 at 08:10 PM by Aishwarya M G

Engineering-Mech

Engineering-Electrical

Engineering-EEE

Engineering-Civil

Engineering-Aero

Artificial intelligence

30Score(s)

1Comment(s)

59View(s)

Posted on January 19,2023 at 06:06 PM by Subita

Physics Numericals

Medical Entrance Exams

CLASS-XII (PCM)

CLASS-XII (PCB)

Uttar Pradesh Board of Technical Education - Lucknow

8Score(s)

0Comment(s)

22View(s)

Posted on January 19,2023 at 05:45 PM by Sidra Rhman

Medical Entrance Exams

CLASS-XII (PCB)

12Score(s)

2Comment(s)

51View(s)

Posted on January 19,2023 at 05:17 PM by Harsh sharma

Physics Numericals

Medical Entrance Exams

CLASS-XII (PCB)

10Score(s)

1Comment(s)

36View(s)

What will be the output of the following program?

public class Test {  public static void main(String[] args) {  
    int count = 1;  
    while (count = 15) {  
    System.out.println(count % 2 == 1 ? "***" : "+++++");  
    ++count;  
        } // end while  
    } // end main   
 }

Posted on January 19,2023 at 05:11 PM by Archana Digraj

Artificial intelligence

Machine learning

18Score(s)

1Comment(s)

40View(s)

predict the output of the following:

#include stdio.h  
# define max 6 
 int queue[max]; 
int front=-1; 
int rear=-1; 
// for enqueue
void enqueue(element){
 if(front==-1 && rear==-1) {
 front=0; 
 rear=0; 
 queue[rear]=element; }
 else if((rear+1)%max==front) {
 printf("Queue is overflow.."); }
 else {
rear=(rear+1)%max; 
 queue[rear]=element; }}
void display(){
int i=front; 
if(front==-1 && rear==-1) {
 printf("\n Queue is empty.."); }
 else { 
 printf("\nElements in a Queue are :"); 
 while(i=rear) {
 printf("%d,", queue[i]); 
i=(i+1)%max;  }}}
int main(){
    int element;
    enqueue(6);
    enqueue(9);
     enqueue(7);
    display();
    return 0;}

Posted on January 19,2023 at 05:01 PM by Madhu Bharadwaj

Engineering - AI ML

34Score(s)

1Comment(s)

77View(s)

माता- पिता में कौन सा समाश है।

Posted on January 19,2023 at 04:14 PM by Aman

0Score(s)

0Comment(s)

9View(s)

Posted on January 19,2023 at 01:49 PM by Kanishka gupta

Medical Entrance Exams

Physics Numericals

CLASS-XII (PCB)

Uttar Pradesh Board of Technical Education - Lucknow

14Score(s)

0Comment(s)

58View(s)

Posted on January 19,2023 at 11:59 AM by Tulsi kumari

Civil Services Entrance Exams-Medium-Hindi

General Study (GS)

16Score(s)

1Comment(s)

45View(s)

Scroll