GATE Overflow for GATE CSE
Login Register
@
  • Dark Mode
  • Profile
  • Edit my Profile
  • Messages
  • My favorites
  • Register
  • Activity
  • Q&A
  • Questions
  • Unanswered
  • Tags
  • Subjects
  • Users
  • Ask
  • Previous Years
  • Blogs
  • New Blog
  • Exams
Dark Mode
Filter
  • User preeti0448
  • Wall
  • Recent activity
  • All questions
  • All answers
  • Exams Taken
  • All Blogs

Recent activity by preeti0448

1 answer
1
Explain
commented in Algorithms Aug 31, 2022
244 views
  • dijkstras-algorithm
  • sorting
  • time-complexity
  • test-series
2 answers
2
Doubt
What is Dijkstra's algorithm running time using sorted array?
answered in Algorithms Aug 31, 2022
249 views
  • dijkstras-algorithm
7 answers
3
GATE CSE 1996 | Question: 17
Let $G$ be the directed, weighted graph shown in below figure We are interested in the shortest paths from $A$. Output the sequence of vertices identified by the Dijkstra's algorithm for single source shortest path when the algorithm is started at node $A$ Write down ... vertices in the shortest path from $A$ to $E$ What is the cost of the shortest path from $A$ to $E$?
answered in Algorithms Aug 30, 2022
5.7k views
  • gate1996
  • algorithms
  • graph-algorithms
  • normal
  • descriptive
1 answer
4
GO Classes 2023 | Weekly Quiz 8 | Question: 1
What will be the output of the following program? struct s{ int i; struct s *p; }; struct s arr[4] = { 7, arr+3, 8, arr+2, 9, arr, 8, arr+1, }; struct s *ap[] = {arr+3, arr+2, arr+1, arr}; struct s **pp =ap; int main() { printf("%d ", ... +->i); printf("%d", ++arr[2].p->i); } $9\; 10\; 9$ $7 \;8\; 10$ $7\; 8\; 9$ None of these
commented in Programming May 18, 2022
355 views
  • goclasses_wq8
  • goclasses
  • programming
  • programming-in-c
  • structure
  • 2-marks
1 answer
5
asymptotic notations
√logx = O(loglogx) is it true or false? and explain why?
answered in Algorithms May 2, 2022
202 views
  • asymptotic-notations
2 answers
6
made easy test
Given below are 4 functions $999999n$ $0.99999 n logn$ $1.000001^{n}$ $n^{2}$ The increasing order of the above functions in terms of their asymptotic complexity is?
answered in Algorithms May 2, 2022
315 views
  • algorithms
  • asymptotic-notations
  • made-easy-test-series
1 answer
7
Asymptotic notation
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)
answered in Algorithms May 2, 2022
393 views
  • asymptotic-notations
  • algorithms
  • time-complexity
5 answers
8
Big oh
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
answered in Algorithms May 2, 2022
311 views
  • algorithms
  • asymptotic-notations
2 answers
9
Cormen Edition 3 Exercise 3.2 Question 3 (Page No. 60)
Prove that $n!=\omega(2^n)$ and $n!=o(n^n)$.
answered in Algorithms May 2, 2022
238 views
  • cormen
  • algorithms
  • asymptotic-notations
  • descriptive
2 answers
10
TIFR CSE 2021 | Part B | Question: 1
Consider the following statements about propositional formulas. $\left ( p\wedge q \right )\rightarrow r$ and $\left ( p \rightarrow r \right )\wedge \left ( q\rightarrow r \right )$ are $\textit{not }$ ... values $p$ and $q$, $\text{(i)}$ can be either true or false, while $\text{(ii)}$ is always false.
answered in Mathematical Logic Mar 14, 2022
591 views
  • tifr2021
  • mathematical-logic
  • propositional-logic
2 answers
11
kenneth h rosen chapter 1 excercise 1.3 question 47
Show that p NAND q is logically equivalent to ¬(p ∧ q). how to prove this and i prove using truth table which is easy but how to prove using logical identities ? thank you
answered in Mathematical Logic Mar 14, 2022
228 views
  • discrete-mathematics
  • mathematical-logic
  • propositional-logic
  • engineering-mathematics
  • kenneth-rosen
