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
Zeal Test Series 2019: Compiler Design - Parsing
Prince Sindhiya
asked
in
Compiler Design
Dec 21, 2018
edited
Mar 7, 2019
by
ajaysoni1924
238
views
0
votes
0
votes
zeal
compiler-design
parsing
zeal2019
Prince Sindhiya
asked
in
Compiler Design
Dec 21, 2018
edited
Mar 7, 2019
by
ajaysoni1924
by
Prince Sindhiya
238
views
answer
comment
Follow
share this
share
2 Comments
by
arvin
commented
Dec 21, 2018
reply
Follow
share this
i am getting 2.66 process is a bit complicated... i just wish its correct.
0
0
by
Prince Sindhiya
commented
Dec 23, 2018
reply
Follow
share this
Answer is 1
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
Prince Sindhiya
asked
in
Mathematical Logic
Jan 7, 2019
435
views
Zeal Test Series 2019: Mathematical Logic - Propositional Logic
Isn’t the 3) statement is wrong it should be [(p->r)^(q->r)]->[(p∨q)->r] \
Prince Sindhiya
asked
in
Mathematical Logic
Jan 7, 2019
by
Prince Sindhiya
435
views
zeal
discrete-mathematics
mathematical-logic
propositional-logic
zeal2019
1
vote
1
vote
0
answers
2
Prince Sindhiya
asked
in
Algorithms
Jan 2, 2019
304
views
Zeal Test Series 2019: Algorithms - Time Complexity
A sorted array of n elements which has been circularly shifted. For example, {18,25,1,5,11,16} is a sorted array that has been circularly shifted by 2 positions. suppose a person has to find the largest element in a circularly shifted array. Here, there ... been shifted is unknown. find time complexity. 1. O(nlogn) 2. O(n) 3. O(n^2) 4. O(logn)
Prince Sindhiya
asked
in
Algorithms
Jan 2, 2019
by
Prince Sindhiya
304
views
zeal
algorithms
time-complexity
zeal2019
0
votes
0
votes
1
answer
3
Prince Sindhiya
asked
in
Databases
Jan 2, 2019
384
views
Zeal Test Series 2019: Databases - Er Diagram
Match the following: (a) Create (i) The E-R Model (b) Select (ii) Relationship Model (c) Rectangle (iii) DDL (d) Record (iv) DML in answer a is matched with dml but what i know ---select is for data retrival and insert update delete are for DML
Prince Sindhiya
asked
in
Databases
Jan 2, 2019
by
Prince Sindhiya
384
views
databases
er-diagram
zeal
zeal2019
0
votes
0
votes
1
answer
4
Prince Sindhiya
asked
in
DS
Jan 2, 2019
450
views
Zeal Test Series 2019: Programming & DS - Binary Tree
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
Prince Sindhiya
asked
in
DS
Jan 2, 2019
by
Prince Sindhiya
450
views
zeal
data-structures
binary-tree
zeal2019
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy