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 Karthi2003
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Karthi2003
0
answers
1
Computer architecture and organization
Consider the last 4 digits of your student register and append with 1122 and represent the number in binary number for data sequence. a) Apply hamming method to find the parity/check/skip bits and show the whole data sequence transmitted. b) Flip the 5th bit from ... 3 8 1 1 2 2 Binary Sequence 0 0 1 0 1 1 0 0 The data sequence for the example is: 00101100
asked
in
CO and Architecture
Nov 8, 2022
478
views
co-and-architecture
hamming-code
1
answer
2
Data structures and algorithms
Consider the last four digits of your register number and form the following numbers: 1. first digit 2. second digit 3. third digit 4. fourth digit 5. 2 digit number with the first two digits 6. 2 digit number with the last two digits ... inserted into a hash table whose description is given above and the contents of the table after insertion are to be clearly given.
asked
in
DS
Nov 7, 2022
492
views
data-structures
hashing
linear-probing
1
answer
3
Computer architecture
Represent +42 and -42 in sign-magnitude, 1’s complement and 2’s complement representation. Find the result of 42 - 20 using 2’s complement.
asked
in
Digital Logic
Sep 11, 2022
1.2k
views
digital-logic
number-representation
1
answer
4
Data structures and algorithms
Assume Two-Dimensional Sorted Array (TDSA) is a two-dimensional matrix of size n × n such as the elements in the matrix are sorted row-wise and column-wise. For example, the following matrix is a TDSA. 1 2 3 4 5 6 7 8 9 Write an algorithm that should convert the given matrix of a dimension n × n into TDSA. Analyse the running time of the algorithm.
asked
in
DS
Sep 9, 2022
428
views
algorithms
sorting
time-complexity
0
answers
5
Data structures and algorithms
Compute the running time for the following algorithm ALGORITHM RKU(a,k,n) //Input: a is an array of n element and k is a value { if( k == n) then { WRITE(a[1:n]); return 0; } else { for i ← k to n do { t ← a[k]; a[k] ← a[i]; a[i] ← t; RKU(a, k+1, n); t ← a[k]; a[k] ← a[i]; a[i] ← t; } }
asked
in
DS
Sep 9, 2022
345
views
algorithms
time-complexity
1
answer
6
Algorithms
Given ‘N’ objects, which are coloured as red, white and blue. Sort these objects so that objects of the same colour are adjacent, with the colours in the order red, white and blue. Design an algorithm with a time com- plexity of O(nlog n)
asked
in
DS
Sep 9, 2022
665
views
algorithms
sorting
time-complexity
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...