2 answers
12
Morris Mano Edition 3 Exercise 1 Question 18 (Page No. 34)
Perform the arithmetic operations (+42) + (-13) and (-42) – (-13) using binary signed 2’s complement representation for the negative numbers.
answered in Digital Logic Mar 10, 2022
2.1k views
  • digital-logic
  • morris-mano
  • number-representation
5 answers
13
GATE CSE 2005 | Question: 16, ISRO2009-18, ISRO2015-2
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $-2^{n-1} \text{ to } (2^{n-1} -1)$ $-(2^{n-1} -1) \text{ to } (2^{n-1} -1)$ $-2^{n-1} \text{ to } 2^{n-1}$ $-(2^{n-1} +1) \text{ to } (2^{n-1} -1)$
answered in Digital Logic Mar 7, 2022
8.3k views
  • gatecse-2005
  • digital-logic
  • number-representation
  • easy
  • isro2009
  • isro2015
2 answers
14
eigen values and determinents
Let A be a 4 × 4 matrix with real entries such that -1, 1, 2, -2 are its eigen values. If B = A4 - 5A2 + 5I where I denotes 4 × 4 identity matrix, then which of the following is correct? (det(X) represents determinant of X) (A) det(A + B) = 0 (B) det(B) = 1 (C) trace of A + B is 4 (D) all of these
answered in Linear Algebra Feb 28, 2022
1.2k views
  • eigen-value
  • engineering-mathematics
  • linear-algebra
1 answer
15
If we perform row/column operation in matrix does it eigenvalue change?
commented in Mathematical Logic Feb 28, 2022
843 views
  • eigen-value
1 answer
16
ISI2015-DCG-56
$\underset{x \to \infty}{\lim} \left( 1 + \dfrac{1}{x^2} \right) ^x$ equals $-1$ $0$ $1$ Does not exist
commented in Calculus Feb 28, 2022
246 views
  • isi2015-dcg
  • calculus
  • limits
2 answers
17
NIELIT 2016 MAR Scientist C - Section B: 8
The eigenvalues of the matrix $\begin{bmatrix}1 & 2\\ 4 & 3 \end{bmatrix}$ are $\text{5 and -5}$ $\text{5 and -1}$ $\text{1 and -5}$ $\text{2 and 3}$
commented in Linear Algebra Feb 25, 2022
384 views
  • nielit2016mar-scientistc
  • engineering-mathematics
  • linear-algebra
3 answers
18
GATE CSE 2005 | Question: 49
What are the eigenvalues of the following $2\times 2$ matrix? $\left( \begin{array}{cc} 2 & -1\\ -4 & 5\end{array}\right)$ $-1$ and $1$ $1$ and $6$ $2$ and $5$ $4$ and $-1$
commented in Linear Algebra Feb 16, 2022
4.6k views
  • gatecse-2005
  • linear-algebra
  • eigen-value
  • easy
0 answers
19
[Question] Review of GATE Portal by NPTEL
Hello everyone,this is my first time asking a question in GATE Overflow. I am starting out to prepare for GATE 2023. Can anybody tell me whether the GATE Portal by NPTEL is useful for conceptual clarity? The GATE portal by NPTEL ... I went through the various preparation blogs,videos and resources. It will be really helpful if someone can help me. Thanks!
commented in GATE Jan 24, 2022
1.1k views
  • preparation
  • study-resources

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Recent Posts

  • From GATE to Australia
  • DRDO Previous Year Papers
  • From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
  • What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
  • All India GO Classes Mock test

Subjects

  • All categories
  • General Aptitude (2.5k)
  • Engineering Mathematics (9.3k)
  • Digital Logic (3.3k)
  • Programming and DS (5.9k)
  • Algorithms (4.6k)
  • Theory of Computation (6.7k)
  • Compiler Design (2.3k)
  • Operating System (5.0k)
  • Databases (4.6k)
  • CO and Architecture (3.8k)
  • Computer Networks (4.6k)
  • Non GATE (1.3k)
  • Others (2.4k)
  • Admissions (649)
  • Exam Queries (842)
  • Tier 1 Placement Questions (17)
  • Job Queries (74)
  • Projects (9)
  • Unknown Category (853)

Recent Blog Comments

  • This guy was just exceptional. I remember hearing...
  • Inspirational! Found the right Blog at the right...
  • That was my second attempt. I already had notes,...
  • Sorry to break the news, but: I see a few flaws...
  • bhai mujhe bhi bula lo australia......mai bhi...
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • Contact Us
Developed by Chun