1
GATE CSE 1995
+1
-0.3
For merging two sorted lists of sizes m and n into a sorted list of size m+n, we require comparisons of
A
O(m)
B
O(n)
C
O(m+n)
D
O(log m + log n)
2
GATE CSE 1995
+1
-0.3
Which of the following statements is true?
I. As the number of entries in a hash table increases, the number of collisions increases.
II. Recursive programs are efficient
III. The worst case complexity for Quicksort is O(n2)
IV. Binary search using a linear linked list is efficient.
A
I and II
B
II and III
C
I and IV
D
I and III
3
GATE CSE 1995
+1
-0.3
Merge sort uses
A
Divide and conquer strategy
B
Backtracking approach
C
Heuristic search
D
Greedy approach
4
GATE CSE 1995
+1
-0.3
In some programming languages, an identifier is permitted to be a letter following by any number of letters or digits. If L and D denote the sets of letters and digits respectively, which of the following expressions defines an identifier?
A
$${\left( {L \cup D} \right)^ + }$$
B
$$L{\left( {L \cup D} \right)^*}$$
C
$${\left( {L.D} \right)^*}$$
D
$$L{\left( {L.D} \right)^*}$$
GATE CSE Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Medical
NEET