Internet programming

The term "phylogenetic tree” is used in:

Consider the following terminologies used in phylogenetic analysis

Choose the correct answer from the options given below:

The number of possible unrooted trees for 5 operational taxonomic units is

Which of the following are non linear type of data structure?

Choose the correct answer from the options given below:

In bioinformatics, the term "homology" refers to:

Which of the following is an example of a bioinformatics algorithm used for sequence alignment?

Given below are two statements regarding substitution matrices

In light of the above statements, choose the most appropriate answer from the options given below.

Which one of the following is a FIFO data structure

of a set of n elements is an arrangement of the elements in a given order:

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

Match List-I with List-II based on Abstract Data Type (ADT) concepts:

Choose the correct answer from the options given below :

Suppose a circular queue of capacity (n— 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are:

The notation is used when the function g(n) defines a lower bound for the function f(n).

In context of Lexical Analyzer, Sw represents:

The lexical analysis of various modern computer languages like Java requires the power of which of these machine models ina sufficient and necessary sense?

Which of the following problems is undecidable?

Consider the context-free grammar $G$: $$S \to aSb \mid X$$ $$X \to aX \mid Xb \mid a \mid b$$ where $S$ and $X$ are non-terminals, and $a, b$ are terminals. Starting non-terminal is $S$. Which statement is CORRECT?

Consider the Deterministic Finite Automata (DFA) on alphabet {0, 1} with states {s, p, q, r}, start state s and single final state p. Which regular expression describes the language accepted?