All India Computer Science Engineering (CSE) Group
A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91,3, 8, 37,60, 24. The number of nodes in the left subtree and right subtree of the root respectively is- a)(4,7)
- b)(7,4)
- c)(8, 3)
- d)(3,8)
Correct answer is option 'B'. Can you explain this answer?
A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91,3, 8, 37,60, 24. The number of nodes in the left subtree and right subtree of the root respectively is
a)
(4,7)
b)
(7,4)
c)
(8, 3)
d)
(3,8)
|
Vaibhavi Dyavarkonda answered • 2 weeks ago |
B
|
Dipali Bhatt
asked a question
|
In an expression involving || operator, evaluation
I. Will be stopped if one of its components evaluates to false
II. Will be stopped if one of its components evaluates to true
III. Takes place from right to left
IV. Takes place from left to right- a)I and II
- b)I and III
- c)II and III
- d)II and IV
Correct answer is option 'D'. Can you explain this answer?
In an expression involving || operator, evaluation
I. Will be stopped if one of its components evaluates to false
II. Will be stopped if one of its components evaluates to true
III. Takes place from right to left
IV. Takes place from left to right
I. Will be stopped if one of its components evaluates to false
II. Will be stopped if one of its components evaluates to true
III. Takes place from right to left
IV. Takes place from left to right
a)
I and II
b)
I and III
c)
II and III
d)
II and IV
Find the Output ?#include "stdio.h"int main() { int x, y = 5, z = 5; x = y == z; printf("%d", x); getchar(); return 0; }- a)0
- b)1
- c)5
- d)Compiler Error
Correct answer is option 'B'. Can you explain this answer?
Find the Output ?
#include "stdio.h"
int main()
{
int x, y = 5, z = 5;
x = y == z;
printf("%d", x);
getchar();
return 0;
}
a)
0
b)
1
c)
5
d)
Compiler Error
|
Naveen Kumar answered • 3 weeks ago |
In that statement they have considered equal operator ==
which means the value for x returns true if y and z are equal that indicates 1 otherwise 0
which means the value for x returns true if y and z are equal that indicates 1 otherwise 0
Which of the following is not a type of database?- a)Hierarchical
- b)Network
- c)Distributed
- d)Decentralized
Correct answer is option 'D'. Can you explain this answer?
Which of the following is not a type of database?
a)
Hierarchical
b)
Network
c)
Distributed
d)
Decentralized
|
Gate Gurus answered • 3 weeks ago |
Different types are:
1) Centralized
2) Distributed
3) Relational
4) NoSQL
5) Cloud
6) Object-oriented
7) Hierarchical
8) Network
1) Centralized
2) Distributed
3) Relational
4) NoSQL
5) Cloud
6) Object-oriented
7) Hierarchical
8) Network
In a trunk there are 3 types of ice cream of flavors vanilla, chocolate and blueberry. The probability of selecting one vanilla ice-cream is 12 and probability of selecting one blueberry ice-cream is 27. The total number of chocolate ice-cream is 6. Find the number of ice creams in the trunk:- a)25
- b)30
- c)28
- d)32
Correct answer is option 'C'. Can you explain this answer?
In a trunk there are 3 types of ice cream of flavors vanilla, chocolate and blueberry. The probability of selecting one vanilla ice-cream is 12 and probability of selecting one blueberry ice-cream is 27. The total number of chocolate ice-cream is 6. Find the number of ice creams in the trunk:
a)
25
b)
30
c)
28
d)
32
|
Anbu Maran answered • 4 weeks ago |
28
The descriptive property possessed by each entity set is _________- a)Entity
- b)Attribute
- c)Relation
- d)Model
Correct answer is option 'B'. Can you explain this answer?
The descriptive property possessed by each entity set is _________
a)
Entity
b)
Attribute
c)
Relation
d)
Model
|
|
Gate Gurus answered • 4 weeks ago |
Possible attributes of the instructor entity set are ID, name, dept name, and salary.
An ________ is a set of entities of the same type that share the same properties, or attributes.- a)Entity set
- b)Attribute set
- c)Relation set
- d)Entity model
Correct answer is option 'A'. Can you explain this answer?
An ________ is a set of entities of the same type that share the same properties, or attributes.
a)
Entity set
b)
Attribute set
c)
Relation set
d)
Entity model
|
|
Gate Gurus answered • 4 weeks ago |
An entity is a “thing” or “object” in the real world that is distinguishable from all other objects.
The decoded instruction is stored in ______- a)IR
- b)PC
- c)Registers
- d)MDR
Correct answer is option 'A'. Can you explain this answer?
The decoded instruction is stored in ______
a)
IR
b)
PC
c)
Registers
d)
MDR
|
Rahul Bauri answered • 4 weeks ago |
What is sisd?
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?- a)1
- b)2
- c)3
- d)n
Correct answer is option 'C'. Can you explain this answer?
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?
a)
1
b)
2
c)
3
d)
n
|
|
Vibhor Goyal answered • 4 weeks ago |
A graph is connected iff all nodes can be traversed from each node. For a graph with n nodes, there will be n-1 minimum number of edges.
Given that there are n edges, that means a cycle is there in the graph.
The simplex graph with these conditions may be:
Now we can make a different spanning tree by removing one edge from the cycle, one at a time.
Minimum cycle length can be 3, So, there must be atleast 3 spanning trees in any such Graph.
Given that there are n edges, that means a cycle is there in the graph.
The simplex graph with these conditions may be:
Now we can make a different spanning tree by removing one edge from the cycle, one at a time.
Minimum cycle length can be 3, So, there must be atleast 3 spanning trees in any such Graph.
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?- a)1/8
- b)1
- c)7
- d)8
Correct answer is option 'C'. Can you explain this answer?
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
a)
1/8
b)
1
c)
7
d)
8
|
|
Gate Gurus answered • 4 weeks ago |
A cycle of length 3 can be formed with 3 vertices. There can be total 8C3 ways to pick 3 vertices from 8. The probability that there is an edge between two vertices is 1/2. So expected number of unordered cycles of length 3 = (8C3)*(1/2)3 = 7
Let G be a weighted undirected graph and e be an edge with maximum weight in G. Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the following statements is always TRUE?- a)There exists a cutset in G having all edges of maximum weight.
- b)There exists a cycle in G having all edges of maximum weight
- c)Edge e cannot be contained in a cycle.
- d)All edges in G have the same weight
Correct answer is option 'A'. Can you explain this answer?
Let G be a weighted undirected graph and e be an edge with maximum weight in G. Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the following statements is always TRUE?
a)
There exists a cutset in G having all edges of maximum weight.
b)
There exists a cycle in G having all edges of maximum weight
c)
Edge e cannot be contained in a cycle.
d)
All edges in G have the same weight
|
|
Gate Gurus answered • 4 weeks ago |
Background : Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together.
- A spanning tree has exactly V – 1 edges.
- A single graph can have many different spanning trees. A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree. The weight of a spanning tree is the sum of weights given to each edge of the spanning tree.
- There can be more that one possible spanning trees of a graph. For example, the graph in this question has 6 possible spanning trees.
- MST has lightest edge of every cutset. Remember Prim’s algorithm which basically picks the lightest edge from every cutset.
Choices of this question :
a) There exists a cutset in G having all edges of maximum weight : This is correct. If there is a heaviest edge in MST, then there exist a cut with all edges with weight equal to heavies edge. See point 4 discussed in above background.
a) There exists a cutset in G having all edges of maximum weight : This is correct. If there is a heaviest edge in MST, then there exist a cut with all edges with weight equal to heavies edge. See point 4 discussed in above background.
b) There exists a cycle in G having all edges of maximum weight : Not always TRUE. The cutset of heaviest edge may contain only one edge. In fact there may be overall one edge of heavies weight which is part of MST (Consider a graph with two components which are connected by only one edge and this edge is the heavies)
c) Edge e cannot be contained in a cycle. Not Always True. The curset may form cycle with other edges.
d) All edges in G have the same weight Not always True. As discussed in option b, there can be only one edge of heaviest weight.
Which kind of traversal order trie gives the lexicographical sorting of the set of the strings?- a)Preorder
- b)Postorder
- c)Level order
- d)Inorder
Correct answer is option 'A'. Can you explain this answer?
Which kind of traversal order trie gives the lexicographical sorting of the set of the strings?
a)
Preorder
b)
Postorder
c)
Level order
d)
Inorder
|
|
Gate Gurus answered • 4 weeks ago |
To print the string in alphabetical order we have to first insert in the trie and then perform preorder traversal to print in alphabetical order.
The cyclomatic complexity of the flow graph of a program provides - a)an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at most once
- b)a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at most once
- c)an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
- d)a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
Correct answer is option 'C'. Can you explain this answer?
The cyclomatic complexity of the flow graph of a program provides
a)
an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at most once
b)
a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at most once
c)
an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
d)
a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
|
|
Gate Gurus answered • 4 weeks ago |
Option (C) is correct, because the cyclomatic complexity of the flow graph of a program provides an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once.
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____.- a)8 and 20
- b)8 and 19
- c)7 and 19
- d)7 and 20
Correct answer is option 'C'. Can you explain this answer?
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____.
a)
8 and 20
b)
8 and 19
c)
7 and 19
d)
7 and 20
|
|
Gate Gurus answered • 4 weeks ago |
Case 1: If the vertex we are deleting from G is an isolated vertex, which is a component by itself, then number of components in G becomes 7.
Case 2: If G is a start Graph, then by deleting the cut vertex of G, we get 19 components.
Case 2: If G is a start Graph, then by deleting the cut vertex of G, we get 19 components.
Hence, number of components in G should lie between 7 and 19.
What is the maximum number of edges in an acyclic undirected graph with n vertices?- a)n-1
- b)n
- c)n + 1
- d)2n-1
Correct answer is option 'A'. Can you explain this answer?
What is the maximum number of edges in an acyclic undirected graph with n vertices?
a)
n-1
b)
n
c)
n + 1
d)
2n-1
|
|
Gate Gurus answered • 4 weeks ago |
n * (n – 1) / 2 when cyclic. But acyclic graph with the maximum number of edges is actually a spanning tree and therefore, correct answer is n-1 edges.
Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is- a)E
- b)2E
- c)V
- d)2V
Correct answer is option 'B'. Can you explain this answer?
Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is
a)
E
b)
2E
c)
V
d)
2V
|
Machine Experts answered • 4 weeks ago |
Since the given graph is undirected, every edge contributes as 2 to sum of degrees.
So the sum of degrees is 2E.
So the sum of degrees is 2E.
Which of the following data structure is useful in traversing a given graph by breadth first search?- a)Stack
- b)List
- c)Queue
- d)None of the above.
Correct answer is option 'C'. Can you explain this answer?
Which of the following data structure is useful in traversing a given graph by breadth first search?
a)
Stack
b)
List
c)
Queue
d)
None of the above.
|
|
Machine Experts answered • 4 weeks ago |
BFS performs level-order traversal which can be fairly done using a queue. A queue uses FIFO ordering and the nodes that we enqueue first are explored first maintaining the order of traversal.
|
Nisi Gupta
asked a question
|
Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
Correct answer is between '200 KB,300 KB'. Can you explain this answer?
Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to find out whether the graph is bipartite or not is ?- a)O(m+n)
- b)O(1)
- c)O(mn)
- d)O(n2)
Correct answer is option 'B'. Can you explain this answer?
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to find out whether the graph is bipartite or not is ?
a)
O(m+n)
b)
O(1)
c)
O(mn)
d)
O(n2)
|
|
Machine Experts answered • 4 weeks ago |
It is by definition that a graph is bipartite iff it does not contain odd length cycles.
So the answer is O(1).
So the answer is O(1).
For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim’s algorithm to construct a Minimum Spanning Tree?
- a)(a, b), (d, f), (f, c), (g, i), (d, a), (g, h), (c, e), (f, h)
- b)(c, e), (c, f), (f, d), (d, a), (a, b), (g, h), (h, f), (g, i)
- c)(d, f), (f, c), (d, a), (a, b), (c, e), (f, h), (g, h), (g, i)
- d)(h, g), (g, i), (h, f), (f, c), (f, d), (d, a), (a, b), (c, e)
Correct answer is option 'C'. Can you explain this answer?
For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim’s algorithm to construct a Minimum Spanning Tree?
a)
(a, b), (d, f), (f, c), (g, i), (d, a), (g, h), (c, e), (f, h)
b)
(c, e), (c, f), (f, d), (d, a), (a, b), (g, h), (h, f), (g, i)
c)
(d, f), (f, c), (d, a), (a, b), (c, e), (f, h), (g, h), (g, i)
d)
(h, g), (g, i), (h, f), (f, c), (f, d), (d, a), (a, b), (c, e)
|
|
Machine Experts answered • 4 weeks ago |
In prims algorithm we start with any node and keep on exploring minimum cost neighbors of nodes already covered.
|
Apurva Patel
asked a question
|
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, -13, -5, 25, -20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return the maximum of all. We can solve this using Divide and Conquer, what will be the worst case time complexity using Divide and Conquer.- a)O(n)
- b)O(nLogn)
- c)O(Logn)
- d)O(n^2)
Correct answer is option 'B'. Can you explain this answer?
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, -13, -5, 25, -20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return the maximum of all. We can solve this using Divide and Conquer, what will be the worst case time complexity using Divide and Conquer.
a)
O(n)
b)
O(nLogn)
c)
O(Logn)
d)
O(n^2)
|
Sewa Rani
asked a question
|
The fuel consumed by a motorcycle during a journey while traveling at various speeds is indicated in the graph below:
The distances covered during four laps of the journey are listed in the table below:
From the given data, we can conclude that the fuel consumed per kilometre was least during the la- a)P
- b)Q
- c)R
- d)S
Correct answer is option 'B'. Can you explain this answer?
The fuel consumed by a motorcycle during a journey while traveling at various speeds is indicated in the graph below:
The distances covered during four laps of the journey are listed in the table below:
From the given data, we can conclude that the fuel consumed per kilometre was least during the la
a)
P
b)
Q
c)
R
d)
S
|
Kanta Devi
asked a question
|
What does the following function do for a given Linked List with first node as head?void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}- a)Prints all nodes of linked lists
- b)Prints all nodes of linked list in reverse order
- c)Prints alternate nodes of Linked List
- d)Prints alternate nodes in reverse order
Correct answer is option 'B'. Can you explain this answer?
What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}
a)
Prints all nodes of linked lists
b)
Prints all nodes of linked list in reverse order
c)
Prints alternate nodes of Linked List
d)
Prints alternate nodes in reverse order
|
Dhrubajit Kakati
asked a question
|
What does the following function do?
- a)It returns 1 when n is a multiple of 3, otherwise returns 0
- b)It returns 1 when n is a power of 3, otherwise returns 0
- c)It returns 0 when n is a multiple of 3, otherwise returns 1
- d)It returns 0 when n is a power of 3, otherwise returns 1
Correct answer is option 'B'. Can you explain this answer?
What does the following function do?
a)
It returns 1 when n is a multiple of 3, otherwise returns 0
b)
It returns 1 when n is a power of 3, otherwise returns 0
c)
It returns 0 when n is a multiple of 3, otherwise returns 1
d)
It returns 0 when n is a power of 3, otherwise returns 1
|
PIYUSH THAKUR
asked a question
|
A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores the base address of a page of the second-level table (T2). Each entry of T2 stores the base address of a page of the third-level table (T3). Each entry of T3 stores a page table entry (PTE). The PTE is 32 bits in size. The processor used in the computer has a 1 MB 16-way set associative virtually indexed physically tagged cache. The cache block size is 64 bytes.
What is the minimum number of page colours needed to guarantee that no two synonyms map to different sets in the processor cache of this computer?
... more
A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores the base address of a page of the second-level table (T2). Each entry of T2 stores the base address of a page of the third-level table (T3). Each entry of T3 stores a page table entry (PTE). The PTE is 32 bits in size. The processor used in the computer has a 1 MB 16-way set associative virtually indexed physically tagged cache. The cache block size is 64 bytes.
What is the minimum number of page colours needed to guarantee that no two synonyms map to different sets in the processor cache of this computer?
What is the minimum number of page colours needed to guarantee that no two synonyms map to different sets in the processor cache of this computer?
|
NEELAM KUMARI
asked a question
|
With a single resource, deadlock occurs- a)If there are more than two processes competing for that resource.
- b)If there are only two processes competing for that resource.
- c)If there is a single process competing for that resource.
- d)None of these.
Correct answer is option 'D'. Can you explain this answer?
With a single resource, deadlock occurs
a)
If there are more than two processes competing for that resource.
b)
If there are only two processes competing for that resource.
c)
If there is a single process competing for that resource.
d)
None of these.
|
ARYAMAN PANDEY
asked a question
|
In a multiprogramming environment- a)The processor executes more than one process at a time
- b)The programs are developed by more than one person
- c)More than one process resides in the memory
- d)A single user can execute many programs at the same time
Correct answer is option 'C'. Can you explain this answer?
In a multiprogramming environment
a)
The processor executes more than one process at a time
b)
The programs are developed by more than one person
c)
More than one process resides in the memory
d)
A single user can execute many programs at the same time
|
Deekshant Semwal
asked a question
|
Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is _________.Correct answer is 'Ans: Given that at the time of Time Out, Congestion Window Size is 32 KB and RTT = 100 ms , When Time Out occurs, for the next round of Slow Start,Threshold = ,Threshold = 16KBSuppose we have a slow start ==>> 2KB|4KB|8KB|16KB (As the threshold is reached, Additive increase starts) 18KB|20KB|22KB|24KB|26KB|28KB|30KB|32KBHere | (vertical line) is representing RTT so the total number of vertical lines is 100*10ms ==>> and 1100m. sec so this is the answer...'. Can you explain this answer?
Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is _________.
|
Dharamvir Kalia
asked a question
|
What will be the output of the given program?#include<stdio.h>
void main()
{
int value1, value2=100, num=100;
if(value1=value2%5) num=5;
printf("%d %d %d", num, value1, value2);
}- a)100 100 100
- b)5 0 20
- c)5 0 100
- d)100 0 100
Correct answer is option 'D'. Can you explain this answer?
What will be the output of the given program?
#include<stdio.h>
void main()
{
int value1, value2=100, num=100;
if(value1=value2%5) num=5;
printf("%d %d %d", num, value1, value2);
}
void main()
{
int value1, value2=100, num=100;
if(value1=value2%5) num=5;
printf("%d %d %d", num, value1, value2);
}
a)
100 100 100
b)
5 0 20
c)
5 0 100
d)
100 0 100
|
Vilas Shelke
asked a question
|
Which one of the following is not correct?- a)telnet is a general purpose client-server program
- b)telnet lets user access an application on a remote computer
- c)telnet can also be used for file transfer
- d)none of the mentioned
Correct answer is option 'C'. Can you explain this answer?
Which one of the following is not correct?
a)
telnet is a general purpose client-server program
b)
telnet lets user access an application on a remote computer
c)
telnet can also be used for file transfer
d)
none of the mentioned
|
Kali Battula
asked a question
|
The instruction -> Add LOCA, R0 does _______- a)Adds the value of LOCA to R0 and stores in the temp register
- b)Adds the value of R0 to the address of LOCA
- c)Adds the values of both LOCA and R0 and stores it in R0
- d)Adds the value of LOCA with a value in accumulator and stores it in R0
Correct answer is option 'C'. Can you explain this answer?
The instruction -> Add LOCA, R0 does _______
a)
Adds the value of LOCA to R0 and stores in the temp register
b)
Adds the value of R0 to the address of LOCA
c)
Adds the values of both LOCA and R0 and stores it in R0
d)
Adds the value of LOCA with a value in accumulator and stores it in R0
|
|
Kshama Gupta
asked a question
|
Let the following functional dependencies hold for relation R1(A, B, C) and R2(B, D, E)B → A, A → C, the relation R1 contains 35 tuples and relation R2 contains 34 tuples. What is maximum number of tuples possible in natural join R1 and R2?- a)35
- b)36
- c)34
- d)33
Correct answer is option 'C'. Can you explain this answer?
Let the following functional dependencies hold for relation R1(A, B, C) and R2(B, D, E)
B → A, A → C, the relation R1 contains 35 tuples and relation R2 contains 34 tuples. What is maximum number of tuples possible in natural join R1 and R2?
a)
35
b)
36
c)
34
d)
33
Fetching relevant content for you
Ask a doubt
Recommended Content
|
|
|
|
|
© EduRev
|
Education Revolution
|
Follow Us
|
