List of top Computer Science & Information Technology Questions on Computer Languages and Algorithms asked in TS PGECET

Visual Basic is an example of

The logic of a program is called

Which characteristic ensures that an algorithm does not run forever?

Flowcharts are mainly used for

Flowcharts help in detecting errors during

What is the size of the set of all subsets of \(n\) elements in sum of subsets problem?

What is the cost of the minimum spanning tree of the below graph using Prim's algorithm?

Match the following algorithms with their worst-case time complexities.

Choose all design strategies to solve different types of knapsack problems?

Which sorting algorithm has the same time complexity for all the cases-best, average, worst?

What is the time complexity in Big-Oh notation for \[ f(n)=a_{m}n^{m}+\cdots+a_{1}n+a_{0}? \]

Choose the pair of sorting algorithms using divide and conquer strategy.

Find the optimal solution for knapsack instance \[ n=3,\quad m=20, \] \[ (p_1,p_2,p_3)=(25,24,15) \] and \[ (w_1,w_2,w_3)=(18,15,10). \]

Which algorithm design strategy is used to find single source shortest paths?

What is the purpose of Bellman-Ford algorithm?