Crowdly

Add to Chrome

Universities
lms2.ai.saveetha.in
19AI305 - Advanced C Programming

19AI305 - Advanced C Programming

Looking for 19AI305 - Advanced C Programming test answers and solutions? Browse our comprehensive collection of verified answers for 19AI305 - Advanced C Programming at lms2.ai.saveetha.in.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

Which of the following is an advantage of implementing a stack using a linked list instead of an array?

It allows random access to elements.

It has a fixed size, preventing memory wastage.

It requires less memory per element compared to an array.

It dynamically grows and shrinks as needed.

View this question

Which of the following is TRUE about a stack implemented using a linked list?

It dynamically allocates memory as elements are pushed.

100%

It follows the FIFO (First In, First Out) principle.

It cannot be implemented using pointers.

It requires a fixed amount of memory before execution.

View this question

What is the time complexity of the push operation in a stack implemented using a linked list?

If "DCBA" is given, what will be the next lexicographical permutation?

CBDA

DCAB

ABCD

No next permutation (already the last)

View this question

What is the last permutation in lexicographical order for the string "ABC"?

BAC

CBA

ACB

ABC

View this question

What is the first permutation in lexicographical order for the string "CAB"?

CAB

ACB

ABC

BAC

View this question

What is the lexicographically next permutation of "ACB"?

CAB

ABC

BCA

BAC

View this question

What does "lexicographical order" mean in permutations?

Arranging permutations randomly

❌

Arranging permutations based on length

❌

Arranging permutations in dictionary order

✅

Arranging permutations in descending order

❌

View this question

Which of the following statements about recursion in Fibonacci series is true?

It always has a linear time complexity

It leads to stack overflow for large values of n

It does not use extra memory

It is always better than iteration

View this question

What is the number of recursive calls made for fib(4) (including the initial call)?

View this question

Want instant access to all verified answers on lms2.ai.saveetha.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome

Telegram Instagram TikTok Question Bank

Add to Chrome