As you want to download question paper of AP PGECET Exam with CSE discipline, so here I am providing following question paper:

AP PGECET Question Paper CSE Discipline

If a homogeneous system of n equations in n unknowns AX = 0 has nontrivial solution if
(A) |A| = 0 (B) |A| = n (C) |A| = 1 (D) |A| ≠ 0

If f(x) = (x – 1)(x – 2) is defined in the interval [1,3] the value of c at which the Lagrange
Mean Value is satisfied at
(A) c = 0 (B) c = 3 / 2 (C) c = 1 (D) c = 2

The total number of possible records in a database table, if it contains two fields, a
5-letter name, and a 2-digit age, is
(A) 1188137600 (B) 3906252 × 1010
(C) 11881476 (D) 2600

Number of ways a row of n houses can be painted with k colours such that no two
consecutive houses can have same colours
(A) n.(n-1).(n-2) … (n+k-1) (B) n.(n-1).(n-2) … (n-k+1)
(C) (n-1)k-1 (D) k.(k-1)n-1
The graph G is said to be k-edge-connected, if its edge-connectivity λ(G) is
(A) equal to k (B) not equal to k
(C) greater than or equal to k (D) less than or equal to k

A planar graph has the following property :
(A) It can be drawn such that edges do not cross
(B) There are more edges than the number of vertices
(C) Every vertex is connected by at least one edge
(D) It can not be drawn on a non planar surface

The following algorithm is not for finding MST
(A) Dijkstra’s (B) Borůvka’s algorithm
(C) Prim’s (D) Kruskal’s

If a graph A can be redrawn such that it looks exactly like graph B, then
(A) A is dual of B (B) A and B are isomorphic
(C) A and B are isographs (D) A is a line graph of B

Minimum vertex cover problem seeks to find
(A) the minimum set of vertices such that each edge of the graph is incident to at least
one vertex of the set
(B) the minimum set of vertices such each can be given a unique colour
(C) the minimum set of edges that join each vertex of the graph
(D) the minimum set of vertices such that each face of graph is touched by at least one
vertex of the set

A graph that contains no loops is called
(A) a connected graph (B) an acyclic graph
(C) a simple graph (D) a bipartite graph

Warshall’s algorithm is used to compute the following of a graph:
(A) Induced subgraph (B) Adjacency matrix
(C) Chromatic number (D) Reachability matrix

Which of the following sentences is not a proposition ?
(A) The sky is blue (B) 5 + 7 = 10
(C) a = 100 (D) 3 is a root of x2 – 9

AP PGECET Question Paper CSE Discipline

Attached Files

AP PGECET Question Paper CSE Discipline .pdf (109.9 KB, 81 views)