This document contains information about a GATE CS test paper from 1995, including sample questions from sections A and B. It also provides information about GATE Forum, which conducts mock GATE tests and online discussion forums to help students prepare for GATE. The document encourages thinking about GATE and considering GATE Forum as a resource.
This document describes a GATE CS test paper from 1995 and provides information about joining mock test series and online discussion forums to prepare for the GATE exam. It includes 25 one-mark questions and 25 two-mark questions on topics related to computer science. Additional context is provided about the exam format and instructions for answering the objective response questions.
This document contains a GATE exam paper from 1994. It has two sections - Section A with 8 multiple choice questions and Section B with 20 questions where the test taker must answer 10. The questions cover topics in computer science including algorithms, data structures, automata theory, databases, computer architecture and electronics.
This document provides information about a GATE CS test paper from 2003 and discusses joining an All India Mock GATE Classroom Test Series conducted by GATE Forum. It includes sample questions from the 2003 GATE CS paper, covering topics like algorithms, data structures, automata theory, databases, computer networks, operating systems and more. 30 questions have one mark each and 60 questions have two marks each. The document encourages visiting the GATE Forum website for more details on joining their test series to help prepare for GATE.
This document contains the text of the GATE CS exam from 1992. It includes 20 multiple choice questions and 9 short answer/essay questions covering topics in computer science such as computer architecture, algorithms, theory of computation and data structures. It also provides information about joining an online test preparation community that offers full length and section mock exams designed by IISc alumni to help students prepare for the GATE exam.
This document provides information about a GATE CS test paper from 2000. It includes 23 single-mark questions covering topics like arrays, matrices, data structures, algorithms, computer architecture, programming languages and databases. It also includes 26 two-mark questions on additional topics like logic, automata theory, complexity, probability, relations and Boolean algebra. The document encourages joining mock test series and online discussion forums to prepare for the GATE exam.
This document contains a 25 question multiple choice test on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, computer architecture, operating systems, databases, networks, and formal languages. The test asks the examinee to choose the best answer from among 4 options for each question. It also provides 2 mark questions in the later part testing more comprehensive understanding.
This document describes a GATE CS test paper from 1995 and provides information about joining mock test series and online discussion forums to prepare for the GATE exam. It includes 25 one-mark questions and 25 two-mark questions on topics related to computer science. Additional context is provided about the exam format and instructions for answering the objective response questions.
This document contains a GATE exam paper from 1994. It has two sections - Section A with 8 multiple choice questions and Section B with 20 questions where the test taker must answer 10. The questions cover topics in computer science including algorithms, data structures, automata theory, databases, computer architecture and electronics.
This document provides information about a GATE CS test paper from 2003 and discusses joining an All India Mock GATE Classroom Test Series conducted by GATE Forum. It includes sample questions from the 2003 GATE CS paper, covering topics like algorithms, data structures, automata theory, databases, computer networks, operating systems and more. 30 questions have one mark each and 60 questions have two marks each. The document encourages visiting the GATE Forum website for more details on joining their test series to help prepare for GATE.
This document contains the text of the GATE CS exam from 1992. It includes 20 multiple choice questions and 9 short answer/essay questions covering topics in computer science such as computer architecture, algorithms, theory of computation and data structures. It also provides information about joining an online test preparation community that offers full length and section mock exams designed by IISc alumni to help students prepare for the GATE exam.
This document provides information about a GATE CS test paper from 2000. It includes 23 single-mark questions covering topics like arrays, matrices, data structures, algorithms, computer architecture, programming languages and databases. It also includes 26 two-mark questions on additional topics like logic, automata theory, complexity, probability, relations and Boolean algebra. The document encourages joining mock test series and online discussion forums to prepare for the GATE exam.
This document contains a 25 question multiple choice test on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, computer architecture, operating systems, databases, networks, and formal languages. The test asks the examinee to choose the best answer from among 4 options for each question. It also provides 2 mark questions in the later part testing more comprehensive understanding.
This document provides information about joining an All India Mock GATE Classroom Test Series conducted by GATE Forum in over 25 cities across India. The test series includes section tests and full tests designed by IISc alumni according to the latest GATE syllabus. Participants receive their percentile score, All India rank, and can interact with IISc alumni through online discussion forums. The document also provides sample questions from previous GATE papers.
The document contains 37 multiple choice questions related to computer science topics such as Boolean logic, data structures, algorithms, computer architecture, operating systems, and computer networks. The questions cover a wide range of fundamental concepts and require applying core CS principles to analyze problems and choose the best answer.
This document contains a set of multiple choice questions and answers related to data structures. There are 56 questions covering topics like hashing, graphs, trees, sorting algorithms, linked lists, stacks, queues, arrays, and more. The questions test knowledge of concepts like time complexity, operations on different data structures, representations of data like matrices and graphs, and algorithms that use common data structures.
This document contains a GATE study material question paper with 30 single mark questions and 2 two-mark questions on computer science topics. The questions cover concepts like structured programming, data structures, algorithms, computer architecture, operating systems, databases, computer networks and logic. The document also provides information about a website that offers GATE preparation material, forums and downloads.
This document contains a test paper for GATE CS from 1993. It includes questions in two sections - Section A with multiple choice and numerical answer questions, and Section B with multi-part questions. The document also advertises classroom test series and online discussion forums for GATE preparation provided by GATE Forum.
This document contains a 20 question mock exam for the GATE exam. It provides instructions that each question is worth 1 mark, unanswered questions receive 0 marks and incorrect answers receive negative marks. It then lists 20 multiple choice questions related to computer science topics like operating systems, algorithms, data structures, computer networks and formal languages. For each question there are 4 possible answer choices and space to write the answer.
The document provides instructions for a post graduate common entrance test for computer science engineering. It specifies the date, time, duration, and format of the test. Candidates are instructed to fill in personal details like registration number, question booklet code and serial number on the answer sheet. They are also provided instructions on how to answer questions within the given time limit, as well as guidelines for proper marking of responses. The test contains 2 parts - part 1 has 50 one-mark questions and part 2 has 25 two-mark questions.
The document is a notification for the Post Graduate Common Entrance Test (PGCET) that will be administered on August 8, 2015 for various post-graduate engineering programs. It provides important instructions for candidates regarding the exam, including the duration of the exam, maximum marks, and guidelines on properly filling out the answer sheet. It also lists the subject that will be covered, which is Computer Science Engineering, and provides a breakdown of the number and type of questions that will be on the exam.
The document contains a 50 question practice test for the Computer Science & Applications paper-II exam. The questions cover topics like binary numbers, logic gates, algorithms, data structures, databases, operating systems and computer networks. The key answers are provided at the end with letters A through D corresponding to the multiple choice options for each question number from 1 to 50.
The document provides a table of contents and questions on various technical aptitude topics such as data structures, C, C++, quantitative aptitude, UNIX concepts, RDBMS concepts, SQL, computer networks, and operating systems. It contains 35 questions related to data structures concepts like linked lists, trees, graphs, hashing etc. and their applications.
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
This document summarizes algorithms for solving the Range 1 Query (R1Q) problem. The R1Q problem involves preprocessing a d-dimensional binary matrix to answer queries about whether a given range contains a 1. The document presents:
1) A deterministic linear-space data structure that solves orthogonal R1Qs in constant time for any dimension d.
2) Randomized sublinear-space data structures that solve orthogonal R1Qs and provide a tradeoff between query time and error probability.
3) Deterministic near-linear space data structures that solve non-orthogonal R1Qs (e.g. for axis-parallel triangles and spheres) in constant time.
This document contains a 50 question quiz on data structures. The questions cover topics like linked lists, stacks, queues, trees, sorting algorithms, hashing and more. For each question there are 4 multiple choice answers and the correct answer is indicated. The quiz is assessing understanding of fundamental data structure concepts and their applications.
An Efficient Interpolation-Based Chase BCH Decoderijsrd.com
This document describes an efficient interpolation-based Chase decoder for Bose-Chaudhuri-Hocquenghem (BCH) codes. BCH codes are error-correcting codes commonly used in applications such as flash memory and digital video broadcasting. The proposed Chase decoder uses an interpolation-based approach inspired by Chase decoders for Reed-Solomon codes but modified to leverage the binary properties of BCH codes. This allows it to correct up to t + η errors, where t is the number of errors the underlying BCH code can correct and η is the number of bits flipped in the Chase algorithm. The decoder consists of syndrome calculation, key equation solving, error location via Chien search, and error correction
The document contains multiple choice questions and answers related to C++ concepts like input/output operations, loops, functions, structures, classes, and object-oriented programming principles. Some key points covered include:
- The cstdio header is used for input/output in C++ (as opposed to stdio.h in C).
- Streams are used to interact with physical devices from C++ programs.
- Classes can contain both data members and member functions, and objects are initialized using constructors by default.
- Structures are similar to classes but have public access by default.
- Inline functions are expanded during compilation to reduce function call overhead.
This document contains questions from the Theory of Computation subject for the 5th semester Computer Science engineering students. It has two parts - Part A contains 10 short answer questions worth 2 marks each and Part B contains 5 long answer questions worth 16 marks each. The questions cover various topics in Theory of Computation including finite automata, context-free grammars, pushdown automata, Turing machines, and computability.
Cryptography is the combination of Mathematics and Computer science. Cryptography is used for encryption and decryption of data using mathematics. Cryptography transit the information in an illegible manner such that only intended recipient will be able to decrypt the information
This document presents a block cipher that incorporates concepts from the Hill cipher and previous block ciphers developed by the authors. The cipher uses a key matrix K and encryption key bunch matrix E to encrypt plaintext P into ciphertext C. Decryption uses the inverse of K and a decryption key bunch matrix D to recover P from C. The cipher is strengthened by including Mix() and Imix() functions that diffuse bits during encryption and decryption rounds. Cryptanalysis shows the cipher is unbreakable against known attacks due to the diffusion achieved by superimposing Hill cipher and previous block cipher concepts. In 3 sentences or less, this document proposes and analyzes a block cipher combining aspects of Hill cipher and previous work, using key matrices for
This document discusses register allocation in compiler construction. It begins with an example of constructing an interference graph from a code snippet during liveness analysis. It then covers the main steps of register allocation: constructing interference graphs from liveness analysis, graph coloring to assign registers while minimizing spills, and handling move instructions through coalescing. It provides examples demonstrating graph coloring on interference graphs with different numbers of available registers.
This document provides information about joining an All India Mock GATE Classroom Test Series conducted by GATE Forum in over 25 cities across India. The test series includes section tests and full tests designed by IISc alumni according to the latest GATE syllabus. Participants receive their percentile score, All India rank, and can interact with IISc alumni through online discussion forums. The document also provides sample questions from previous GATE papers.
The document contains 37 multiple choice questions related to computer science topics such as Boolean logic, data structures, algorithms, computer architecture, operating systems, and computer networks. The questions cover a wide range of fundamental concepts and require applying core CS principles to analyze problems and choose the best answer.
This document contains a set of multiple choice questions and answers related to data structures. There are 56 questions covering topics like hashing, graphs, trees, sorting algorithms, linked lists, stacks, queues, arrays, and more. The questions test knowledge of concepts like time complexity, operations on different data structures, representations of data like matrices and graphs, and algorithms that use common data structures.
This document contains a GATE study material question paper with 30 single mark questions and 2 two-mark questions on computer science topics. The questions cover concepts like structured programming, data structures, algorithms, computer architecture, operating systems, databases, computer networks and logic. The document also provides information about a website that offers GATE preparation material, forums and downloads.
This document contains a test paper for GATE CS from 1993. It includes questions in two sections - Section A with multiple choice and numerical answer questions, and Section B with multi-part questions. The document also advertises classroom test series and online discussion forums for GATE preparation provided by GATE Forum.
This document contains a 20 question mock exam for the GATE exam. It provides instructions that each question is worth 1 mark, unanswered questions receive 0 marks and incorrect answers receive negative marks. It then lists 20 multiple choice questions related to computer science topics like operating systems, algorithms, data structures, computer networks and formal languages. For each question there are 4 possible answer choices and space to write the answer.
The document provides instructions for a post graduate common entrance test for computer science engineering. It specifies the date, time, duration, and format of the test. Candidates are instructed to fill in personal details like registration number, question booklet code and serial number on the answer sheet. They are also provided instructions on how to answer questions within the given time limit, as well as guidelines for proper marking of responses. The test contains 2 parts - part 1 has 50 one-mark questions and part 2 has 25 two-mark questions.
The document is a notification for the Post Graduate Common Entrance Test (PGCET) that will be administered on August 8, 2015 for various post-graduate engineering programs. It provides important instructions for candidates regarding the exam, including the duration of the exam, maximum marks, and guidelines on properly filling out the answer sheet. It also lists the subject that will be covered, which is Computer Science Engineering, and provides a breakdown of the number and type of questions that will be on the exam.
The document contains a 50 question practice test for the Computer Science & Applications paper-II exam. The questions cover topics like binary numbers, logic gates, algorithms, data structures, databases, operating systems and computer networks. The key answers are provided at the end with letters A through D corresponding to the multiple choice options for each question number from 1 to 50.
The document provides a table of contents and questions on various technical aptitude topics such as data structures, C, C++, quantitative aptitude, UNIX concepts, RDBMS concepts, SQL, computer networks, and operating systems. It contains 35 questions related to data structures concepts like linked lists, trees, graphs, hashing etc. and their applications.
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
This document summarizes algorithms for solving the Range 1 Query (R1Q) problem. The R1Q problem involves preprocessing a d-dimensional binary matrix to answer queries about whether a given range contains a 1. The document presents:
1) A deterministic linear-space data structure that solves orthogonal R1Qs in constant time for any dimension d.
2) Randomized sublinear-space data structures that solve orthogonal R1Qs and provide a tradeoff between query time and error probability.
3) Deterministic near-linear space data structures that solve non-orthogonal R1Qs (e.g. for axis-parallel triangles and spheres) in constant time.
This document contains a 50 question quiz on data structures. The questions cover topics like linked lists, stacks, queues, trees, sorting algorithms, hashing and more. For each question there are 4 multiple choice answers and the correct answer is indicated. The quiz is assessing understanding of fundamental data structure concepts and their applications.
An Efficient Interpolation-Based Chase BCH Decoderijsrd.com
This document describes an efficient interpolation-based Chase decoder for Bose-Chaudhuri-Hocquenghem (BCH) codes. BCH codes are error-correcting codes commonly used in applications such as flash memory and digital video broadcasting. The proposed Chase decoder uses an interpolation-based approach inspired by Chase decoders for Reed-Solomon codes but modified to leverage the binary properties of BCH codes. This allows it to correct up to t + η errors, where t is the number of errors the underlying BCH code can correct and η is the number of bits flipped in the Chase algorithm. The decoder consists of syndrome calculation, key equation solving, error location via Chien search, and error correction
The document contains multiple choice questions and answers related to C++ concepts like input/output operations, loops, functions, structures, classes, and object-oriented programming principles. Some key points covered include:
- The cstdio header is used for input/output in C++ (as opposed to stdio.h in C).
- Streams are used to interact with physical devices from C++ programs.
- Classes can contain both data members and member functions, and objects are initialized using constructors by default.
- Structures are similar to classes but have public access by default.
- Inline functions are expanded during compilation to reduce function call overhead.
This document contains questions from the Theory of Computation subject for the 5th semester Computer Science engineering students. It has two parts - Part A contains 10 short answer questions worth 2 marks each and Part B contains 5 long answer questions worth 16 marks each. The questions cover various topics in Theory of Computation including finite automata, context-free grammars, pushdown automata, Turing machines, and computability.
Cryptography is the combination of Mathematics and Computer science. Cryptography is used for encryption and decryption of data using mathematics. Cryptography transit the information in an illegible manner such that only intended recipient will be able to decrypt the information
This document presents a block cipher that incorporates concepts from the Hill cipher and previous block ciphers developed by the authors. The cipher uses a key matrix K and encryption key bunch matrix E to encrypt plaintext P into ciphertext C. Decryption uses the inverse of K and a decryption key bunch matrix D to recover P from C. The cipher is strengthened by including Mix() and Imix() functions that diffuse bits during encryption and decryption rounds. Cryptanalysis shows the cipher is unbreakable against known attacks due to the diffusion achieved by superimposing Hill cipher and previous block cipher concepts. In 3 sentences or less, this document proposes and analyzes a block cipher combining aspects of Hill cipher and previous work, using key matrices for
This document discusses register allocation in compiler construction. It begins with an example of constructing an interference graph from a code snippet during liveness analysis. It then covers the main steps of register allocation: constructing interference graphs from liveness analysis, graph coloring to assign registers while minimizing spills, and handling move instructions through coalescing. It provides examples demonstrating graph coloring on interference graphs with different numbers of available registers.
Refining Your Skills for the Not Too Distant Futureqmatheson
Presented at ORBiT Real Time Days 2014
Keynote address by:
Alex Gallacher, EngageHR
The high-tech, consumer-savvy, not-too-distant future may very well require different skills than we have traditionally hired for or trained for. Let’s talk about what skills we actually need to be building in our existing staff and looking for in those we hire. If we don’t have those skills ourselves, how do we hire for them? What do we need to know, how difficult is it to learn, how big a leap is it? Whether you’re a broker or a carrier, you need to know and we’re here to tell you!
2013 december to 2014 march report guesswhereAtoutFranceUSA
The document reports on the Guesswhere promotion from December 2013 to March 2014. It provides details on the game features, number of pictures and locations included, visibility on websites and in newsletters, and statistics on social media posts and their impressions. Over 270 locations across France and Guadeloupe were included in the game and it was prominently displayed on the Rendezvous en France website and in the Club France newsletter, generating over 800 clicks. A total of 5 Facebook posts promoted the game, receiving over 14,000 impressions in total.
Apple Inc one of the leading Computer hardware and software developing and designing companies. here are a few main and upcoming products of the company
Muckgers is an investigative journalism organization focused on issues affecting Rutgers University students. It retools muckraking journalism for the 21st century. Muckgers aims to provide contextual and explanatory reporting on the how and why of issues at Rutgers. It has a monthly online audience of 7,000-10,000 and reaches students and locals through its website and social media platforms. The document provides information on Muckgers' mission, approach, audiences and advertising packages.
This document summarizes the results of a survey of 55 insurance brokers on tools and challenges for serving small and medium-sized businesses. Key findings include: brokers have little time after initial sale to engage clients; clients want tailored commercial products but often receive standardized personal lines; brokers need immediate online access to client policy, billing and claims data; and both brokers and clients want simpler processes and a wider variety of specialized coverage options. Overall, the survey highlights the need for insurers to improve digital tools and customize products and services to better meet the unique risks and demands of small and medium commercial customers.
The document summarizes the creative choices made in developing an opening scene for a student thriller film project. It establishes the main characters of Sam, a homeless man, and Norma, the killer. Sam is shown sitting alone in an underpass, representing gritty realism. Norma is then seen crossing out pictures, hinting at her being a killer. Costumes and names for the characters were chosen to convey specific meanings and reference other films, with Sam appearing vulnerable and Norma threatening. Sound design and lighting were used to build suspense and tension. The narrative focused on a hate crime against the homeless to comment on real issues while connecting to other thrillers.
PM ini mengatur tentang tata cara pelaporan perubahan data perizinan penyiaran bagi lembaga penyiaran publik, swasta, komunitas, dan berlangganan. Diatur mengenai pelaporan perubahan nama, domisili, susunan pengurus, anggaran dasar, lokasi pemancar, frekuensi, jangkauan wilayah, dan keanggotaan jaringan lembaga penyiaran.
What kind of media institute may distribute your media product?SamB117
Warp Films would be a suitable distributor for the product. A distributor is responsible for marketing a film through activities like setting the release date and determining how the film is presented or made viewable (e.g. theatrical release or DVD/digital download). Warp Films is an experienced independent film company that distributes low-budget films similar to what is being produced. They distribute films appealing to the target audiences for this product.
Graeme Archibald has over 30 years of experience in land referencing and management. He played instrumental roles in Scotland's largest infrastructure projects, including managing land acquisition for railway projects like the Queen Street Station and Waverley Steps projects. Through these roles, he has gained expertise in dealing with stakeholders like landowners, managing teams, and understanding both public and private sector processes. He introduces innovative techniques like GIS mapping and collaborative work planning to efficiently meet project deadlines, budgets, and compliance with parliamentary timelines.
The document discusses two ethical dilemmas faced by a newspaper regarding an undercover investigation of poor conditions at a government-run mental hospital. In the first dilemma, the newspaper debates whether to allow their reporter to go undercover at the hospital using deception to fully investigate the problems. In the second dilemma, they debate whether to publish a story exposing the government's poor management of the hospital given it could endanger their small newspaper. The newspaper ultimately decides deception is justified to uncover the truth, and to publish as a case study omitting strong stances to balance transparency with avoiding government retaliation.
This document discusses strategies for promoting stories on social media platforms including Twitter, LinkedIn, Facebook, and Pinterest. It provides metrics on follower growth for a Twitter account promoting stories over time. It also mentions curating stories from sites like Storify and writing short briefs to accompany visual elements shared on platforms like Pinterest and Facebook.
Tera Melos is an experimental rock band formed in 2004 in Sacramento, California. The band currently consists of guitarist and vocalist Nick Reinhart, bassist Nathan Latona, and drummer John Clardy. They incorporate various styles of rock and jazz into their music and are known for their involvement in the math rock subgenre. The band has released several albums between 2005 and 2013, including their most recent album X'ed Out.
Softvérové riešenie macroscop s videoanalýzou obrazu patrí medzi najlešie riešenia pre stredné a veľké kamerové systémy. Udalosti sa dajú veľmi rýchlo a efektívne vyhľadať v archíve systému.
The document is a transcription of the song "Telephone" by Lady Gaga featuring Beyoncé. It contains the lyrics to the song, along with copyright information attributing the transcription to Deusdet Coppen and reserving rights for Lady Gaga. The lyrics describe ignoring phone calls to have fun dancing at a club instead.
This document provides information about an online test preparation forum for the GATE exam. It advertises classroom mock tests in 25 cities across India, designed by IISc alumni. It also details online discussion forums and other resources for students. The document then provides a sample test paper containing 35 single-choice questions and 20 multi-choice questions covering topics in computer science like algorithms, data structures, automata theory and computer architecture.
This document contains a past GATE exam paper from 1996. It provides 23 multiple choice questions in Section A that test concepts in computer science such as data structures, algorithms, automata theory, programming, operating systems, computer architecture, and discrete mathematics. It also advertises classroom test series conducted by GATE Forum to help students prepare for the GATE exam through mock tests and online discussion forums with IISc alumni.
This document provides information about a GATE CS mock exam from 1999, including sample questions from sections A and B. It advertises a test preparation series offered by GATE Forum, providing full practice exams designed by IISc alumni. The questions cover topics like probability, algorithms, automata, databases, operating systems, and computer architecture. It encourages readers to join online discussion forums to review exam papers with other students preparing for GATE CS.
This document provides information about a GATE CS test from 2001 and discusses joining an All India Mock GATE classroom test series conducted by GATE Forum. It includes sample questions from Section A of the 2001 GATE CS test paper with one-mark multiple choice sub-questions on topics like matrices, logic, automata theory, algorithms, databases and operating systems.
This document contains a 20 question multiple choice exam on topics in computer science such as algorithms, data structures, automata theory, and programming. Some example questions are about the number of states in a deterministic finite automaton for a specific language, properties of regular languages, time complexity of sorting algorithms, and topological ordering of directed acyclic graphs. The exam also contains a section matching scheduling algorithms to applications and classifying statements about threads as true or false.
This document appears to be a study guide for the GATE CS exam from 2002. It provides 25 one-mark questions in Section A and 25 two-mark questions in Section B on topics related to computer science. The questions cover areas such as algorithms, data structures, computer architecture, programming languages, theory of computation and operating systems. Fifteen of the two-mark questions from Section B need to be answered on the provided answer book.
This document contains a sample question paper for the CS GATE exam from 2010. It has 55 questions worth 1 or 2 marks each. The questions cover topics like graphs, algorithms, data structures, computer architecture, theory of computation and programming in C.
AP PGECET Computer Science 2016 question paperEneutron
This document contains instructions for a 120-minute, 120-question multiple choice exam with 4 answer choices for each question. It states that each question carries 1 mark and there are no penalties for wrong answers. The booklet contains 16 pages and students should notify the invigilator of any issues. Answers must be marked on the provided OMR answer sheet using a blue or black pen.
The document provides instructions for a GATE exam. It states that the exam is 3 hours long and contains questions worth 1 or 2 marks. It provides details on how answers should be marked on the answer sheet, notes on calculators and rough work, and information that negative marks will be given for incorrect answers. The instructions emphasize accurately filling out identification details on the answer sheet and carefully reading the entire paper.
This document provides information about joining an All India Mock GATE Classroom Test Series conducted by GATE Forum in over 25 cities across India. The test series includes section tests and full tests designed by IISc alumni according to the latest GATE syllabus. Participants receive their percentile, all India rank, and can interact with IISc alumni through online discussion forums. More details can be found by visiting the GATE Forum website.
This document provides information about a GATE exam test paper from 2001. It includes 25 single-mark questions and 25 two-mark questions covering various mechanical engineering topics. It also provides information about joining mock GATE test series and online discussion forums to help prepare for the GATE exam.
This document contains a sample paper for the CS GATE exam from 2009. It includes 56 multiple choice questions worth 1 or 2 marks each. The questions cover topics such as computer organization, operating systems, algorithms, theory of computation, programming and data structures. An excerpt of the question paper is provided in the document for reference.
This document contains a 25 question multiple choice quiz about computer science topics. The questions cover topics like Boolean algebra, graphs, probability, algorithms, automata theory, programming languages, operating systems, computer networks, databases and software engineering. The majority of the questions can be answered by applying basic concepts from these topics at an undergraduate level.
This document contains a 25 question multiple choice quiz about computer science topics. The questions cover topics like Boolean algebra, graphs, probability, algorithms, automata theory, programming languages, operating systems, computer networks, databases and software engineering. For each question there are 4 possible answer choices, with one being marked as the correct answer. Explanations are provided for some of the questions.
This document contains a GATE exam question paper from 2000 with multiple choice questions in sections A and B testing knowledge of computer science topics. Section A contains 23 one-mark questions and section B contains 26 two-mark questions covering areas like algorithms, data structures, computer architecture, databases and more. The questions test understanding of concepts like binary trees, graphs, complexity analysis, regular expressions and more through matching, reasoning and problem solving questions.
This document contains multiple choice questions about MATLAB input and output, arithmetic operations, algebra, and managing variables. It asks about MATLAB commands, variable types, matrix operations, and polynomial functions. The correct answers are provided at the end.
CAPE Computer Science Unit 1 Paper 1 - Practice PaperAlex Stewart
This document provides a practice exam for the Caribbean Examinations Council Advanced Proficiency Examination in Computer Science. The exam covers fundamentals of computer science, including programming constructs like loops and functions, generations of programming languages, and basic computer hardware concepts. It consists of 45 multiple choice questions testing these core CS topics.
The document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, automata theory, computer architecture, operating systems and more. Sample questions include properties of finite state automata and pushdown automata, complexity analysis of graph algorithms, cache hierarchies, pipelining and more.
The document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, automata theory, computer architecture, operating systems and more. Sample questions include properties of finite state automata and pushdown automata, complexity analysis of graph algorithms, cache hierarchies, pipelining and more.
important C questions and_answers praveensomeshpraveensomesh
This document contains 40 multiple choice questions related to the C programming language. The questions cover topics like data types, operators, arrays, pointers, functions, input/output, and more. Each question is followed by 4 possible answers, with the correct answer indicated. This quiz can be used to test knowledge of core C programming concepts and help identify areas requiring more study.
Audio visual round fun quiz competitionRavi Rajput
This document appears to be a quiz containing 20 multiple choice or identification questions about movies, songs, companies, and people related to popular Indian culture and business. The questions cover topics like identifying dialogs and characters from movies, recognizing logos of companies, naming lyricists of songs, and matching taglines to brands. The quiz touches on elements of Bollywood cinema, Indian classical music, famous CEOs, and major Indian corporations to test popular culture and business knowledge.
Ethical hacking involves authorized penetration testing of systems to identify vulnerabilities by professional security experts. It requires strong technical skills as well as adherence to ethical standards of only testing with permission, not damaging systems, and maintaining confidentiality. Common hacking techniques like exploiting software vulnerabilities, password cracking, and social engineering are used to simulate attacks, but done carefully to help organizations strengthen their defenses rather than for malicious purposes. A final report outlines findings and recommendations to help clients better protect their networks and systems.
The Mozilla Manifesto outlines 10 principles that guide their mission to promote an open, innovative, and opportunity-filled web. It states that the internet is an integral part of modern life and must remain a global public resource that is open and accessible to enrich individuals' lives while also protecting their security and privacy. It also emphasizes that an interoperable internet, innovation, participation, and open source software promote the development of the internet as a public resource, while transparent and community-based processes build participation, accountability and trust.
The document discusses Wi-Fi technology and wireless networking. It describes Wi-Fi standards such as 802.11b, 802.11a, 802.11g, 802.11n and the emerging 802.11ac standard. It explains the basic elements of a Wi-Fi network including access points, Wi-Fi cards, and security measures. It also outlines how Wi-Fi networks function and different topology types including AP-based and peer-to-peer. Finally, it lists applications of Wi-Fi and advantages and disadvantages of the technology.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
Syllabus cs and_IT 2nd year UTU( Uttarakhand technical university)Ravi Rajput
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive function. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
The document defines computer networks and distributed networks. It explains that computer networks allow devices to exchange data through connections. The main goals of computer networks are resource sharing and increasing reliability and performance. Some key applications of networks include accessing remote programs and databases, file sharing, streaming media, and information sharing over the internet. The document also defines data communication and its components. It explains that data communication refers to the exchange of data between a source and receiver. The major components are the message, sender, receiver, medium, and protocols. Finally, the document discusses common network topologies like bus, star, ring, mesh and tree; and explains their advantages and disadvantages.
The document discusses topics related to computer science and engineering entrance examinations. It contains sample questions on sets, functions, algorithms, complexity analysis, logic, automata theory and computability. The document provides answers to the questions and explanations for the solutions. It is intended to help students prepare for the GATE (Graduate Aptitude Test in Engineering) exam through practice tests and classroom coaching.
This document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, logic, automata theory and databases. Sample questions ask about the minimum number of multiplications needed to evaluate a polynomial, the expected value of the smallest number in a random sample, and the recovery procedure after a database system crash during transaction logging.
Video conferencing allows for transmission of image and speech between two or more locations in real time similar to a phone call. It has benefits like enhancing communication, increasing connections worldwide, and saving time and resources. Video conferencing can be used for meetings, education, telemedicine, courts, and telecommuting. PSJA ISD's network provides high-speed access throughout the district and institutions for effective video conferencing using traditional dedicated equipment or internet-based options.
The document provides an introduction to basic HTML elements and tags. It explains the structure of an HTML document with the <html>, <head>, and <body> tags. It describes common page elements like the <title>, headings (<h1>-<h6>), paragraphs (<p>), and horizontal rules (<hr>). It also covers how to change text formatting with font tags and attributes for color, size, bold, italics. Additionally, it discusses how to add links, images, lists, tables, and special characters to an HTML page.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
How to Fix the Import Error in the Odoo 17Celine George
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
How to Make a Field Mandatory in Odoo 17Celine George
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
1. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
SECTION - A
1. This question has 25 parts. Each part carries 1 mark. Choose the correct
alternative for each part.
1.1 A single instruction to clear the lower four bits of the accumulator in 8085 assebly
language?
(a) XRI OFH (b) ANI FOH (c) XRI FOH (d) ANI OFH
1.2 Which of the following statements is true?
(a) ROM is a Read/Write memory
(b) PC points to the last instruction that was executed
(c) Stack works on the principle of LIFO
(d) All instructions affect the flags
1.3 In a vectored interrupt
(a) the branch address is assigned to a fixed location in memory
(b) the interrupt source supplies the branch information to the processor through
an interrupt vector
(c) the branch address is obtained from a register in the processor
(d) none of the above
1.4 In the following Pascal program segment, what is the value of X after the
execution of the program segment?
X:=-10; Y:=20;
If X > Y then if X < 0 then X:=abs(X) else X:=2*X;
(a) 10 (b) -20 (c) -10 (d) None
1.5 Merge sort uses
(a) Divide and conquer strategy (b) Backtracking approach
(c) Heuristic search (d) Greedy approach
1.6 The principle of locality justifies the use of
(a) interrupts (b) DMA
(c) Polling (d) Cache Memory
1.7 In a paged segmented scheme of memory management, the segment table itself
must have a page table because
(a) the segment table is often too large to fit in one page
(b) each segment is spread over a number of pages
2. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
(c) segment tables point to page table and not to the physical locations of the
segment
(d) the processor’s description base register points to a page table
1.8 Which of the following page replacement algorithms suffers from Belady’s
anamoly?
(a) Optimal replacement (b) LRU
(c) FIFO (d) Both (a) and (c)
1.9 In some programming languages, an identifier is permitted to be a letter
following by any number of letters or digits. If L and D denote the sets of letters
and digits respectively, which of the following expressions defines an identifier?
(a) ( )L D
+
∪ (b) ( )
*
L L D∪ (c) ( )
*
.L D (d) ( )
*
. .L L D
1.10 Consider a grammar with the following productions
S a b b c aB
S S b
S b b ab
S bd b b
→ ∝ ∝
→∝
→∝
∝→
The above grammar is:
(a) Context free (b) Regular
(c) Context sensitive (d) LR(k)
1.11 What are x and y in the following macro definition?
macro Add x,y
Load y
Mul x
Store y
end macro
(a) Variables (b) Identifiers
(c) Actual parameters (d) Formal parameters
1.12 What is the distance of the following code 000000, 010101, 000111, 011001,
111111?
(a) 2 (b) 3 (c) 4 (d) 1
1.13 Which of the following strings can definitely be said to be tokens without looking
at the next input character while compiling a Pascal program?
I. begin II. program III. <>
3. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
(a) I (b) II (c) III
(d) All of the above
1.14 A linker is given object modules for a set of programs that were compiled
separately. What information need to be included in an object module?
(a) Object code
(b) Relocation bits
(c) Names and locations of all external symbols defined in the object module
(d) Absolute addresses of internal symbols
1.15 Which scheduling policy is most suitable for a time shared operating system?
(a) Shortest Job First (b) Round Robin
(c) First Come First Serve (d) Elevator
1.16 For merging two sorted lists of sizes m and n into a sorted list of size m+n, we
required comparisons of
(a) ( )O m (b) ( )O n
(c) ( )O m n+ (d) ( )log logO m n+
1.17 A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is:
(a) 2log n (b) 1n − (c) n (d) 2n
1.18 The probability that a number selected at random between 100 and 999 (both
inclusive) will not contain the digit 7 is:
(a)
16
25
(b)
3
9
10
(c)
27
75
(d)
18
25
1.19. Let R be a symmetric and transitive relation on a set A. Then
(a) R is reflexive and hence an equivalence relation
(b) R is reflexive and hence a partial order
(c) R is reflexive and hence not an equivalence relation
(d) None of the above
1.20. The number of elements in he power set ( )P S of the set ( ) ( ){ },1, 2,3S φ= is:
(a) 2 (b) 4 (c) 8
(d) None of the above
4. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
1.21. In the interval 0,π the equation cosx x= has
(a) No solution (b) Exactly one solution
(c) Exactly two solutions (d) An infinite number of solutions
1.22. If at every point of a certain curve, the slope of the tangent equals
2x
y
−
the
curve is
(a) a straight line (b) a parabola
(c) a circle (d) an ellipse
1.23. The value of k for which 2 2
4 8 0x xy ky− + = does not represent a pair of straight
lines (both passing through the origin) is:
(a) 0 (b) 2 (c) 9 (d) 3
1.24. The rank of the following ( ) ( )1 1n n+ × + matrix, where a is a real number is
2
2
2
1
1
1
n
n
n
a a a
a a a
a a a
L
L
M M M M
M M M M
L
(a) 1 (b) 2 (c) n
(d) Depends on the value of a
1.25 The minimum number of edges in a connected cyclic graph on n vertices is:
(a) n - 1 (b) n (c) n + 1
(d) None of the above
2. This question has 25 parts. Each part carries 2 Marks. Choose the correct
alternative for each part.
2.1 A sequence of two instructions that multiplies the contents of the DE register pair
by 2 and stores the result in the HL register pair (in 8085 assembly language) is:
(a) XCHG and DAD B (b) XTHL and DAD H
(c) PCHL and DAD D (d) XCHG and DAD H
2.2. The capacity of a memory unit is defined by the number of words multiplied by
the number of bits/word. How many separate address and data lines are needed
for a memory of 4 K × 16?
(a) 10 address, 16 data lines (b) 11 address, 8 data lines
5. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
(c) 12 address, 16 data lines (d) 12 address, 12 data lines
2.3. Assume that X and Y are non-zero positive integers. What does the following
Pascal program segment do?
while X <>Y do
if X > Y then
X:=X – Y
else
Y:=Y – X;
write(X);
(a) Computes the LCM of two numbers
(b) Divides the larger number by the smaller number
(c) Computes the GCD of two numbers
(d) None of the above
2.4. What is the value of X printed by the following program?
program COMPUTE (input, output);
var
X:integer;
procedure FIND (X:real);
begin
X:=sqrt(X);
end;
begin
X:=2
Find(X)
Writeln(X)
end
(a) 2 (b) 2
(c) Run time error (d) None of the above
2.5. What values of A, B, C and D satisfy the following simultaneous Boolean
equations?
0, ,A AB AB AC AB AC CD CD+ = = + + =
(a) A = 1, B = 0, C = 0, D = 1 (b) A = 1, B = 1, C = 0, D = 0
(c) A = 1, B = 0, C = 1, D = 1 (d) A = 1, B = 0, C = 0, D = 0
6. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
2.6. The sequence …………… is an optimal non-preemptive scheduling sequence for the
following jobs which leaves the CPU idle for ……………………. unit(s) of time.
(a) {3,2,1),1 (b) (2,1,3},0 (c) {3,2,1),0 (d) {1,2,3},5
2.7. The address sequence generated by tracing a particular program executing in a
pure demand paging system with 100 records per page with 1 free main memory
frame is recorded as follows. What is the number of page faults?
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320,
0370
(a) 13 (b) 8 (c) 7 (d) 10
2.8. If the cube roots of unity are 1, ω and ω2
, then the roots of the following equation
are ( )
3
1 8 0x − + =
(a) -1, 1 + 2ω, 1 + 2ω2
(b) 1, 1 - 2ω, 1 - 2ω2
(c) -1, 1 - 2ω, 1 - 2ω2
(d) -1, 1 + 2ω, -1 + 2ω2
2.9. A language with string manipulation facilities uses the following operations
head(s): first character of a string
tail(s): all but the first character of astring
concat(s1,s2):s1 s2
for the string acbc what will be the output of
concat(head(s), head(tail(tail(s))))
(a) ac (b) bc (c) ab (d) cc
2.10. A shift reduce parser carries out the actions specified within braces immediately
after reducing with the corresponding rule of grammar
{ }
{ }
{ }
print"1"
print"2"
print"3"
S xxW
S y
W Sz
→
→
→
What is the translation of xxxxyzz using the syntax directed translation scheme
described by the above rules?
(a) 23131 (b) 11233 (c) 11231 (d) 33211
Job Arrival time Burst time
1 0.0 9
2 0.6 5
3 1.0 1
7. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
2.11. A variant record in Pascal is defined by
type varirec = record
number : integer;
case (var1,var2) of
var1: (x,y : integer);
var2: (p.q.: real)
end
end
Suppose an array of 100 records was declared on a machine which uses 4 bytes
for an integer and 8 bytes for a real. How much space would the compiler have to
reserve for the array?
(a) 2800 (b) 2400 (c) 2000 (d) 1200
2.12. The number of 1’s in the binary representation of
( )3 * 4096 15 * 256 5 *16 3+ + + are:
(a) 8 (b) 9 (c) 10 (d) 12
2.13. A unit vector perpendicular to both the vectors
2 2 and 1 2a i j k b j k= − + = + − is:
(a) ( )
1
3
i j k+ + (b) ( )
1
3
i j k+ − (c) ( )
1
3
i j k− − (d) ( )
1
3
i j k+ −
2.14. A bag contains 10 white balls and 15 black balls. Two balls are drawn in
succession. The probability that one of them is black and the other is white is:
(a)
2
3
(b)
4
5
(c)
1
2
(d)
2
1
2.15. The iteration formula to find the square root of a positive real number b using the
Newton Raphson method is
(a) ( )1 3 2k k kx x b x+ = + (b) ( )1 3 2k k b kx x x+ +=
(c) ( )2
1 2k k k kx x x x b+ = − + (d) None of the above
2.16. In a virtual memory system the address space specified by the address lines of
the CUP must be __________ than the physical memory size and _______ than
the secondary storage size.
(a) smaller, smaller (b) smaller, larger
(c) larger, smaller (d) larger, larger
8. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
2.17. Let A be the set of all non-singular matrices over real number and let* be the
matrix multiplication operation. Then
(a) A is closed under* but < A, *> is not a semigroup
(b) <A, *> is a semigroup but not a monoid
(c) <A, *> is a monoid but not a group
(d) <A, *> is a group but not an abelian group
2.18. The solution of differential equation 3 2 0y y y′′ ′+ + = is of the form
(a) 2
1 2
x x
C e C e+ (b) 3
1 2
x x
C e C e−
+ (c) 2
1 2
x x
C e C e− −
+ (d) 2
1 22x x
C e C− −
+
2.19. If the proposition p ν¬ ⇒ is true, then the truth value of the proposition
( ),pV p q¬ ⇒ where ¬ is negation, ‘V’ is inclusive or and ⇒ is implication, is
(a) true (b) multiple valued
(c) false (d) cannot be determined
2.20. Which of the following definitions below generates the same language as L,
where { }such that 1 ?n n
L x y n= >=
I. E xE y xy→
II. ( )x y x xyy+ +
III. x y+ +
(a) I only (b) I and II (c) II and III (d) II only
2.21. The postfix expression for the infix expression
( )* / *A B C D F D E+ + + is:
(a) AB + CD + *F/D + E* (b) ABCD + *F/DE*++
(c) A *B + CD/F *DE++ (d) A + *BCD/F* DE++
2.22. Which of the following statements is true?
I. As the number of entries in a hash table increases, the number of collisions
increases.
II. Recursive programs are efficient
III. The worst case complexity for Quicksort is ( )2
O n
IV. Binary search using a linear linked list is efficient.
(a) I and II (b) II and III (c) I and IV (d) I and III
9. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
2.23. A finite state machine with the following state table has a single input x and a
single out z.
present state next state, z
x=1 x=0
A D, 0 B, 0
B B, 1 C, 1
C B, 0 D, 1
D B, 1 C, 0
If the initial state is unknown, then the shortest input sequence to reach the final
state C is:
(a) 01 (b) 10 (c) 101 (d) 110
2.24. Let { } { }*
0,1 , and 0 1 such that 0n n
L R n∑ = = ∑ = > then the languages L R∪ and
R are respectively
(a) regular, regular (b) not regular, regular
(c) regular, not regular (d) not regular, no regular
2.25. A computer system has a 4K word cache organized in block-set-associative
manner with 4 blocks per set, 64 words per block. The number of bits in the SET
and WORD fields of the main memory address format is:
(a) 15, 40 (b) 6, 4 (c) 7, 2 (d) 4, 6
3. Consider the following high level program segment. Give the contents of the
memory locations for variables W, X, Y and Z after the execution of the program
segment. The values of the variables A and B are 5 CH and 92H, respectively.
Also indicate error conditions if any.
var
A, B, W, X, Y :unsigned byte;
Z :unsigned integer, (each integer is represented by two
bytes)
begin
X :=A+B
Y :=abs(bA-b);
W :=A-B
Z :=A*B
End;
10. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
4. (a) Consider the following Pascal function where A and B are non-zero positive
integers. What is the value of GET(3,2)?
function GET(A,B:integer);integer;
begin
if B = 0 then
GET:=1
else if A < B then
GET:=0
else
GET:=GET(A-1,B)+GET(A-1,B-1)
end ;
(b) The Pascal procedure given for computing the transpose of an N × N (N>1)
matrix A of integers has an error. Find the error and correct it.
Assume that the following declaration are made in the main program
const
MAXSIZE=20;
type
INTARR=array [1.,MAXSIZE,1..MAXSIZE] of integer;
Procedure TRANSPOSE (var A: INTARR; N : integer);
var
I, J, TMP, integer;
begin
for I:=1 to NO – 1 do
for J:=1 to N do
begin
TMP: = A[I,J];
A[I,J]:=A[J,I];
A(J,I}:=TMP
end
end;
5. A computer installation has 1000k of main memory. The jobs arrive and finish in
the following sequences.
Job 1 requiring 200k arrives
Job 2 requiring 350k arrives
Job 3 requiring 300k arrives
Job 1 finishes
Job 4 requiring 120k arrives
11. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
Job 5 requiring 150k arrives
Job 6 requiring 80k arrives
(a) Draw the memory allocation table using Best Fit and First fit algorithms.
(b) Which algorithm performs better for this sequence?
6. What is the number of binary trees with 3 nodes which when traversed in post-
order give the sequence A, B, C? Draw all these binary trees.
7. (a) Determine the number of divisors of 600.
(b) Compute without using power series expansion
0
sin
lim
0x
x
→
SECTION – B
Answer any TEN questions.
8. Construct the LL(1) table for the following grammar.
1. Expr _Expr
2. Expr (Expr)
3. Expr Var Expr Tail
4. ExprTail _Expr
5. ExprTail λ
6. Var Id Var Tail
7. VarTail (Expr)
8. VarTail λ
9. Goal Expr$
9. (a) Translate the arithmetic expression ( )*a b c− + into syntax tree.
(b) A grammar is said to have cycles if it is the case that
AA ⇒ +
Show that no grammar that has cycles can be LL(I).
10. (a) Using the scope rules of Pascal determine the declaration that apply to each
occurrence of the names A and B in the following program segment.
procedure T(U, V, X, Y: integer);
var
A: record
A, B : integer
end;
12. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
B: record
B, A : integer
end;
begin
with A do
begin
A:=4;
B:=V
end;
with B do
begin
A:=X;
B:=Y
end
end;
(b) Find the lexical errors in the following Pascal statement:
if A > 1, then B = 2.5A else read (C);
11. Let L be a language over ∑ i.e., *
L ≤ ∑ . Suppose L satisfies the two conditions
given below
(i) L is in NP and
(ii) For every n, there is exactly one string of length n that belongs to L.
Let c
L be the complement of L over *
∑ . Show that c
L is also in NP.
12. Consider the following sequence of numbers
92, 37, 52, 12, 11, 25
Use bubblesort to arrange the sequence in ascending order. Give the sequence at
the end of each of the first five passes.
13. Obtain the principal (canonical) conjunctive normal form of the propositional
formula
( ) ( )p q V q r∧ ¬ ∧
Where ‘ ∧ ’ is logical and, ‘v’ is inclusive or and ¬ is negation.
14. If the overhead for formatting a disk is 96 bytes for 4000 byte sector,
(a) Compute the unformatted capacity of the disk for the following parameters:
Number of surfaces: 8
Outer diameter of the disk: 12 cm
Inner diameter of the disk: 4 cm
Inter track space: 0.1 mm
13. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
Number of sectors per track: 20
(b) if the disk in (a) is rotating at 360 rpm, determine the effective data transfer
rate which is defined as the number of bytes transferred per second between
disk and memory.
15. (a) Implement a circuit having the following output expression using an inverter
and NAND gate .Z A B C= + +
(b) What is the equivalent minimal Boolean expression (in sum of products form)
for the Karnaugh map given below?
16. The following is an 8085 assembly language program:
MVI B, OAH
MVI A, 05H
LXI H, IC40H
CALL SUB
HLT
SUB CMP M
RZ
INX H
DCR B
JNZ SUB
RET
(a) What does the program do?
(b) What are the contents of registers A and B initially?
(c) What are the contents of HL register pair after the execution of the program?
17. (a) An asynchronous serial communication controller that uses a start stop
scheme for controlling the serial I/O of a system is programmed for a string
of length seven bits, one parity bit (odd parity) and one step bit. The
transmission rate is 1200 bits/second.
(i) What is the complete bit stream that is transmitted for the string ‘0110101’?
(ii) How many such strings can be transmitted per second?
1
1
1
00 01 11 10
00
01
11
10
CD
AB
1
1 1
1
1
14. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
(b) Consider a CRT display that has a text mode display format of 80 × 25
characters with a 9 × 12 character cell. What is the size of the video buffer
RAM for the display to be used in monochrome (1 bit per pixel) graphics
mode?
18. The following is an incomplete Pascal function to convert a given decimal integer
(in the range -8 to +7) into a binary integer in 2’s complement representation.
Determine the expression A, B, C that complete program.
function TWOSCOMP (N:integer):integer;
var
RAM, EXPONENT:integer;
BINARY :integer;
begin
if(N>=-8) and (N<=+7) then
begin
if N<0 then
N : = A;
BINARY:=0;
EXPONENT:=1;
while N<>0 do
begin
REM:=N mod 2;
BINARY:=BINARY + B*EXPONENT;
EXPONENT:=EXPONENT*10;
N :=C
end
TWOSCOMP:=BINARY
end
end;
19. Consider the following program segment for concurrent processing using
semaphore operators P and V for synchronization. Draw the precedence graph for
the statements S1 to S9.
var
a, b, c, d, e, f, g, h, i, j, k : semaphore;
begin
cobegin
begin S1; V(a); V(b) end;
begin P(a); S2; V(c); V(d) end;
begin P(c); S4; V(c) end;
15. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
begin P(d); S5; V(f) end;
begin P(e); P(f); S7; V(k) end;
begin P(b); S3;V(g);V(h) end;
begin P(g); S6; V(i) end;
begin P(h); P(i); S8; V(j) end;
begin P(j); P(j); P(k); S9 end;
coend
end;
20. The head of a moving head disk with 100 tracks numbered 0 to 99 is currently
serving a request at tract 55. If the queue of requests kept in FIFO order is
10, 70, 75, 23, 65
Which of the two disk scheduling algorithms FCFS (First Come First Served) and
SSTF (Shortest Seek Time First) will require less head movement? Find the head
movement for each of the algorithms.
21. Let 1 2andG G be subgroups of a group G.
(a) Show that 1 2G G∩ is also a group of G
(b) Is 1 2G G∪ always a subgroup of G?
22. How many minimum spanning trees does the following graph have? Draw them.
(Weights are assigned to the edge).
23. Prove using mathematical induction for 2
5,2n
n n≥ >
24. Prove that in finite graph, the number of vertices of odd degree is always even.
25. (a) Find the minimum value of 2
3 4 2 .x x− +
(b) Determine the number of positive integers ( )720≤ which are not divisibly by
any of numbers 2, 3, and 5.
A B
C
DE
2
3
5
4
3
4
16. GATE CS - 1995 www.gateforum.com
Join discussion of this test paper at http://forum.gatementor.com
Join All India Mock GATE Classroom Test Series - 2007 conducted by GATE Forum in over 25 cities all over India. Question
Papers including section tests and full tests are designed by IISc alumni according to the latest syllabus. Percentile, All India Rank,
interaction with IISc alumni in our online discussion forums, and more. For more details,
visit
www.gateforum.com
Think GATE Think GATE Forum
26. (a) Consider the relation scheme R(A, B, C) with the following functional
dependencies:
A, B C, C A
Show that the scheme R is the Third Normal Form (3NF) but not in Boyce-
Code Normal Form (BCNF).
(b) Determine the minimal keys of relation R.
27. Consider the relation scheme.
AUTHOR (ANAME, INSTITUTION, ACITY, AGE)
PUBLISHER (PNAME, PCITY)
BOOK (TITLE, ANAME, PNAME)
Express the following queries using (one or more of )SELECT, PROJECT, JOIN and
DIVIDE operations.
(a) Get the names of all publishers.
(b) Get values of all attributes of all authors who have published a book for the
publisher with PNAME = ‘TECHNICAL PUBLISHERS’.
(c) Get the names of all authors who have published a book for any publisher
located in Madras.