537 questions and answers
What do you mean by mobile communication? What are the advantages of mobile communication over PSTN? What is the difference between network protocol and network architecture?
A wireless mode of communication in which the voice and the data information are send, transmitted and received via microwaves. This type of communication allows the users to communicate with each other while moving from one place to another.
What are the differences between destination sequence distance vector and the standard distance vector routing algorithms? What are the frequency bands of operation for CDMA?
Difference between destination sequence vector and standard distance vector routing:
Why does CSMA/CD not work for medium access control of WLAN? What is the alternative mechanism of CSMA/CD? Write steps of operation to implement such an alternative mechanism.
The basic idea behind CSMA/CD is that a station needs to be able to receive while transmitting to detect collision. When there is a collision the station receives two signal: its own signal and the signal transmitted by a second station.
What is meant by access control? What are the contention-based and contention free access control mechanisms?
When two or more stations are connected with each other using the same link(multipoint or broadcast link), there is a need of multiple access protocol to coordinate access to the link, which decides when and which station should be access the link.
Write short notes on
A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’ or ‘v’ is in vertex cover. Although the name is Vertex Cover, the set covers all edges of the given graph.
Define classes P,NP,NP hard and NP-complete and also explain their relationship diagrammatically. What is nondeterministic algorithm? Explain with example. Define circuit satisfiability problem and prove that circuit SAT is in NP class.
P- P is the set of decision (or optimization) problems that can be solved by a deterministic algorithm in polynomial time, i.e. O(nk) time where n is the input size and K is non negative value independent of n.
State the Max-flow min cut theorem for network flow analysis. Trace the execution of Ford-Fulkerson algorithm for finding the maximum flow in the graph.
Max-flow min cut theorem for network flow analysis: If f is a flow in a flow network G(V,E) with source s and sink t, then the following conditions are equivalent:
Write the string matching algorithm due to Knuth,Moris and Pratt. Analyze its time complexity.
Knuth,Moris and Pratt algorithm scan the text array T[1……n] to find that whether a pattern array P[1………..n] appears in the text array by using the auxiliary function П which is called the prefix function.
Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.
Deadlines and profits are mentioned as follows:
Write short notes on
A minimum spanning tree is a spanning tree of a connected, undirected graph. It connects all the vertices together with the minimal total weighting for its edges. A single graph can have many different spanning trees.
MindStudy - a preparation hub for all the students. The goal is to make it easier for pupils to get better grades on exams.
Copyright © 2025 MindStudy
A product by Shunya Intelliware Solution
(Registered under MSME Uddyam)