Канал: Learner Geek

What is the command to move a file?

What is the command to move a file?

What is the command to copy a file?

What is the command to copy a file?

What is the command to delete a file?

What is the command to delete a file?

What is the command to create a new directory?

What is the command to create a new directory?

What is the command to change the permissions of a file?

What is the command to change the permissions of a file?

What is the command to list all files in a directory?

What is the command to list all files in a directory?

What is the command to print the current working directory?

What is the command to print the current working directory?

Chatting with Google Bard: Ask Me Anything!

Chatting with Google Bard: Ask Me Anything!

How to Add JavaScript to Your Website: In-Line, External, and Console Methods in Hindi.

How to Add JavaScript to Your Website: In-Line, External, and Console Methods in Hindi.

On which of the following port number oracle connections are listened.

On which of the following port number oracle connections are listened.

Maximum length of hostname:

Maximum length of hostname:

How to configure Telnet on CISCO router in CISCO packet tracer

How to configure Telnet on CISCO router in CISCO packet tracer

How to connect two different networks using routing in Cisco Packet Tracer.

How to connect two different networks using routing in Cisco Packet Tracer.

How to change the font of CLI in Cisco Packet Tracer.

How to change the font of CLI in Cisco Packet Tracer.

Connect two PC and check whether They are pinging with each other or not || CISCO Packet Tracer.

Connect two PC and check whether They are pinging with each other or not || CISCO Packet Tracer.

Abbreviate the term DBCA?

Abbreviate the term DBCA?

In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

What is the number of edges present in a complete graph having n vertices?

What is the number of edges present in a complete graph having n vertices?

What is the maximum number of edges in a bipartite graph having 10 vertices?

What is the maximum number of edges in a bipartite graph having 10 vertices?

A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

The space required by an algorithm is equal to the sum of ________ components.

The space required by an algorithm is equal to the sum of ________ components.

Which of the following is a theoretical analysis of an algorithm?

Which of the following is a theoretical analysis of an algorithm?

Data Structure MCQs Challenge #005

Data Structure MCQs Challenge #005

Data Structure MCQs Challenge #004

Data Structure MCQs Challenge #004

Data Structure MCQs Challenge #003

Data Structure MCQs Challenge #003

Data Structure MCQs Challenge #002

Data Structure MCQs Challenge #002

Data Structure MCQs Challenge #001

Data Structure MCQs Challenge #001

An algorithm should have _______ well-defined inputs.

An algorithm should have _______ well-defined inputs.

Not all procedures can be called an algorithm.

Not all procedures can be called an algorithm.

Asymptotic analysis is _______ bound.

Asymptotic analysis is _______ bound.

Ο(log n) is?

Ο(log n) is?

Which of the following is linear asymptotic notations?

Which of the following is linear asymptotic notations?

Worst Case indicates maximum time required for program execution.

Worst Case indicates maximum time required for program execution.

Which case indicate the minimum time required for program execution?

Which case indicate the minimum time required for program execution?

If the array is already sorted, then the running time for merge sort is?

If the array is already sorted, then the running time for merge sort is?

Which algorithm is having highest space complexity?

Which algorithm is having highest space complexity?

Two main measures for the efficiency of an algorithm are:

Two main measures for the efficiency of an algorithm are:

Time complexity of binary search algorithm is constant.

Time complexity of binary search algorithm is constant.

The time complexity of linear search is given by:

The time complexity of linear search is given by:

The time complexity of binary search is given by:

The time complexity of binary search is given by:

The worst case complexity of quick sort is

The worst case complexity of quick sort is

The worst case complexity for insertion sort is

The worst case complexity for insertion sort is

The complexity of Bubble sort algorithm is

The complexity of Bubble sort algorithm is

The complexity of merge sort algorithm is

The complexity of merge sort algorithm is

The complexity of Binary search algorithm is

The complexity of Binary search algorithm is

The complexity of Fibonacci series is

The complexity of Fibonacci series is

The complexity of linear search algorithm is

The complexity of linear search algorithm is

Which of the following case does not exist in complexity theory?

Which of the following case does not exist in complexity theory?

The largest element of an array index is called its

The largest element of an array index is called its

The extra key inserted at the end of the array is called a

The extra key inserted at the end of the array is called a

The smallest element of an array's index is called its

The smallest element of an array's index is called its

An algorithm should have _________ well-defined outputs.

An algorithm should have _________ well-defined outputs.

Which of the following sorting algorithm is of divide-and-conquer type?

Which of the following sorting algorithm is of divide-and-conquer type?

O(1) means computing time is?

O(1) means computing time is?

Data items that cannot be divided are called as?

Data items that cannot be divided are called as?

Which of the following is not a Characteristics of a Data Structure?

Which of the following is not a Characteristics of a Data Structure?

Which case of data structure operation takes maximum time?

Which case of data structure operation takes maximum time?

The following name does not relate to stacks

The following name does not relate to stacks

Minimum how many stacks are needed to implement a queue

Minimum how many stacks are needed to implement a queue

When new data are to be inserted into a data structure , but there is no available space...

When new data are to be inserted into a data structure , but there is no available space...

Linear Search is best for

Linear Search is best for

A linear collection of data elements where the linear node is given by means of pointer is called

A linear collection of data elements where the linear node is given by means of pointer is called

Another Name for substitution method is ?

Another Name for substitution method is ?

Master Theorem is used to solve?

Master Theorem is used to solve?

A function which calls itself is called?

A function which calls itself is called?

We use theta notation for?

We use theta notation for?

Omega Notation is also known as

Omega Notation is also known as

Describes the running time of an algorithm?

Describes the running time of an algorithm?

Function is to specify the data type?

Function is to specify the data type?

When the data structure is combined with its operation then, the data structure is known as?

When the data structure is combined with its operation then, the data structure is known as?

Stack is based on which principle?

Stack is based on which principle?

User defined data type is also called?

User defined data type is also called?

Data Structure that allows fast search within an ordered sequence of elements is called ?

Data Structure that allows fast search within an ordered sequence of elements is called ?

Which notation is used to find the complexity of an algorithm?

Which notation is used to find the complexity of an algorithm?

Queue is based on which principle?

Queue is based on which principle?

Which of the following is non-linear data structure?

Which of the following is non-linear data structure?

Which of the following is linear data structure?

Which of the following is linear data structure?