Glitch Hunting Round-2

Glitch Hunting Round-2

University

10 Qs

quiz-placeholder

Similar activities

Data Structure Quiz

Data Structure Quiz

University - Professional Development

10 Qs

Kuis Susulan ASD

Kuis Susulan ASD

University

10 Qs

Trees

Trees

University

10 Qs

PDS - 04225 Balanced Trees - Chapter 7

PDS - 04225 Balanced Trees - Chapter 7

University

10 Qs

Network Fundamentals-Data Link Layer

Network Fundamentals-Data Link Layer

9th Grade - Professional Development

11 Qs

Q4 - BPM

Q4 - BPM

University

10 Qs

Skip List Quizizz

Skip List Quizizz

9th Grade - University

12 Qs

special exam in BINARY TREE

special exam in BINARY TREE

University

15 Qs

Glitch Hunting Round-2

Glitch Hunting Round-2

Assessment

Quiz

Computers

University

Hard

Created by

Smart venkey

Used 2+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

what will be the output of the following pseudocode for p=3 and q=7

Integer function funn(Integer p, Integer q)

Integer r

set r=p

p=q

r=p

q=r

p=r

return p+q

End function funn ()

16

28

14

18

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the functionality of the following piece of code? Select the most appropriate

public void function(int data)

{

int flag = 0;

if( head != null)

{

Node temp = head.getNext();

while((temp != head) && (!(temp.getItem() == data)))

{

temp = temp.getNext();

flag = 1;

break;

}

}

if(flag)

System.out.println("success");

else

System.out.println("fail");

}

Print success if a particular element is not found

Print fail if a particular element is not found

Print success if a particular element is equal to 1

Print fail if the list is empty

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

Possible if X is not last node

Possible if size of linked list is even

Possible if size of linked list is odd

Possible if X is not first node

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

------is a parameter passing method that waits

to evaluate the parameter value until it is used ?

pass by value

pass by name

pass by reference

pass by pointer

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The number of possible binary trees with 3 node is

12

13

5

9

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Find the answer for snipet code?

#include<stdio.h>

int main(){

int x=10;

if (x=1){

printf("Hello");

}

else{

printf("World");

}

Hello

World

HelloWorld

compilation error

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

what is the output of the below

pseudocode?

set value=''*15;

print value

150

15

480

320

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?