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 manikgupta123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by manikgupta123
0
votes
0
answers
1
Bits HD 2019
In a microprocessor, size of register is generally: Lesser than the size of the data it operates on Greater than the size of the data it operates on Equal to the size of the data it operates on
asked
in
CO and Architecture
May 29, 2019
891
views
bits
bits-hd
co-and-architecture
microprocessors
registers
3
votes
4
answers
2
IIIT PGEE 2019
What is the time complexity to delete an arbitrary node from binary heap? O(n) O(log n) O(1) O(n log n)
asked
in
Programming in C
Apr 29, 2019
1.8k
views
iiith-pgee
time-complexity
binary-heap
1
vote
4
answers
3
IIIT PGEE 2019
Which of the following gives O(1) complexity if we want to check whether an edge exists between two given nodes in a graph? Adjacency List Adjacency Matrix Incidence Matrix None of these
asked
in
DS
Apr 29, 2019
1.3k
views
iiith-pgee
graph-theory
time-complexity
0
votes
1
answer
4
IIIT PGEE 2019
Which part in 8086 microprocessor is responsible for fetching instructions into the queue? BIU EU Stack Registers
asked
in
CO and Architecture
Apr 29, 2019
972
views
iiith-pgee
co-and-architecture
8086
microprocessors
3
votes
3
answers
5
PGEE 2019
for(int i=0; i<=100;i++) { if (i % 3 == 0) printf("Great); if(i%5 == 0) printf("India"); } Count the number of times GreatIndia is printed. 6 20 33 none of these
asked
in
Programming in C
Apr 29, 2019
1.9k
views
iiith-pgee
loop
counting
programming
3
votes
2
answers
6
IIIT PGEE 2019
How many pairs of positive integers do $m$ and $n$ satisfy in $\frac{1}{m}+\frac{4}{n}=\frac{1}{12}, $ where $n$ is odd and less than $60?$ 3 5 7 9
asked
in
Quantitative Aptitude
Apr 28, 2019
1.1k
views
iiith-pgee
general-aptitude
3
votes
4
answers
7
IIIT PGEE 2019
What is the time complexity for insertion in binary tree in worst case? O(1) O(log n) O(n) O(n log n)
asked
in
Programming in C
Apr 28, 2019
1.7k
views
iiith-pgee
binary-tree
time-complexity
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...