## Discussion Forum

Que. | In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is |

a. | Ο(1) |

b. | Ο(n) |

c. | Ο(log n) |

d. | Ο(n2) |

Answer:Ο(n) |

Que. | In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is |

a. | Ο(1) |

b. | Ο(n) |

c. | Ο(log n) |

d. | Ο(n2) |

Answer:Ο(n) |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.