search
Log In

Recent posts tagged questions

1
Choose the correct alternatives ( more than one may be correct) and write the corresponding letters only: (viii) A non-planar graph with minimum number of vertices has (a) 9 edges, 6 vertices (b) 6 edges, 4 vertices (c) 10 edges, 5 vertices (d) 9 edges, 5 vertices
posted Dec 28, 2016 in Programming & Data Structures Arjun 2,922 views
2
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length. The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
posted Dec 28, 2016 in Digital Logic Arjun 4,289 views
3
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following problems is not $NP$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
posted Dec 28, 2016 in Compiler Design Arjun 3,436 views
4
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (v). Start and stop bits do not contain any 'information' but are used in serial communication Error detection Error correction Synchronization Slowing down the communications
posted Dec 28, 2016 in Databases Arjun 3,211 views
To see more, click for the full list of questions or popular tags.
...