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 anjali007
0
votes
0
answers
31
#geeks_quiz_datastructure
Consider the following list of the integer: 19, 23, 40, 32, 91, 25, 100, 36 Sort this list in increasing order using insertion sort and determine the number of passes, comparisons, and swaps ? A 7, 14, 8 respectively. B 7, 7, 14 respectively. C 8, 7, 12 respectively. D 8, 14, 7 respectively.
Consider the following list of the integer:19, 23, 40, 32, 91, 25, 100, 36Sort this list in increasing order using insertion sort and determine the number of passes, comp...
401
views
asked
Nov 17, 2018
0
votes
0
answers
32
#Self-doubt
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is: a) O(logn) b)O(n) c)O(1) d)O(log*n)
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is:a) O(logn)b)O(n)c)O(1)d)O(log*n)
303
views
asked
Nov 17, 2018
0
votes
0
answers
33
#Regular_Languages
can anyone explain why is L1 regular??? Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences of (110)’s as (011)’s}.
can anyone explain why is L1 regular???Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences of (110)’s as (011)’s}.
356
views
asked
Nov 12, 2018
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register