# Recent activity by Devshree Dubey

1
Please help with this question:- $(\sqrt{243}+3)^x+(\sqrt{243}-3)^x=15^x$.
2
Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) }
3
Please can anyone help me how to measure the CPU Performance and everything related with it.
4
Please help to find the time complexity of this loop. void main() { int n; while(n>=1) { n=n-2; } }
5
Let $T$ be a Depth First Tree of a undirected graph $G$. An array $P$ indexed by the vertices of $G$ is given. $P[V]$ is the parent of vertex $V$, in $T$. Parent of the root is the root itself. Give a method for finding and printing the ... be proportional to the length of the cycle. Describe the algorithm in a PASCAL $(C)$ - like language. Assume that the variables have been suitably declared.
6
Let $A$ be an array of $n$ integers, sorted, so that $A[1] \leq A[2] \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there are indices $k$ and $l$ such that $A[k]+A[l] = x$. Design an $O(n \log n)$ time algorithm for this problem.
7
Show that the set of functions from the positive integers to the set {0,1,2,3,4,5,6,7,8,9} is uncountable.
8
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin until he gets heads in two consecutive tosses. The expected number of coin tosses that Ram does is. $2$ $4$ $6$ $8$ None of the above.
9
Consider a circle with a circumference of one unit length. Let $d< \dfrac{1}{6}$. Suppose that we independently throw two arcs, each of length $d$, randomly on this circumference so that each arc is uniformly distributed along the circle circumference. The arc attaches itself exactly to the circumference so that ... equals $(1 - 3d)$ It equals $(1 - 2d)$ It equals $1$ It equals $(1 - d)$ $(1 - d)$
10
Which of the following set of instructions moves the contents of memory location 3500H to register C? The contents of memory location 3500 H is 46 H. a. LXI H, 3500 H MOV M, C b. LXI C, 3500 H MOV C, M c. LXI C, 46 H MOV C, M d. LXI H, 3500 H MOV C, M
11
Can someone explain how i+= func(k); works?
12
What is the smallest number that when divided by 12, leaves 10, when divided by 16, leaves 14 and when divided by 24, leaves 22 as a remainder?
13
Which is the best interfacing of IO with the CPU?Please give answer while keeping the following parameters in mind:- 1)Accuracy 2)Speed 3)Time Consumption
14
The delays of NOR gates, Multiplexer and Inverters are 2ns, 1.5ns and 1ns respectively. If all the inputs P, Q, R, S and T are applied at the same time instant, Then the Maximum propagation delay (in ns) of the circuit is _______________
15
A block-set associative cache memory consists of $128$ blocks divided into four block sets. The main memory consists of $16, 384$ blocks and each block contains $256$ eight bit words. How many bits are required for addressing the main memory? How many bits are needed to represent the TAG, SET and WORD fields?
16
Program 1: #include<stdio.h> int main() { float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); } The output of above program is ELSE IF . Program 2: #include<stdio.h> int main() { float ... me why I am getting these weird output and is there any way to predict these outputs on the same processor. Also how comparison is done of two variables in C ?
17
(1-1/3) (1-1/4) (1-1/5)...(1-1/n)=x then the value of x is : a)1/n b)2/n c)2(n-1)/n d)2/n(n+1)
18
The least number of five digits which is exactly divisible by 12,15 and 18 is: a)10080 b)10800 c)18000 d)81000
19
Please help with the following:- 1)How to determine if a graph is bipartite or not? 2)What is meant by ordered pair in case of a directed graph and unordered pair in case of an undirected graph?
20
What is the difference between Subschema, View and Virtual table in DBMS? please explain!!
21
Please help with the following in Time Complexity. 1)Show that the following order-of-magnitude results hold: a)3n=O(n!) b)(n3 -2n)/(n+1)=theta(n2) c)n3 /log(n+1)=O(n3) but not O(n2) 2)What is wrong with the following argument? x=O(n4),y=O(n2),therefore x/y=O(n2). 3) What is wrong with ... with the following argument? f(n)=O(n2)+O(n), so that f(n)-g(n)=O(n2 )+O(n)-O(n2). Therefore, f(n)-g(n)=O(n)
22
Which are the classifications of data used in Mobile Applications? Private data, Shared data, User data Public data, User data, Virtual data Private data, Public data, Shared data Public data, Virtual data, User data
23
In a circular linked list oraganisation, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
24
Please can anyone give example of IPC in a local machine.
25
What is the difference between a job,a process and a thread?
26
Which data structure is used to implement the Process Control Block?