Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Nitesh_Yadav
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Nitesh_Yadav
2
votes
3
answers
1
Array
An array VAL[1..15][1..10] is stored in the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL[12][9] when the array VAL is stored in Row wise. ?
asked
in
Programming
Jul 3, 2022
657
views
array
programming-in-c
data-structures
0
votes
1
answer
2
Applied Root Test Series
Let C(X) be the number of leaves in a binary tree rooted at T. Assume that IsLeaf(T) returns I if T is a leaf. Which of the following observations leads to a recursive implementation? C(T)=C(T.Left) +C(T.Right) C(T):C(T.Left)+C(T.Right)+1 C(T)=C(T.Left]+C(T.right)+Isleaf(T)
asked
in
Programming
Apr 12, 2022
124
views
recursion
programming-in-c
0
votes
2
answers
3
Test Series
What is the time complexity of the below mentioned recursive function. int f(n) { if(n!=1) { return f(n/2)+f(n/2); } else return 10; } O(n) O(n^2) O(log n) O(n logn)
asked
in
Algorithms
Apr 11, 2022
121
views
algorithms
time-complexity
recursion
test-series
0
votes
2
answers
4
#Quicksort
In Quicksort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function? Assume we are sorting in increasing order. 11, 15, 9, 13, 17, 7, 5, 12, 6, 18
asked
in
Algorithms
Apr 8, 2022
190
views
algorithms
quick-sort
0
votes
0
answers
5
#aktu university
Solve this question
asked
in
Theory of Computation
Jan 11, 2022
90
views
theory-of-computation
finite-automata
0
votes
1
answer
6
#Made Easy Test Series
Find the time complexity of the given program
asked
in
Algorithms
Jan 4, 2022
274
views
made-easy-test-series
algorithms
time-complexity
0
votes
1
answer
7
#aktu #aktu 2016-17
please provide the solution
asked
in
Algorithms
Dec 29, 2021
168
views
algorithms
knapsack-problem
1
vote
1
answer
8
Made Easy Test Series
asked
in
Databases
Dec 24, 2021
315
views
made-easy-test-series
databases
0
votes
2
answers
9
Made Easy test series
SR conflict in LR(0) and SLR(1) will always be equal for some context free grammar?
asked
in
Compiler Design
Dec 22, 2021
738
views
compiler-design
made-easy-test-series
parsing
0
votes
1
answer
10
#Made easy
Let N stations share 40kbps of pure aloha channel. Frame size is 512 bits which are send at every 40 seconds. The maximum value of N is ____
asked
in
Computer Networks
Dec 10, 2021
272
views
made-easy-test-series
test-series
computer-networks
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2