Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Himanshu1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Himanshu1
2
votes
1
answer
1
1000th power of a matrix
Find the 1000_th power of the matrix -
Find the 1000_th power of the matrix -
1.4k
views
asked
Jun 3, 2016
Linear Algebra
linear-algebra
matrix
+
–
3
votes
0
answers
2
Find the age of Daughters - This was asked in Google
448
views
asked
May 1, 2016
Quantitative Aptitude
quantitative-aptitude
+
–
1
votes
2
answers
3
least significant digit of 2 ^ (3 * (10 ^ 100) )
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$ 2 4 6 8
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$2468
929
views
asked
Apr 15, 2016
Quantitative Aptitude
quantitative-aptitude
numerical-answers
+
–
0
votes
1
answer
4
Identify whether the problem is classification or Regression.
468
views
asked
Apr 6, 2016
Artificial Intelligence
machine-learning
non-gate
+
–
0
votes
1
answer
5
Performance measure P
631
views
asked
Apr 6, 2016
Artificial Intelligence
machine-learning
+
–
7
votes
1
answer
6
Selection of proper domain for masters
Q. What are the various areas , one can choose in IITs/IISc. for masters ? What is their respective future scope ? When this selection is to be made ?
Q. What are the various areas , one can choose in IITs/IISc. for masters ? What is their respective future scope ? When this selection is to be made ?
2.7k
views
asked
Feb 25, 2016
IISc/IITs
area-of-interest
+
–
1
votes
0
answers
7
MadeEasy Test Series: Numerical Ability - Statement Arguement
461
views
asked
Jan 20, 2016
Quantitative Aptitude
made-easy-test-series
general-aptitude
quantitative-aptitude
statement-argument
+
–
1
votes
1
answer
8
Heap Sort best case
What is the Best Case run time of Heap Sort ? A. $O(1)$ B. $O(n)$ C. $O(n \log n)$ D. $O(\log n)$
What is the Best Case run time of Heap Sort ?A. $O(1)$B. $O(n)$C. $O(n \log n)$D. $O(\log n)$
1.3k
views
asked
Jan 20, 2016
Algorithms
algorithms
sorting
binary-heap
heap-sort
+
–
0
votes
1
answer
9
Sorting - which will perform Better
If input is sorted in reverse order , then which sorting algorithm will perform best - A) Insertion Sort B) Merge Sort C) Heap Sort D) Quick Sort
If input is sorted in reverse order , then which sorting algorithm will perform best -A) Insertion SortB) Merge SortC) Heap SortD) Quick Sort
1.8k
views
asked
Jan 17, 2016
Algorithms
sorting
algorithms
normal
+
–
0
votes
2
answers
10
Output of this code
Output of this program - int rec(int x) { static int f; if(x == 1) return(1); else __Y__ ; return f ; } What is the value returned by rec(5) ​a) when Y is f = f * 1 + rec(x-1) ; b) when Y is f = f * x + rec(x-1) ; What is proper way to solve this ?
Output of this program - int rec(int x){ static int f; if(x == 1) return(1); else __Y__ ; return f ;} What is the value returned by rec(5)​a) ...
2.6k
views
asked
Jan 15, 2016
Programming in C
programming-in-c
recursion
+
–
1
votes
2
answers
11
f(x) continuous / differentiable ?
669
views
asked
Jan 13, 2016
Calculus
calculus
engineering-mathematics
+
–
1
votes
1
answer
12
Number of super_keys
284
views
asked
Jan 12, 2016
Databases
databases
+
–
8
votes
4
answers
13
DCFL not closed under
DCFLs are not closed under ________ a. Complement operation b. Inverse homomorphism operation c. Reversal operation d. Prefix operation
DCFLs are not closed under ________a. Complement operationb. Inverse homomorphism operationc. Reversal operationd. Prefix operation
8.9k
views
asked
Jan 9, 2016
Theory of Computation
theory-of-computation
dcfl
+
–
6
votes
2
answers
14
Asymptotics
Find the False statement. $O(2^n) = O(3^n)$ $O(\log n^2) = O(\log n)$ $f(n) = O \left ( (f(n))^2 \right )$ $2^{2 \log n} (\log n) = O(n^2 \log n)$
Find the False statement.$O(2^n) = O(3^n)$ $O(\log n^2) = O(\log n)$ $f(n) = O \left ( (f(n))^2 \right )$ $2^{2 \log n} (\log n) = O(n^2 \log n)$
800
views
asked
Jan 6, 2016
Algorithms
algorithms
asymptotic-notation
+
–
1
votes
3
answers
15
TCP & UDP
1.1k
views
asked
Jan 6, 2016
Computer Networks
computer-networks
tcp
+
–
1
votes
1
answer
16
page table
737
views
asked
Jan 6, 2016
Operating System
operating-system
paging
memory-management
+
–
1
votes
3
answers
17
Find maximum edges in Graph
559
views
asked
Jan 6, 2016
Graph Theory
graph-theory
+
–
0
votes
1
answer
18
Function F implemented using MUX
690
views
asked
Jan 6, 2016
Digital Logic
digital-logic
multiplexer
+
–
0
votes
1
answer
19
Record Route
433
views
asked
Jan 5, 2016
Computer Networks
computer-networks
+
–
5
votes
1
answer
20
Sql query
Q). Consider STUDENT table with the following tuples. SNAME CPI Deepak 8.7 Dilip 9.7 Kaustav 8.5 Pallab 9.8 Sourav 8.7 Swapnil 8.5 (select * FROM STUDENT S1 WHERE 3> (SELECT COUNT(*) FROM STUDENT S2 WHERE S1.CPI<=S2.CPI)) UNION (SELECT * FROM STUDENT S1 ... COUNT(*) FROM STUDENT S3 WHERE S2.CPI <= S3.CPI))) How many numbers of tuples are there in the output of the above query?
Q). Consider STUDENT table with the following tuples.SNAMECPIDeepak8.7Dilip9.7Kaustav8.5Pallab9.8Sourav8.7Swapnil8.5(select * FROM STUDENT S1 WHERE 3 (SELECT COUNT(*) FRO...
678
views
asked
Jan 5, 2016
Databases
databases
sql
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register