dbms igate test series

jugnu1337 asked Aug 12, 2022

128 views

See all

Please log in or register to answer this question.

Related questions

2 votes

1 answer

jugnu1337 asked Jul 30, 2022

540 views

dbms+combinatory igate test series question
You have to construct keys of length 2 to 3 characters consisting of upper case alphabets or decimal digits (0 to 9). If each key must contain at least one alphabets, then determine the total number of possible keys.

You have to construct keys of length 2 to 3 characters consisting of upper case alphabets or decimal digits (0 to 9).If each key must contain at least one alphabets, then...

jugnu1337

540 views

jugnu1337 asked Jul 30, 2022

2 votes

0 answers

jugnu1337 asked Nov 1, 2022

505 views

igate test series
AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1 if n is the number of nodes in a AVL tree . The maximum value of n for which the difference between the minimum height and maximum height of AVL tree is <2 _________ ?

AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1 if n is the ...

jugnu1337

505 views

jugnu1337 asked Nov 1, 2022

2 votes

2 answers

jugnu1337 asked Sep 29, 2022

494 views

igate test series
The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Execution state for addition take 1 clock, multiplication take 3 clock cycles and division take 5 clock cycles. Assume pipeline ... wrong. approch totel 200 in which (100 add having 1 cc) +(25*5-1) +(75*(3-1))=354

The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Ex...

jugnu1337

494 views

jugnu1337 asked Sep 29, 2022

0 votes

2 answers

rsansiya111 asked Sep 23, 2022

509 views

igate Test Series
Rahul knows the implementation of merge sort. One day, his teacher asked him to find numbers of inversion in an array. An inversion can be defined in an array as if i < j, a[i] > a[j] then it is an inversion. Now, given there are p inversions in an ... multiply all elements by -1, what is the time complexity to find inversions in an updated array? O(n) O(nlogn) O(n^2) None

Rahul knows the implementation of merge sort. One day, his teacher asked him to find numbers of inversion in an array. An inversion can be defined in an array as if i < j...

rsansiya111

509 views

rsansiya111 asked Sep 23, 2022

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

dbms igate test series

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0