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 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 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 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 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 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 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.
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 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 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 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 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 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 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.
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 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 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.
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 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.
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 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.
The document provides a blue print and model question paper for Informatics Practices class 12 exam. The blue print outlines the topics, number of questions and marks distribution. It allocates 38 questions worth 70 marks across topics like Networking, Java Programming, RDBMS and IT Applications. The model question paper has 7 sections with 1 to 6 questions in each worth a total of 70 marks to be attempted in 3 hours. It covers different concepts like HTML, XML, Database, Java etc.
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 set of multiple choice questions and answers related to programming in C. Some key points covered include:
- Literal means a string constant
- Coercion refers to implicit type conversion
- The output of printf("%d", printf("tim")); is tim3
- Automatic variables that are not initialized have an unpredictable value
- main() is often called a high level language
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.
The document is a sample paper for Class XII Subject Informatics Practices. It consists of 3 sections - Section A with 30 marks, Section B with 20 marks each, and Section C with 20 marks each. Section A contains short answer questions, Section B contains case studies and questions, and Section C contains SQL queries and output questions. The document provides answer keys for all questions.
20101017 program analysis_for_security_livshits_lecture02_compilersComputer Science Club
This document provides an introduction and overview of compiler optimization techniques, including:
1) Flow graphs, constant folding, global common subexpressions, induction variables, and reduction in strength.
2) Data-flow analysis basics like reaching definitions, gen/kill frameworks, and solving data-flow equations iteratively.
3) Pointer analysis using Andersen's formulation to model references between local variables and heap objects. Rules are provided to represent points-to relationships.
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.
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.
The document provides a sample question paper for Class XII Informatics Practices exam. It includes a blueprint showing the distribution of questions by topic, type and marks. It also includes a sample paper with 7 sections consisting of short answer and long answer questions related to networking, programming, databases, IT applications and object oriented programming. The marking scheme for the sample questions is also provided.
This document contains a software engineering exam with questions covering various topics:
1. The first part asks about key challenges in software engineering like delivery and emergent system properties. It also asks about critical systems and the spiral model.
2. The second part asks about architectural design decisions, control styles, and advantages of object models. It also covers agile methods, pair programming, and software prototyping.
3. The exam concludes with questions on verification vs validation, cleanroom software development, equivalence partitioning, software cost estimation, and project staffing.
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.
This document contains four sets of questions for a Design and Analysis of Algorithms exam. The questions cover a range of algorithm and complexity topics, including performance analysis, matrix operations, greedy algorithms, dynamic programming, graph algorithms, NP-completeness, and more. Students must choose 5 of the 16 questions to answer in detail.
Sleep problems are common in children with autism spectrum disorder. A lack of sleep may increase autistic behaviors like crying, rocking, and aggression. Abnormal melatonin production can disrupt the internal sleep-wake rhythm in these children, contributing to sleep disorders. Educators can help by supporting parents in addressing potential sleep issues.
The document discusses supporting autistic students in schools. It notes that over half of parents do not feel their autistic children are making good educational progress. It also reports that teachers often lack knowledge about autism. The document then provides information on what autism is and how it can affect children at school. It gives strategies for helping autistic students, such as using visual aids and designating a safe space for students when anxious. The National Autistic Society aims to help professionals support autistic children through educational conferences.
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 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.
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 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.
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 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.
The document provides a blue print and model question paper for Informatics Practices class 12 exam. The blue print outlines the topics, number of questions and marks distribution. It allocates 38 questions worth 70 marks across topics like Networking, Java Programming, RDBMS and IT Applications. The model question paper has 7 sections with 1 to 6 questions in each worth a total of 70 marks to be attempted in 3 hours. It covers different concepts like HTML, XML, Database, Java etc.
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 set of multiple choice questions and answers related to programming in C. Some key points covered include:
- Literal means a string constant
- Coercion refers to implicit type conversion
- The output of printf("%d", printf("tim")); is tim3
- Automatic variables that are not initialized have an unpredictable value
- main() is often called a high level language
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.
The document is a sample paper for Class XII Subject Informatics Practices. It consists of 3 sections - Section A with 30 marks, Section B with 20 marks each, and Section C with 20 marks each. Section A contains short answer questions, Section B contains case studies and questions, and Section C contains SQL queries and output questions. The document provides answer keys for all questions.
20101017 program analysis_for_security_livshits_lecture02_compilersComputer Science Club
This document provides an introduction and overview of compiler optimization techniques, including:
1) Flow graphs, constant folding, global common subexpressions, induction variables, and reduction in strength.
2) Data-flow analysis basics like reaching definitions, gen/kill frameworks, and solving data-flow equations iteratively.
3) Pointer analysis using Andersen's formulation to model references between local variables and heap objects. Rules are provided to represent points-to relationships.
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.
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.
The document provides a sample question paper for Class XII Informatics Practices exam. It includes a blueprint showing the distribution of questions by topic, type and marks. It also includes a sample paper with 7 sections consisting of short answer and long answer questions related to networking, programming, databases, IT applications and object oriented programming. The marking scheme for the sample questions is also provided.
This document contains a software engineering exam with questions covering various topics:
1. The first part asks about key challenges in software engineering like delivery and emergent system properties. It also asks about critical systems and the spiral model.
2. The second part asks about architectural design decisions, control styles, and advantages of object models. It also covers agile methods, pair programming, and software prototyping.
3. The exam concludes with questions on verification vs validation, cleanroom software development, equivalence partitioning, software cost estimation, and project staffing.
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.
This document contains four sets of questions for a Design and Analysis of Algorithms exam. The questions cover a range of algorithm and complexity topics, including performance analysis, matrix operations, greedy algorithms, dynamic programming, graph algorithms, NP-completeness, and more. Students must choose 5 of the 16 questions to answer in detail.
Sleep problems are common in children with autism spectrum disorder. A lack of sleep may increase autistic behaviors like crying, rocking, and aggression. Abnormal melatonin production can disrupt the internal sleep-wake rhythm in these children, contributing to sleep disorders. Educators can help by supporting parents in addressing potential sleep issues.
The document discusses supporting autistic students in schools. It notes that over half of parents do not feel their autistic children are making good educational progress. It also reports that teachers often lack knowledge about autism. The document then provides information on what autism is and how it can affect children at school. It gives strategies for helping autistic students, such as using visual aids and designating a safe space for students when anxious. The National Autistic Society aims to help professionals support autistic children through educational conferences.
The document discusses autism, the work of Behavior Momentum India Foundation, and ways to join their cause. It defines autism as a neurological disorder affecting language, communication, social skills, and more. It outlines the Foundation's work in autism awareness, applied behavior analysis therapy centers, ABA education and training, vocational programs, and plans for an assisted living village for adults with autism. The Foundation seeks to expand its centers, training programs, and village through joining their cause.
This document discusses behavior therapy for teenagers and young adults with autism spectrum disorders. It begins by providing credentials for the author, Daniel C. Marston, who has over 15 years of experience providing behavioral health services to individuals with neurological disorders. It then discusses autism spectrum disorders and the diagnostic criteria for autism, Asperger's disorder, and pervasive developmental disorder based on the DSM-IV. The document discusses empirically-based practice in psychology and core principles. It covers neurological and psychological aspects and theories of autism based on research. Finally, it discusses psychological effects of autism, including personality traits, quality of life, gender differences, and anxiety/mood problems in adolescents with autism.
Autism is a developmental disorder that affects communication and behavior and is characterized by difficulties with social interaction and communication. While the specific causes are unknown, it is thought to involve a combination of genetic and environmental factors influencing early brain development. Statistics show that about 1 in 42 boys and 1 in 189 girls are diagnosed with autism in the US, and prevalence has been increasing 10-17% annually. Students with autism may struggle with social skills, focus, organization and processing sensory information. Common accommodations include extra time on tests, preferential seating, and visual aids, while modifications alter the curriculum or grading.
Autism is a developmental disorder that appears in early childhood and affects social and communication skills. Boys are affected more than girls. While the causes are unknown, early signs may include lack of speech, repetitive movements, lack of eye contact and social skills. Treatment options include applied behavior analysis therapy, occupational therapy, speech therapy and sometimes medications to treat related symptoms. Diet changes eliminating gluten have helped some children with autism.
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.
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 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.
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 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 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 25 question multiple choice exam on computer science topics. The questions cover a range of subjects including formal languages, automata theory, algorithms, computer architecture, operating systems, databases and more. For each question, students are instructed to select the most appropriate answer among 4 options (A, B, C or D) and mark their response on an answer sheet. The exam is divided into two sections, with the first section containing 25 one-mark questions and the second section containing 25 two-mark questions.
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.
Gate 2013 computer science and information technology previous year paperLokesh Kataria
The document provides instructions for a computer science and information technology exam. It details that the exam is 3 hours, contains 65 multiple choice questions worth 100 marks, and includes sections on computer science and general aptitude. Instructions are provided on filling out the optical response sheet, types of questions, marking scheme, and materials allowed.
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 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.
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.
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.
The document contains a sample test for the CDAC Common Admission Test (C-CAT) consisting of 3 sections with a total of 49 multiple choice questions covering topics such as English, programming, computer networks, operating systems, data structures, object-oriented programming, digital logic, and computer architecture. The test is assessing fundamental knowledge expected of candidates applying for admission to CDAC programs.
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.
The document is the midterm examination for an introduction to software engineering course. It contains instructions for the exam, which has multiple choice and essay questions. Students are to write their name, ID, and signature on the cover page and top of the exam booklet. The exam is closed book and has a duration of 75 minutes.
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 was provided by Racquel Jemison, Ph.D., Christina MacLaughlin, Ph.D., and Paulomi Majumder. Ph.D., all of the American Chemical Society, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
Walmart Business+ and Spark Good for Nonprofits.pdfTechSoup
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
The chapter Lifelines of National Economy in Class 10 Geography focuses on the various modes of transportation and communication that play a vital role in the economic development of a country. These lifelines are crucial for the movement of goods, services, and people, thereby connecting different regions and promoting economic activities.
This presentation was provided by Rebecca Benner, Ph.D., of the American Society of Anesthesiologists, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
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 consists of TWENTY-FIVE sub-questions (1.1 – 1.25) of ONE mark
each. For each of these sub-questions, four possible alternatives, A, B, C and D
are provided. Choose the most appropriate alternative and darken its bubble on
the Objective Response Sheet (ORS) against the corresponding sub-question
number using a soft HB pencil. Do not darken more than one bubble for any
sub-question. Do not use the ORS for any rough work. You may use the answer
book (last few pages) for any rough work.
1.1 The rank of the matrix
1 1
0 0
is
(a) 4 (b) 2 (c) 1 (d) 0
1.2 The trapezoidal rule for integration gives exact result when the integrand is a
polynomial of degree
(a) 0 but not 1 (b) 1 but not 0 (c) 0 or 1 (d) 2
1.3 The solution to the recurrence equation ( ) ( ) ( )1
2 3 2 1, 1 1k k
T T T−
= + = is
(a) 2k
(b)
( )1
3 1
2
k +
−
(c) 2log
3
k
(d) 3log
2
k
1.4 The minimum number of colours required to colour the vertices of a cycle with n
nodes in such a way that no two adjacent nodes have the same colour is
(a) 2 (b) 3 (c) 4 (d) 2 2
2
n
n
− +
1.5 In the worst case, the number of comparisons needed to search a singly linked
list of length n for a given element is
(a) log n (b)
2
n
(c) 2log 1n
− (d) n
1.6 Which of the following is true?
(a) The set of all rational negative numbers forms a group under multiplication.
(b) The set of all non-singular matrices forms a group under multiplication.
(c) The set of all matrices forms a group under multiplication.
(d) Both B and C are true.
1.7 The language accepted by a Pushdown Automaton in which the stack is limited to
10 items is best described as
(a) Context free (b) Regular
(c) Deterministic Context free (d) Recursive
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
1.8 “If X then Y unless Z” is represented by which of the following formulas in
prepositional logic? (“ ¬ “, is negation, “∧” is conjunction, and “ ” is implication)
(a) (X∧¬Z) Y (b) (X∧Y) ¬Z (c) X (Y∧¬Z) (d) (X Y)∧¬Z
1.9 A device employing INTR line for device interrupt puts the CALL instruction on the
data bus while
(a) INTA is active (b) HOLD is active
(c) READY is active (d) None of the above
1.10 In 8085 which of the following modifies the program counter?
(a) Only PCHL instruction (b) Only ADD instructions
(c) Only JMP and CALL instructions (d) All instructions
1.11 In serial data transmission, every byte of data is padded with a ‘0’ in the
beginning and one or two ‘1’s at the end of byte because
(a) Receiver is to be synchronized for byte reception
(b) Receiver recovers lost ‘0’s and ‘1’s from these padded bits
(c) Padded bits are useful in parity computation
(d) None of the above
1.12 Minimum sum of product expression for f(w,x,y,z) shown in Karnaugh-map below
is
(a) xz y z′+ (b) xz zx′ ′+
(c) x y zx′ ′+ (d) None of the above
1.13 Which of the following is not a form of memory?
(a) instruction cache (b) instruction register
(c) instruction opcode (d) translation look-a-side buffer
00 01 11 10
00
01
11
10
wx
yz
0 1 1 0
0 0 1x
x 0 0 1
x0 1 1
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
1.14 The decimal value 0.25
(a) is equivalent to the binary value 0.1
(b) is equivalent to the binary value 0.01
(c) is equivalent to the binary value 0.00111…
(d) cannot be represented precisely in binary
1.15 The 2’s complement representation of the decimal value –15 is
(a) 1111 (b) 11111 (c) 111111 (d) 10001
1.16 Sign extension is a step in
(a) floating point multiplication
(b) signed 16 bit integer addition
(c) arithmetic left shift
(d) converting a signed integer from one size to another
1.17 In the C language
(a) At most one activation record exists between the current activation record
and the activation record for the main
(b) The number of activation records between the current activation record and
the activation record fro the main depends on the actual function calling
sequence.
(c) The visibility of global variables depends on the actual function calling
sequence.
(d) Recursion requires the activation record for the recursive function to be
saved on a different stack before the recursive fraction can be called.
1.18 The results returned by function under value-result and reference parameter
passing conventions
(a) Do not differ
(b) Differ in the presence of loops
(c) Differ in all cases
(d) May differ in the presence of exception
1.19 Relation R with an associated set of functional dependencies, F, is decomposed
into BCNF. The redundancy (arising out of functional dependencies) in the
resulting set of relations is
(a) Zero
(b) More than zero but less than that of an equivalent 3NF decomposition
(c) Proportional to the size of F+
(d) Indetermine
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.20 With regard to the expressive power of the formal relational query languages,
which of the following statements is true?
(a) Relational algebra is more powerful than relational calculus
(b) Relational algebra has the same power as relational calculus.
(c) Relational algebra has the same power as safe relational calculus.
(d) None of the above
1.21 In 2’s complement addition, overflow
(a) is flagged whenever there is carry from sign bit addition
(b) cannot occur when a positive value is added to a negative value
(c) is flagged when the carries from sign bit and previous bit match
(d) None of the above
1.22 Which of the following scheduling algorithms is non-preemptive?
(a) Round Robin (b) First-In First-Out
(c) Multilevel Queue Scheduling
(d) Multilevel Queue Scheduling with Feedback
1.23 The optimal page replacement algorithm will select the page that
(a) Has not been used for the longest time in the past.
(b) Will not be used for the longest time in the future.
(c) Has been used least number of times.
(d) Has been used most number of times.
1.24 In the absolute addressing mode
(a) the operand is inside the instruction
(b) the address of the operand is inside the instruction
(c) the register containing the address of the operand is specified inside the
instruction
(d) the location of the operand is implicit
1.25 Maximum number of edges in a n-node undirected graph without self loops is
(a) n2
(b)
( )1
2
n n −
(c) n - 1 (d)
( )( )1
2
n n+
2. This question consists of TWENTY-FIVE sub-questions (2.1 – 2.25) of TWO marks
each. For each of these sub-questions, four possible alternatives, A, B, C and D
are provided. Choose the most appropriate alternative and darken its bubble on
the Objective Response Sheet (ORS) against the corresponding sub-question
number using a soft HB pencil. Do not darken more than one bubble for any
sub-question. Do not use the ORS for any rough work. You may use the answer
book (last few pages) for any rough work.
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
2.1 Consider the following logic circuit whose inputs are functions f1, f2, f3 and output
is f.
Given that
( ) ( )
( ) ( )
( ) ( )
1
2
, , 0,1,3,5 ,
, , 6,7 , and
, , 1, 4,5 ,
f x y z
f x y z
f x y z
=
=
=
∑
∑
∑
f3 is
(a) ( )1, 4,5∑ (b) ( )6,7∑
(c) ( )0,1,3,5∑ (d) None of the above
2.2 Consider the following multiplexor where 10, 11, 12, 13 are four data input lines
selected by two address line combinations A1A0 =00,01,10,11 respectively and f
is the output of the multiplexor. EN is the Enable input.
The function f(x,y,z) implemented by the above circuit is
(a) xyz′ (b) xy+z
(c) x+y (d) None of the above
2.3 Let f(A,B) = .A B′ + Simplified expression for function ( )( ), ,f f x y y z+ is
(a) x z′ +
(b) xyz
(c) xy z′ +
(d) None of the above
f(x,y,z)
f1(x,y,z)
f2(x,y,z)
f3(x,y,z)=?
10
11
12
13
A1
A0
EN
f(x,y,z)=?
4 TO 1
multiplexor
OUTPUT
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.4 What are the states of the Auxillary Carry (AC) and Carry Flag (CY) after
executing the following 8085 program?
MVI H, 5DH
MIV L, 6BH
MOV A, H
ADD L
(a) AC = 0 and CY =0 (b) AC = 1 and CY =1
(c) AC = 1 and CY =0 (d) AC = 0 and CY =1
2.5 The finite state machine described by the following state diagram with A as
starting state, where an arc label is
x
y
and x stands for 1-bit input and y stands
for 2-bit output
(a) Outputs the sum of the present and the previous bits of the input.
(b) Outputs 01 whenever the input sequence contains 11
(c) Outputs 00 whenever the input sequence contains 10
(d) None of the above
2.6 The performance of a pipelined processor suffers if
(a) the pipeline stages have different delays
(b) consecutive instructions are dependent on each other
(c) the pipeline stages share hardware resources
(d) All of the above
2.7 Horizontal microprogramming
(a) does not require use of signal decoders
(b) results in larger sized microinstructions than vertical microprogramming
(c) uses one bit for each control signal
(d) all of the above
2.8 Consider the following declaration of a two-dimensional array in C:
char a[100][100];
Assuming that the main memory is byte-addressable and that the array is stored
starting from memory address 0, the address of a [40][50] is
(a) 4040 (b) 4050 (c) 5040 (d) 5050
0/01
0/00
1/01 1/10
0/01
1/10
A B C
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.9 The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or
3 children is:
(a)
2
n
(b)
( )1
3
n −
(c)
( )1
2
n −
(d)
( )2 1
3
n +
2.10 Consider the following algorithm for searching for a given number x in an
unsorted array A[l..n] having n distinct values:
1. Choose an i uniformly at random from l..nl
2. If A[i]=x then Stop else Goto 1;
Assuming that x is present A, what is the expected number of comparisons made
by the algorithm before it terminates?
(a) n (b) n - 1 (c) 2n (d)
2
n
2.11 The running time of the following algorithm
Procedure A(n)
If n<=2 return(1) else return (A( n ));
Is best described by
(a) O(n) (b) O(log n) (c) O(log log n) (d) O(1)
2.12 A weight-balanced tree is a binary tree in which for each node, the number of
nodes in the let sub tree is at least half and at most twice the number of nodes in
the right sub tree. The maximum possible height (number of nodes on the path
from the root to the furthest leaf) of such a tree on n nodes is best described by
which of the following?
(a) log2n (b) 4
3
log n (c) log3n (d) 3
2
log n
2.13 The smallest finite automaton which accepts the language
{ }length of x is divisible by 3x has
(a) 2 states (b) 3 states (c) 4 states (d) 5 states
2.14 Which of the following is true?
(a) The complement of a recursive language is recursive.
(b) The complement of a recursively enumerable language is recursively
enumerable.
(c) The complement of a recursive language is either recursive or recursively
enumerable.
(d) The complement of a context-free language is context-free
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.15 The Newton-Raphson iteration
( )1
3
2 2
n
n
n
X
X
X
+
= +
can be used to solve the
equation
(a) 2
3X = (b) 3
3X = (c) 2
2X = (d) 3
2X =
2.16 Four fair coins are tossed simultaneously. The probability that at least one head
and one tail turn up is
(a)
1
16
(b)
1
8
(c)
7
8
(d)
15
16
2.17 The binary relation S = φ (empty set) on set A = {1,2,3} is
(a) Neither reflexive nor symmetric (b) Symmetric and reflexive
(c) Transitive and reflexive (d) Transitive and symmetric
2.18 The C language is:
(a) A context free language (b) A context sensitive language
(c) A regular language
(d) Parsable fully only by a Turing machine
2.19 To evaluate an expression without any embedded function calls
(a) One stack is enough
(b) Two stacks are needed
(c) As many stacks as the height of the expression tree are needed
(d) A Turning machine is needed in the general case
2.20 Dynamic linking can cause security concerns because
(a) Security is dynamic
(b) The path for searching dynamic libraries is not known till runtime
(c) Linking is insecure
(d) Cryptographic procedures are not available for dynamic linking
2.21 Which combination of the following features will suffice to characterize an OS as a
multi-programmed OS? (A) More than one program may be loaded into main
memory at the same time for execution. (B) If a program waits for certain events
such as I/O, another program is immediately scheduled for execution. (C) If the
execution of a program terminates, another program is immediately scheduled
for execution.
(a) A (b) A and B (c) A and C (d) A, B and C
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.22 In the index allocation scheme of blocks to a file, the maximum possible size of
the file depends on
(a) the size of the blocks, and the size of the address of the blocks.
(b) the number of blocks used for the index, and the size of the blocks.
(c) the size of the blocks, the number of blocks used for the index, and the size
of the address of the blocks.
(d) None of the above
2.23 A B+
- tree index is to be built on the Name attribute of the relation STUDENT.
Assume that all student names are of length 8 bytes, disk blocks are of size 512
bytes, and index pointers are of size 4 bytes. Given this scenario, what would be
the best choice of the degree (i.e. the number of pointers per node) of the B+
-
tree?
(a) 16 (b) 42 (c) 43 (d) 44
2.24 Relation R is decomposed using a set of functional dependencies, F, and relation
S is decomposed using another set of functional dependencies, G. One
decomposition is definitely BCNF, the other is definitely. 3NF, but it is not known
which is which. To make a guaranteed identification, which one of the following
tests should be used on the decompositions? (Assume that the closures of F and
G are available).
(a) Dependency-preservation (b) Lossless-join
(c) BCNF definition (d) 3NF definition
2.25 From the following instance of a relation schema R(A,B,C), we can conclude that:
(a) A functionally determines B and B functionally determines C
(b) A functionally determines B and B does not functionally determines C
(c) B does not functionally determines C
(d) A does not functionally determines B and B does not functionally determines
C
A B C
1 1 1
1 1 0
2 3 2
2 3 2
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
SECTION B
This section consists of TWENTY questions of FIVE marks each. Any FIFTEEN out of
these questions have to be answered on the Answer Book provided.
3. Let A be a set of n(>0) elements. Let Nr be the number of binary relations on A
and let Nf be the number of functions from A to A.
(a) Give the expression for Nr in terms of n.
(b) Give the expression for Nf in terms of n.
(c) Which is larger for all possible n, Nr or Nf?
4. (a) S = { }1,2 , 2,1 is binary relation on set A = {1,2,3}. Is it irreflexive? Add
the minimum number of ordered pairs to S to make it an equivalence
relation. Give the modified S.
(b) Let S = {a,b} and let (S) be the powerset of S. Consider the binary
relation ‘⊆ (set inclusion)’ on (S). Draw the Hasse diagram corresponding
to the lattice ( (S),⊆)
5. (a) Obtain the eigen values of the matrix
1 2 34 49
0 2 43 94
0 0 2 104
0 0 0 1
A
=
−
−
(b) Determine whether each of the following is a tautology, a contradiction, or
neither (“∨” is disjunction, “∧” is conjunction, “→” is implication, “¬” in
negation, and “↔” is biconditional (if and only if).
(i) ( )A A A↔ ∨
(ii) ( )A B B∨ →
(iii) A ∧ (¬ ( )A B∨
6. Draw all binary trees having exactly three nodes labeled A, B and C on which
Preorder traversal gives the sequence C,B,A.
7. (a) Express the function ( ), ,f x y z xy yz′ ′= + with only one complement operation
and one or more AND/OR operations. Draw the logic circuit implementing the
expression obtained, using a single NOT gate and one or more AND/OR
gates.
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
(b) Transform the following logic circuit (without expressing its switching
function) into an equivalent logic circuit that employs only 6 NAND gates
each with 2-inputs.
8. Consider the following circuit. A = a2a1a0 and B = b2b1b0 are three bit binary
numbers input to the circuit. The output is Z = z3z2z1z0. R0, R1 and R2 are
registers with loading clock shown. The registers are loaded with their input data
with the falling edge of a clock pulse (signal CLOCK shown) and appears as
shown. The bits of input number A, B and the full adders are as shown in the
circuit. Assume Clock period is greater than the settling time of all circuits.
(a) For 8 clocks pulses on the CLOCK terminal and the inputs A, B as shown,
obtain the output Z (sequence of 4-bit values of Z). Assume initial contents
of R0, R1 and R2 as all zeros.
A= 110 011 111 101 000 000 000 000
B= 101 101 011 110 000 000 000 000
Clock No 1 2 3 4 5 6 7 8
(b) What does the circuit implement?
A
EA
CLOCK
b2 a2 a1b1 b0 a0
b2 a2 a1b1
b2 a2
EA
EA
Z=z3
z2
z1 z0
REG R0
(6 – bit)
REG R1
(6 – bit)
REG R2
(5 – bit)
B
0
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
9. Consider the following 32-bit floating-point representation scheme as shown in
the formal below. A value is specified by 3 fields, a one bit sign field (with 0 for
positive and 1 for negative values), a 24 bit fraction field (with the binary point
being at the left end of the fraction bits), and a 7 bit exponent field (in excess-64
signed integer representation, with 16 being the base of exponentiation). The
sign bit is the most significant bit.
(a) It is required to represent the decimal value –7.5 as a normalized floating
point number in the given format. Derive the values of the various fields.
Express your final answer in the hexadecimal.
(b) What is the largest values that can be represented using this format?
Express your answer as the nearest power of 10.
10. In a C program, an array is declared as float A[2048]. Each array element is 4
Bytes in size, and the starting address of the array is 0×00000000. This program
is run on a computer that has a direct mapped data cache of size 8 Kbytes, with
block (line) size of 16 Bytes.
(a) Which elements of the array conflict with element A[0] in the data cache?
Justify your answer briefly.
(b) If the program accesses the elements of this array one by one in reverse
order i.e., starting with the last element and ending with the first element,
how many data cache misses would occur? Justify your answer briefly.
Assume that the data cache is initially empty and that no other data or
instruction accesses are to be considered.
11. The following recursive function in C is a solution to the Towers of Hanoi problem.
Void move (int n, char A, char B, char C)
{
if (………………………………….) {
move (………………………………….);
printf(“Move disk %d from pole %c to pole %cn”, n, A,C);
move (………………………………….);
Fill in the dotted parts of the solution.
1 24 ?
sign fraction exponent
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
12. Fill in the blanks in the following template of an algorithm to compute all pairs
shortest path lengths in a directed graph G with n*n adjacency matrix A.
A[i,j]equals if there is an edge in G from i to j, and 0 otherwise. Your aim in filling
in the blanks is to ensure that the algorithm is correct.
INITIALIZATION: For i = 1 … n
{For j = 1 … n
{ if A[i,j]=0 then P[i,j] = _______ else P[i,j] =____;}
ALGORITHM: For i = 1 …n
{ For j = 1 …n
{For k = 1 …n
{P[__,___]=min{_______,_______};}
}
}
(a) Copy the complete line containing the blanks in the Initialization step and fill
in the blanks.
(b) Copy the complete line containing the blanks in the Algorithm step and fill in
the blanks.
(c) Fill in the blank: The running time of the Algorithm is O(____).
13. (a) In how many ways can a given positive integer n ≥ 2 be expressed as the
sum of 2 positive integers (which are not necessarily distinct). For example,
for n = 3, the number of ways is 2, i.e., 1+2, 2+1. Give only the answer
without any explanation.
(b) In how many ways can a given positive integer n ≥ 3 be expressed as the
sum of 3 positive integers (which are not necessarily distinct). For example,
for n = 4, the number of ways is 3, i.e., 1+2+1, 2+1+1. Give only the
answer without any explanation.
(c) In how many ways can a given positive integer n ≥ k be expressed as the
sum of k positive integers (which are not necessarily distinct)? Give only the
answer without explanation.
14. The aim of the following question is to prove that the language {M | M is the
code of a Turing Machine which, irrespective of the input, halts and outputs a 1},
is undecidable. This is to be done by reducing form the language
{ }, halts on ,M x M x′ ′ which is known to be undecidable. In parts (a) and (b)
describe the 2 main steps in the construction of M. in part (c) describe the key
propery which relates the behaviour of M on its input w to the behaviour of M′ on
x.
(a) On input w, what is the first step that M must make?
(b) On input w, based on the outcome of the first step, what is the second step
that M must make?
(c) What key property relates the behaviour of M on w to the behaviour of M′ on
x?
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
15. A university placement center maintains a relational database of companies that
interview students on campus and make job offers to those successful in the
interview. The schema of the database is given below:
COMPANY (cname, clocation) STUDENT (scrollno, sname, sdegree)
INTERVIEW (cname, srollno, idate) OFFER (cname,srollno, osalary)
The COMPANY relation gives the name and location of the company. The
STUDENT relation gives the student’s roll number, name and the degree program
for which the student is registered in the university. The INTERVIEW relation
gives the date on which a students is interviewed by a company. The OFFER
relation gives the salary offered to a student who is successful in a company’s
interview. The key for each relation is indicated by the underlined attributes.
(a) Write relational algebra expressions (using only the operator ,σ,π,∪,− )
for the following queries:
(i) List the rollnumbers and names of those students who attended at least one
interview but did not receive any job offer.
(ii) List the rollnumbers and names of students who went for interviews and
received job offers from every company with which they interviewed.
(b) Write an SQL query to list, for each degree program in which more than five
students were offered jobs, the name of the degree and the average offered
salary of students in this degree program.
16. For relation R = (L, M, N , O, P), the following dependencies hold:
M O NO P P L and L MN
R is decomposed into R1 =(L, M, N , P) and R2 = (M, O).
(a) Is the above decomposition a lossless-join decomposition? Explain.
(b) Is the above decomposition dependency-preserving? If not, list all the
dependencies that are not preserved.
(c) What is the highest normal form satisfied by the above decomposition?
17. (a) The following table refers to search times for a key in B-trees and B+
-trees.
A successful search means that the key exists in the database and
unsuccessful means that it is not present in the database. Each of the entries
X1, X2, X3 and X4 can have a value of either Constant or Variable. Constant
means that the search time is the same, independent of the specific key
value, where Variable means that it is dependent on the specific key value
chosen for the search.
Give the correct values for the entries X1, X2, X3 and X4 (for example X1 =
Constant, X2= Constant, X3 = Constant, X4= Constant).
B-tree B+
-tree
Successful Search Unsuccessful search Successful Search Unsuccessful search
X1 X2 X3 X4
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
(b) Relation R(A,B) has the following view defined on it:
CREATE VIEW V AS
(SELECT R1.A,R2.B
FROM R AS R1, R AS R2
WHERE R1.B=R2.A)
(i) The current contents of relation R are shown below. What are the contents of
the view V?
(ii) The tuples (2,11) and (11,6) are now inserted into R. What are the additional
tupels that are inserted in V?
18. (a) Draw the process state transition diagram of an OS in which (i) each process
is in one of the five states: created, ready, running, blocked (i.e. sleep or
wait), or terminated, and (ii) only non-preemptive scheduling is used by the
OS. Label the transitions appropriately.
(b) The functionality of atomic TEST-AND-SET assembly language instruction is
given by the following C function.
int TEST-AND-SET (int *x)
{
int y;
A1:y=*x;
A2:*x=1;
A3:return y;
}
(i) Complete the following C functions for implementing code for entering and
leaving critical sections based on the above TEST-AND-SET instruction.
int mutex=0;
void enter-cs()
{
while (…………………………………);
}
A B
1 2
2 3
2 4
4 5
6 7
6 8
9 10
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
void leave-cs()
{
…………………………………..;
}
(ii) Is the above solution to the critical section problem deadlock free and
starvation-free?
(iii) For the above solution, show by an example that mutual exclusion is not
ensured if TEST-AND-SET instruction is not atomic.
19. A computer system uses 32-bit virtual address, and 32-bit physical address. The
physical memory is byte addressable, and the page size is 4 kbytes. It is decided
to use two level page tables to translate from virtual address to physical address.
Equal number of bits should be used for indexing first level and second level page
table, and the size of each page table entry is 4 bytes.
(a) Give a diagram showing how a virtual address would be translated to a
physical address.
(b) What is the number of page table entries that can be contained in each
page?
(c) How many bits are available for storing protection and other information in
each page table entry?
20. The following solution to the single producer single consumer problem uses
semaphores for synchronization.
#define BUFFSIZE 100
buffer buf[BUFFSIZE];
int first=last=0;
semaphore b_full=0;
semaphore b_empty=BUFFSIZE;
void producer()
{
while (1) {
produce an item;
p1: …………………..;
put the item into buff (first);
first=(first+1)%BUFFSIZE;
p2: …………………..;
}
}
void consumer()
{
17. 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
while (1) {
c1:……………………..
take the item from buf[last];
last=(last+1)%BUFFSIZE;
c2: ……………………..;
consume the item;
}
}
(a) Complete the dotted part of the above solution.
(b) Using another semaphore variable, insert one line statement each
immediately after p1, immediately before p2, immediately after c1, and
immediately before c2 so that the program works correctly for multiple
procedures and consumers.
21. We require a four state automaton to recognize the regular expression
( )* .a b abb
(a) Give an NFA for this purpose.
(b) Give a DFA for this purpose.
22. (a) Construct all the parse trees corresponding to i + j * k for the grammar
E E+E
E E*E
E id
(b) In this grammar, what is the precedence of the two operators * and +?
(c) If only one parse tree is desired for any string in the same language, what
changes are to be made so that the resulting LALR(1) grammar is non-
ambiguous?