Call Support +91-85588-96644
TCY online

Login

Sign Up

Please enter a Username or Email ID
Please enter a password
Keep me logged in
Please enter your name
Please enter your mobile number
You can't leave Captcha Code empty
By submitting this form, you agree to the Terms & Privacy Policy.
OR

Sign Up via Facebook

Sign Up via Google

Sign Up via Twitter

Download Software
Tests given

Download TCY App

OR
App Image

GATE preparation for Computer Science & Information Technology

(306 Posts)

This thread is dedicated to preparation for Computer Science & Information Technology - CS section of GATE. You may share questions from topics like Engineering Mathematics, Programming - C / C++, Network Security and Firewall, Java Basics, Digital Logic, Computer Organization and Architecture, Programming and Data Structure, Algorithms, Theory of Computation, Compiler Design, Operating System, Databases, Information Systems and Software, Computer Networks, Web Technologies etc.

Question should not exceed 100 characters.Use add options for multiple choice questions and "Uploadimage/Add related data" for passage text papers.
Question should be at least 10 characters long.
+
Add Options | Community Guidelines
Cancel
Sumit Lahiri
Shared from GATE-2010 (CS) on 18 Jan, 2019 3:28 PM

Consider the following languages:

Which of these languages is/are regular?

 
Only L1 and L2
Only L3 and L4
Only L2, L3 and L4
Only L3
Please type your answer before submitting.
Sumit Lahiri
Posted on 18 Jan, 2019 3:28 PM

How come L4 is regular?????????. Please explain. A Turing machine case be used to recognize it with infinite tape.

Sumit Lahiri
Shared from GATE-2016 (CS) Set-I on 06 Jan, 2019 8:29 AM

Let X be a recursive language and Y be a recursively enumerable but not recursive language.

Let W and Z be two languages such that Y reduces to W, and Z reduces to X (reduction means the standard many-one reduction). Which one of the following statements is TRUE?

 
W can be recursively enumerable and Z is recursive.
W can be recursive and Z is recursively enumerable.
W is not recursively enumerable and Z is recursive.
W is not recursively enumerable and Z is not recursive.
Na
Please type your answer before submitting.
Sumit Lahiri
Posted on 06 Jan, 2019 8:30 AM

Https://gateoverflow.in/39721/gate2016-1-44

Sumit Lahiri
Shared from GATE-2015 (CS) Set-II on 04 Jan, 2019 9:30 PM

Host A sends a UDP datagram containing 8880 bytes of user data to host B over an Ethernet LAN. Ethernet frames may carry data up to 1500 bytes (i.e. MTU = 1500 bytes). Size of UDP header is 8 bytes and size of IP heard is 20 bytes. There is no option field in IP header How many total number of IP fragments will be transmitted and what will be the contents of offset field in the last fragment?

 
6 and 95
6 and 7400
7 and 1110
7 and 8880
Please type your answer before submitting.
Sumit Lahiri
Posted on 04 Jan, 2019 9:30 PM

Why is the question incomplete??. Answer explanation given is also wrong.

Sumit Lahiri
Shared from GATE-2015 (CS) Set-II on 04 Jan, 2019 9:21 PM

Consider the following function written the C programming language.

void foo (char *a)

{

        if (*a && *a ! = '   ')

        {

             putchar (*a) ;

         }

}

The output of the above function on input ABCD EFGH is

 
ABCD EFGH
ABCD
HGFE DCBA
DCBA
Please type your answer before submitting.
Sumit Lahiri
Posted on 04 Jan, 2019 9:21 PM

Please correct the question. Question in complete.

Sumit Lahiri
Shared from GATE-2015 (CS) Set-I on 04 Jan, 2019 2:52 PM

In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?

 
HTTP, FTP
HTTP, TELNET
FTP, SMTP
HTTP, SMTP
Please type your answer before submitting.
Sumit Lahiri
Posted on 04 Jan, 2019 2:52 PM

FTP uses two TCP connections. What do you say?? Only One,