@

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

NIELIT 2018-41

Arjun asked in Programming in C Dec 7, 2018 recategorized Oct 24, 2020 by Krithiga2101

2,997 views

1 vote

1 vote

____ is used to convert from recursive to iterative implementation of an algorithm

Array
Tree
Stack
Queue

nielit-2018
data-structures

Arjun asked in Programming in C Dec 7, 2018 recategorized Oct 24, 2020 by Krithiga2101

by Arjun

3.0k views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

3 votes

3 votes

Since function calls are executed in Last In First Out order, stack is the data structure for converting recursive to iterative implementation.

OPTION C.

Asim Siddiqui 4 answered Feb 16, 2019

by Asim Siddiqui 4

0 Comments

Please log in or register to add a comment.

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

1 vote

1 vote

3 answers

1

Arjun asked in DS Dec 7, 2018

1,273 views

NIELIT 2018-37
The smallest element that can be found in time ____ in a binary max heap. $O(n \log n)$ $O( \log n)$ $O(n)$ $O(n^2)$

Arjun asked in DS Dec 7, 2018

by Arjun

1.3k views

nielit-2018
data-structures
binary-heap

5 votes

5 votes

5 answers

2

Arjun asked in DS Dec 7, 2018

2,112 views

NIELIT 2018-54
______ to evaluate an expression without any embedded function calls. Two stacks are required one stack is needed Three stacks are required More than three stacks are required

Arjun asked in DS Dec 7, 2018

by Arjun

2.1k views

nielit-2018
data-structures
stack
expression-evaluation

1 vote

1 vote

2 answers

3

Arjun asked in DS Dec 7, 2018

3,423 views

NIELIT 2018-65
For a given hash table $T$ with $10$ slots that stores $1000$ elements, the load factor $\alpha$ for $T$ is $100$ $0.01$ $200$ $1.05$

Arjun asked in DS Dec 7, 2018

by Arjun

3.4k views

nielit-2018
data-structures
hashing

1 vote

1 vote

1 answer

4

Arjun asked in DS Dec 7, 2018

4,255 views

NIELIT 2018-67
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree $O(n)$ $O(n \log n)$ $O( \log n)$ for search and insert, and $O(n)$ for delete None of these

Arjun asked in DS Dec 7, 2018

by Arjun

4.3k views

nielit-2018
data-structures
binary-search-tree

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)
- Programming (4.1k)
  - Programming in C (4.1k)
  - Programming in Python (5)
- DS (2.0k)
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:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!