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
Recent questions tagged goclasses_wq9
8
votes
2
answers
1
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 1
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as $\textit{prev}$ ... $6 \leftrightarrow 5 \leftrightarrow 4 \leftrightarrow 3 \leftrightarrow 1 \leftrightarrow 2$
GO Classes
asked
in
DS
May 5
by
GO Classes
1.6k
views
goclasses_wq9
goclasses
data-structures
linked-list
1-mark
6
votes
2
answers
2
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 2
Consider the following function Merge() that takes the head of two linked lists. struct node { int value; struct node *next; }; typedef struct node Node; Node * Merge(Node * head1, Node * head2) { if (head1 == ... $\text{List}2: 2\rightarrow 4\rightarrow 6\rightarrow 8\rightarrow 10 \rightarrow 12\rightarrow \text{Null}$
GO Classes
asked
in
DS
May 5
by
GO Classes
458
views
goclasses_wq9
goclasses
data-structures
linked-list
multiple-selects
1-mark
6
votes
2
answers
3
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 3
What is the run-time complexity of inserting a new element at the beginning of a circular, doubly-linked list with a head? $O(1)$ $O(\log \text{N})$ $O(\text{N})$ $O(\text{N}^2)$
GO Classes
asked
in
DS
May 5
by
GO Classes
263
views
goclasses_wq9
goclasses
data-structures
linked-list
time-complexity
1-mark
9
votes
1
answer
4
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 4
Given a circular, doubly-linked list whose contents are sorted in ascending order, what is the run-time complexity for inserting a new element into the list so that it remains correctly sorted? (Including the time required to search for the element’s correct position.) $O(1)$ $O(\log \text{N})$ $O(N)$ $O(\text{N}^{2})$
GO Classes
asked
in
DS
May 5
by
GO Classes
359
views
goclasses_wq9
goclasses
data-structures
linked-list
time-complexity
1-mark
10
votes
2
answers
5
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 5
Consider a function findCLL that takes a doubly circular linked list head and an integer value as input. One example of doubly circular linked list is given below - int findCLL(struct node * first, int n) { while (first -> value != n) ... $\text{S2}$ is True but $\text{S1}$ is False. Both are True. Both are False.
GO Classes
asked
in
DS
May 5
by
GO Classes
282
views
goclasses_wq9
goclasses
data-structures
linked-list
1-mark
6
votes
2
answers
6
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 6
Consider the following Doubly Linked List: If head points to the first node of the linked list then what will be the output of the following node? head=head->next->next->next->prev; head->next->next->prev=head; printf("%d",head->next->next->prev->next->value); $1$ $3$ $5$ $7$
GO Classes
asked
in
DS
May 5
by
GO Classes
232
views
goclasses_wq9
goclasses
data-structures
linked-list
1-mark
8
votes
1
answer
7
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 7
Consider the following program. printlist() is a function that takes the head of a linked list and prints all nodes values separated by comma. Node is typedefed singly linked list type struct. void insert1(Node *head,int data) { Node *NewNode= (Node *) ... Line $\text{X}$ prints $1,2,3,4,5$ Line $\text{Y}$ prints $1,2,3,4,5$
GO Classes
asked
in
DS
May 5
by
GO Classes
319
views
goclasses_wq9
goclasses
data-structures
linked-list
multiple-selects
1-mark
4
votes
2
answers
8
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 8
If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that $f(n) = o(g(n)).$ $f(n) = \theta(g(n)).$ $f(n) = \omega(g(n)).$ both A and B are always true.
GO Classes
asked
in
Programming
May 5
by
GO Classes
200
views
goclasses_wq9
goclasses
algorithms
asymptotic-notations
1-mark
7
votes
1
answer
9
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 9
Consider the following function fun() that takes the head of a linked list. struct node { int value; struct node *next; }; typedef struct node Node; int fun(Node *head){ if(head== NULL) return 1; Node *p,*q; p = ... $0$ is length of the linked list is even Function may go to infinite loop if there is a loop in linked list
GO Classes
asked
in
DS
May 5
by
GO Classes
423
views
goclasses_wq9
goclasses
data-structures
linked-list
2-marks
5
votes
3
answers
10
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 10
Consider the following function foo() which takes the head pointer of two singly-linked lists. struct node *foo(struct node *head1, struct node *head2) { struct node *final, *temp; if (head1 == NULL) return head2; if (head2 == NULL) return head1; temp = foo ... $1,2,3,4,5,7,8,10,9,10$ $1,2,3,4,5,8,7,10,9,10$ None of these
GO Classes
asked
in
DS
May 5
by
GO Classes
296
views
goclasses_wq9
goclasses
data-structures
linked-list
2-marks
3
votes
2
answers
11
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 11
A doubly linked list is declared as: struct Node { int Value; struct Node *prev; struct Node *next; }; Which of the following segment of code deletes the node pointed to by $\text{X}$ from the doubly linked list, if it is ... $; \text{X} \rightarrow$ next $\rightarrow$ prev $= \text{X} \rightarrow$ next; free(X);
GO Classes
asked
in
DS
May 5
by
GO Classes
257
views
goclasses_wq9
goclasses
data-structures
linked-list
2-marks
3
votes
2
answers
12
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 12
Which of the following statement(s) is/are true? If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(f(x), g(x))$ If $\text{T}(x) = \text{O}(cf(x)),$ ... then $\text{T1}(x) \ast \text{T2}(x) = \text{O}(f(x) \ast g(x))$ $2^{(n+1)} = \text{O}(2^{n} ).$
GO Classes
asked
in
Programming
May 5
by
GO Classes
204
views
goclasses_wq9
goclasses
algorithms
asymptotic-notations
multiple-selects
2-marks
5
votes
2
answers
13
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 13
Consider two statements below - $\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$ $\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n))$ ... $\text{S1}$ is True but $\text{S2}$ is False. $\text{S2}$ is True but $\text{S1}$ is False. Both are True. Both are False.
GO Classes
asked
in
Programming
May 5
by
GO Classes
608
views
goclasses_wq9
goclasses
algorithms
asymptotic-notations
2-marks
5
votes
2
answers
14
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 14
Which of the following(s) is/are true? If $f(n) = O(n^2)$ then $f(n) = O(n).$ If $f(n)$ is $O(3^{\log_{10}n}),$ then $f(n)$ is $O(n^2).$ The function $f(n) = \lg(n!) = O(n \lg n).$ Growth of the sum $1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n}$ can be described by $\theta(\log n).$
GO Classes
asked
in
Programming
May 5
by
GO Classes
319
views
goclasses_wq9
goclasses
algorithms
asymptotic-notations
multiple-selects
2-marks
To see more, click for the
full list of questions
or
popular tags
.
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged goclasses_wq9
Recent Blog Comments
previous years than GATE 2010 paper
Which link are you referring to?
@Arjun I am not able to see GATE 2010...
Should be working now
@Arjun Sir but it is not working. i dont know...