menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Others
(1.1k)
Study Resources
(143)
GATE Application
(40)
Revision
(40)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
seems like you really enjoyed the process.......
I wrote an email to IISC regarding JEST 2021 but...
B.Tech students are eligible only for Integrated...
I tried calling IISC Admission Dept, but they...
Mock 2 are live now.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
KPGCET-CSE-2019-67
0
votes
42
views
The postfix notation for infix notation $a^*(b+c)+d÷e$ is given by
$abc^*+de ÷ +$
$abc+^*de ÷ +$
$abcde +^*÷ +$
$abc^*+de + ÷$
kpgcet-cse-2019
asked
Aug 4, 2019
in
Others
gatecse
recategorized
Aug 6, 2019
by
jothee
42
views
answer
comment
0
Option B
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
1
answer
1
58
views
KPGCET-CSE-2019-2
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attribute with other attribute/s None of these
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attribute with other attribute/s None of these
asked
Aug 4, 2019
in
Others
gatecse
58
views
kpgcet-cse-2019
0
votes
1
answer
2
63
views
KPGCET-CSE-2019-4
The schema for the entire database is designed using Data definitional language Structured query language Data manipulation language Schema structure language
The schema for the entire database is designed using Data definitional language Structured query language Data manipulation language Schema structure language
asked
Aug 4, 2019
in
Others
gatecse
63
views
kpgcet-cse-2019
0
votes
0
answers
3
42
views
KPGCET-CSE-2019-12
The Software Development Life Cycle (SDLC) is used in all Process models Design models Programming models None of these
The Software Development Life Cycle (SDLC) is used in all Process models Design models Programming models None of these
asked
Aug 4, 2019
in
Others
gatecse
42
views
kpgcet-cse-2019
0
votes
0
answers
4
36
views
KPGCET-CSE-2019-15
The complexity of algorithms is comparatively more accurate in the use of Asymptotic analysis Amortized analysis Both of these Not dependent on the nature of analysis.
The complexity of algorithms is comparatively more accurate in the use of Asymptotic analysis Amortized analysis Both of these Not dependent on the nature of analysis.
asked
Aug 4, 2019
in
Others
gatecse
36
views
kpgcet-cse-2019
...
