Tech - Exam 39 1

P and R
Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy

Question type: MCQ Single Correct Subject: Aptitude Subject: Technical
Subject: Programming
Question No: 2 Multi Choice Type Question Report Error
Technical
What is output of below program? Ability
int main()
{
int i,j,k,count;
count=0;
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
count++;
}
}
printf("%d",count);
return 0;
}
25 CORRECT
10
50
Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

The elements of a linked list are stored
In a structure
Anywhere the computer has space for them CORRECT
In contiguous memory locations
In an array

Question type: MCQ Single Correct

Table A
Id Name Age
----------------
12 Arun 60
15 Shreya 24
99 Rohit 11
Table B
Id Name Age
----------------
15 Shreya 24
25 Hari 40 Technical
98 Rohit 20 Ability
99 Rohit 11
Table C
Id Phone Area
-----------------
10 2200 02
99 2100 01
Consider the above tables A, B and C. How many tuples does the result of the following SQL query contains?
SELECT A.id
FROM A
WHERE A.age > ALL (SELECT B.age
FROM B
WHERE B. name = "arun")
3 CORRECT

What is output of below program?
int main()
{
int i,j,count;
count=0;
for(i=0; i<5; i++);
{
for(j=0;j<5;j++);
{
count++;
}
}
printf("%d",count);
return 0;
}
54
55
1 CORRECT

Technical
Ability
C++ uses which approach?
Top-down
left-right
bottom -up CORRECT
right -left

Consider the following transactions with data items P and Q initialized to zero:
T1: read (P) ;

read (Q) ;
if P = 0 then Q : = Q + 1 ;
write (Q) ;
T2: read (Q) ;
read (P) ;
if Q = 0 then P : = P + 1 ;
write (P) ;
Any non-serial interleaving of T1 and T2 for concurrent execution leads to
A conflict serializable schedule
A schedule for which a precedence graph cannot be drawn
A serializable schedule
A schedule that is not conflict serializable

CORRECT


int main()
{
int i,j;
for(i = 0,j=0;i<5;i++)
{
printf("%d%d--",i,j);
}
return 0;
}
Technical
Ability
00--10--20--30--40-- CORRECT
0--01--12--23--34--
00--01--02--03--04--
Compilation Error

Identify the correct syntax for declaring arrays in C++.
int arr[10]
CORRECT
array{10}
array arr[10]
int arr

A graph in which all vertices have equal degree is known as
Simple graph
Multi graph
Complete graph CORRECT
Regular graph

A vertex of in-degree zero in a directed graph is called a/an
Articulation point
Isolated vertex
Technical
Ability
Sink CORRECT
Root vertex

int main()
{
int i;
for(i=0; i<5; i++);
{
printf("cppbuzz");
}
return 0;
}
cppbuzz is printed 1 times CORRECT
Nothing is printed
Compilation Error
cppbuzz is printed 5 times

An index is clustered, if
it is on a set of fields that form a candidate key.
the data records of the file are organized in the same

CORRECT
order as the data entries of the index.
it is on a set of fields that include the primary key.

the data records of the file are organized not in the same order as
the data entries of the index.

Technical
1. Minimum number of fields in each node of a doubly linked list is Ability
____
3 CORRECT
None of the above

Question No: 15 Single File Programming Question Report Error
kth largest factor of N
A positive integer d is said to be a factor of another positive integer N if when N is divided by d, the remainder obtained is zero. For example,
for number 12, there are 6 factors 1, 2, 3, 4, 6, 12. Every positive integer k has at least two factors, 1 and the number k itself.Given two positive
integers N and k, write a program to print the kth largest factor of N.
Input format
The input is a comma-separated list of positive integer pairs (N, k)
Output format
The kth highest factor of N. If N does not have k factors, the output should be 1.
Code constraints
1<N<10000000000. 1<k<600. You can assume that N will have no prime factors which are larger than 13.
Sample testcases
Input 1 Output 1
12,3 4
Input 2 Output 2
30,9 1
Python (3.8)   
1 # You are using Python

2 number,k=[int(i) for i in input().split(",")]
3 count=0
4 for i in range(number,0,-1):
5 if number%i==0:
6 count=count+1
7 if( t k)
7 if(count==k):
8 print(i)
9 break
10 if count<k:
11 print("1")
Technical
Ability
Status: Partially correct Mark obtained: 3/10 Hints used: 0 Times compiled: 21
Times submitted: 5 Level: Easy Question type: Single File Programming
Show testcase scores Show solution
How many times CppBuzz.com is printed?
int main()
{
while(1)
{
printf("CppBuzz.com");
}
return 0;
}
Infinite times CORRECT
1 time
Runtime Error
Compilation Error

Identify the incorrect constructor type.
Parameterized constructor
Default constructor
Friend constructor
CORRECT
Copy constructor
A graph is a tree if and only if graph is
Technical
Directed graph Ability
Planar
Completely connected
Contains no cycles CORRECT

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of
functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
4 CORRECT

Which of the following data type is supported in C++ but not in C?
float
bool
CORRECT
double
int
First 1 2 Last
Technical
Ability

Tech - Exam 39 1

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Tech - Exam 39 1

Uploaded by

Copyright:

Available Formats

P and R

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy

Question No: 2 Multi Choice Type Question Report Error

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 3 Multi Choice Type Question Report Error

The elements of a linked list are stored

Anywhere the computer has space for them CORRECT

In contiguous memory locations

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy

Question No: 4 Multi Choice Type Question Report Error

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 5 Multi Choice Type Question Report Error

What is output of below program?

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

C++ uses which approach?

bottom -up CORRECT

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 7 Multi Choice Type Question Report Error

T1: read (P) ;

Any non-serial interleaving of T1 and T2 for concurrent execution leads to

A conflict serializable schedule

A schedule for which a precedence graph cannot be drawn

A schedule that is not conflict serializable

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 8 Multi Choice Type Question Report Error

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 9 Multi Choice Type Question Report Error

Identify the correct syntax for declaring arrays in C++.

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 10 Multi Choice Type Question Report Error

A graph in which all vertices have equal degree is known as

Complete graph CORRECT

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy

Question No: 11 Multi Choice Type Question Report Error

A vertex of in-degree zero in a directed graph is called a/an

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 12 Multi Choice Type Question Report Error

What is output of below program?

cppbuzz is printed 1 times CORRECT

cppbuzz is printed 5 times

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy

Question No: 13 Multi Choice Type Question Report Error

it is on a set of fields that form a candidate key.

the data records of the file are organized in the same

it is on a set of fields that include the primary key.

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 14 Multi Choice Type Question Report Error

None of the above

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 15 Single File Programming Question Report Error

kth largest factor of N

1 # You are using Python

Show testcase scores Show solution

Question No: 16 Multi Choice Type Question Report Error

How many times CppBuzz.com is printed?

Infinite times CORRECT

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

Question No: 17 Multi Choice Type Question Report Error

Identify the incorrect constructor type.

Question No: 18 Multi Choice Type Question Report Error

A graph is a tree if and only if graph is

Contains no cycles CORRECT