Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by jatinkumar
0
votes
0
answers
1
Mathematics
157
views
asked
Oct 4, 2018
Set Theory & Algebra
graph-theory
discrete-mathematics
+
–
0
votes
0
answers
2
Virtual Gate Test Series: Discrete Mathematics - Set Theory & Algebra - Functions
296
views
asked
Sep 28, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
functions
virtual-gate-test-series
+
–
0
votes
1
answer
3
Regular Language
565
views
asked
Aug 12, 2018
Theory of Computation
theory-of-computation
regular-language
finite-automata
regular-expression
+
–
1
votes
0
answers
4
What's the difference b/w TA and RA in Mtech?
What's the difference b/w TA and RA according to - 1) How can we choose a course (Specialization) in them? 2) In which we learn a lot? 3) Companies preferred which students?
What's the difference b/w TA and RA according to -1) How can we choose a course (Specialization) in them?2) In which we learn a lot?3) Companies preferred which students?...
920
views
asked
Jun 30, 2018
1
votes
2
answers
5
Analysis of algorit
Which of the following statements is/are valid? 1. Time Complexity of QuickSort is Θ(n^2) 2. Time Complexity of QuickSort is O(n^2) 3. For any two functions f(n) and g(n), we have f(n) = Θ(g(n)) if and only if f(n) = O(g(n)) and f(n) = Ω(g(n)). 4. Time complexity of all computer algorithms can be written as Ω(1)
Which of the following statements is/are valid?1. Time Complexity of QuickSort is Θ(n^2)2. Time Complexity of QuickSort is O(n^2)3. For any two functions f(n) and g(n), ...
2.6k
views
asked
Jun 6, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
multiple-selects
+
–
1
votes
1
answer
6
Sorting
Which sorting algorithm is good if we already knew the range of number - Counting Sort OR Radix Sort
Which sorting algorithm is good if we already knew the range of number -Counting Sort OR Radix Sort
848
views
asked
Jun 5, 2018
DS
sorting
time-complexity
algorithms
+
–
0
votes
0
answers
7
Avg. Access Time
When we calculate avg access time, If it is not given in question like it is Hierarchal or Simultaneous access then by default we have to take which access to calculate avg access time?
When we calculate avg access time, If it is not given in question like it is Hierarchal or Simultaneous access then by default we have to take which access to calculate a...
226
views
asked
May 25, 2018
CO and Architecture
co-and-architecture
+
–
0
votes
1
answer
8
# gate cse 1998 1mark question
plz explain why the answer is occupation ????
plz explain why the answer is occupation ????
372
views
asked
Jan 25, 2017
Databases
databases
+
–
1
votes
1
answer
9
# gate cse 1998 2 marks
Plz explain the answer of ques no. 4 a) 2NF b) 3NF
Plz explain the answer of ques no. 4a) 2NFb) 3NF
853
views
asked
Jan 25, 2017
Databases
databases
database-normalization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register