From 33abe748fbad11bc1f56d4a9c7d2d58a18722a4a Mon Sep 17 00:00:00 2001 From: Ramoo Kachhee Date: Mon, 29 Jun 2026 20:07:02 +0530 Subject: [PATCH 1/3] feat: add AIML semester 3 question papers --- content/rgpv/aiml/semester-3/al-301/pyqs.json | 971 +++++++++++++- content/rgpv/aiml/semester-3/al-302/pyqs.json | 1158 +++++++++++++++- content/rgpv/aiml/semester-3/al-303/pyqs.json | 1018 +++++++++++++- content/rgpv/aiml/semester-3/al-304/pyqs.json | 1179 ++++++++++++++++- content/rgpv/aiml/semester-3/al-305/pyqs.json | 1144 +++++++++++++++- 5 files changed, 5446 insertions(+), 24 deletions(-) diff --git a/content/rgpv/aiml/semester-3/al-301/pyqs.json b/content/rgpv/aiml/semester-3/al-301/pyqs.json index 9f22d12..8190087 100644 --- a/content/rgpv/aiml/semester-3/al-301/pyqs.json +++ b/content/rgpv/aiml/semester-3/al-301/pyqs.json @@ -3,7 +3,972 @@ "id": "al-301", "code": "AL-301", "name": "Technical Communication", - "title": "AL-301 - Technical Communication" + "title": "AD/AL/CD/CY/IO/IS-301 (GS) – Technical Communication", + "semester": "III", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] -} + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the Unity, Brevity and clarity in various forms of communication.", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q1b", + "label": "b)", + "text": "Briefly describe about Interpersonal Communication?", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Explain the barriers of Communication in detail.", + "unit": "Unit 2", + "type": "soft-skills" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is the process and scope of communication?", + "unit": "Unit 1", + "type": "communication-skills" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What are the traits of technical writing? And what are the principles of business writing?", + "unit": "Unit 3", + "type": "writing-skills" + }, + { + "id": "q3b", + "label": "b)", + "text": "Explain format and structure of Technical Report.", + "unit": "Unit 3", + "type": "writing-skills" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What is an Interview? Write do's and don'ts of an interview.", + "unit": "Unit 4", + "type": "interviews" + }, + { + "id": "q4b", + "label": "b)", + "text": "Discuss style and argumentative skills in group discussion.", + "unit": "Unit 4", + "type": "gd" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What is the difference between General and Technical vocabulary?", + "unit": "Unit 5", + "type": "grammar" + }, + { + "id": "q5b", + "label": "b)", + "text": "What are the common errors in speaking and writing? Explain.", + "unit": "Unit 5", + "type": "grammar" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6", + "label": "", + "text": "What are the different types of presentations? Explain.", + "unit": "Unit 4", + "type": "presentations" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7", + "label": "", + "text": "Explain various types of interviews. How should an interviewee prepare for a selection of an interview?", + "unit": "Unit 4", + "type": "interviews" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write a letter of application along with your resume for the post of Software Engineer at TCS, Mumbai.", + "unit": "Unit 4", + "type": "resume" + } + ] + } + ] + }, + { + "exam": "December 2023", + "year": 2023, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Discuss the process and scope of communication.", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q1b", + "label": "b)", + "text": "How clarity can be achieved in technical communication? Describe.", + "unit": "Unit 1", + "type": "communication-skills" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "How can soft skills contribute to success in one's professional life? Explain.", + "unit": "Unit 2", + "type": "soft-skills" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is the difference between verbal and non-verbal Communication? Explain with examples.", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is technical research paper? What is the structure of technical research paper?", + "unit": "Unit 3", + "type": "writing-skills" + }, + { + "id": "q3b", + "label": "b)", + "text": "Enlist the features, types and structure and format of Technical reports.", + "unit": "Unit 3", + "type": "writing-skills" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What benefits does audience analysis provide you as the speaker? Give answer.", + "unit": "Unit 3", + "type": "speaking-skills" + }, + { + "id": "q4b", + "label": "b)", + "text": "What does decorum mean? What are the different forms of decorum? Explain.", + "unit": "Unit 4", + "type": "interviews" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Write a short note on: i) Pronunciation Etiquette ii) Tone", + "unit": "Unit 5", + "type": "grammar" + }, + { + "id": "q5b", + "label": "b)", + "text": "What is syllable in technical communication? What are the different types of syllables? What are the rules of syllables? Discuss.", + "unit": "Unit 5", + "type": "grammar" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Classify importance of communication in globalized world.", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q6b", + "label": "b)", + "text": "What are the barriers to effective communication? How can we overcome language barriers?", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What are the styles of writing in technical communication? Explain.", + "unit": "Unit 3", + "type": "writing-skills" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is Memo? For what purpose are Memo used? You are the managing Director of ABC limited. Draft a memo to the customer relations officer for not attending to a customer complaint.", + "unit": "Unit 3", + "type": "writing-skills" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Answer the following (any two): a) Professional personality Attributes b) Speech and personality c) Delivery and Content of presentation d) Combating Nervousness", + "unit": "Unit 5/4/3", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Why clarity is the ultimate goal of technical communication how can you achieve clarity? Give answer.", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q1b", + "label": "b)", + "text": "Discuss the forms of technical communication, giving suitable examples.", + "unit": "Unit 1", + "type": "communication-skills" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Differentiate Verbal and Non-verbal communication.", + "unit": "Unit 2", + "type": "soft-skills" + }, + { + "id": "q2b", + "label": "b)", + "text": "What are the different types of communication barriers?", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is the role of language in technical writing. Write the characteristics of technical writing.", + "unit": "Unit 3", + "type": "writing-skills" + }, + { + "id": "q3b", + "label": "b)", + "text": "What is mock presentation? Why is mock presentation important? Discuss it.", + "unit": "Unit 3", + "type": "speaking-skills" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What is an Interview? Write do's and don'ts of an interview.", + "unit": "Unit 4", + "type": "interviews" + }, + { + "id": "q4b", + "label": "b)", + "text": "Discuss style and argumentative skills in group discussion.", + "unit": "Unit 4", + "type": "gd" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What is a syllable? Write examples of English syllables.", + "unit": "Unit 5", + "type": "grammar" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain Attributes of Professional Personality in brief.", + "unit": "Unit 5", + "type": "grammar" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6", + "label": "", + "text": "What are the different types of presentations? Explain.", + "unit": "Unit 4", + "type": "presentations" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7", + "label": "", + "text": "Write a letter to the DELL Company placing order for the supply of Two Hundred computers with latest features.", + "unit": "Unit 3", + "type": "writing-skills" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Answer the following (any two): a) Common error in writing and speaking b) Group discussion c) Vocabulary and paralanguage d) Communicating in a global world", + "unit": "Unit 5/4/3/2", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the importance of understanding the audience in technical communication. Provide two examples.", + "unit": "Unit 3", + "type": "speaking-skills" + }, + { + "id": "q1b", + "label": "b)", + "text": "Discuss the forms of technical communication with suitable examples.", + "unit": "Unit 1", + "type": "communication-skills" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Discuss the role of technology in facilitating global communication. What are its advantages and challenges?", + "unit": "Unit 2", + "type": "soft-skills" + }, + { + "id": "q2b", + "label": "b)", + "text": "What are the key principles to keep in mind when delivering bad news in a professional setting?", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Why is clarity important in business writing, and how can writers achieve it?", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q3b", + "label": "b)", + "text": "What are the common causes of nervousness during public speaking or communication?", + "unit": "Unit 3", + "type": "speaking-skills" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What is the primary objective of a group discussion, and how does it differ from other forms of communication?", + "unit": "Unit 4", + "type": "gd" + }, + { + "id": "q4b", + "label": "b)", + "text": "How does body language influence the perception of a professional presentation?", + "unit": "Unit 4", + "type": "presentations" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "How do general vocabulary and technical vocabulary differ and what roles do they play in communication?", + "unit": "Unit 5", + "type": "grammar" + }, + { + "id": "q5b", + "label": "b)", + "text": "What are the basic of grammar? What is grammatical correctness in technical writing?", + "unit": "Unit 5", + "type": "grammar" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Discuss the impact of technology on the process and scope of technical communication. How has it changed the way information is shared, and what are some challenges associated with this shift?", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q6b", + "label": "b)", + "text": "Provide a detailed classification of NVC. How do you apply the NVC process?", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "You observed a fire accident in a slum area near your colony on Saturday night. The incident left you deeply disturbed by the tragic scene. Write a detailed report on the accident, including the cause, damages, response from authorities, and the impact on the affected community.", + "unit": "Unit 3", + "type": "writing-skills" + }, + { + "id": "q7b", + "label": "b)", + "text": "What are the different styles of writing in technical communication? Explain them.", + "unit": "Unit 3", + "type": "writing-skills" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Answer the following (Any two): a) Vocabulary and Paralanguage b) Pronunciation Etiquette c) Communicating in a global world d) Mock presentation", + "unit": "Unit 3/5/2", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the importance of understanding the audience in technical communication. Provide two examples.", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q1b", + "label": "b)", + "text": "How do advancements in technology enhance communication in a globalized environment?", + "unit": "Unit 1", + "type": "communication-skills" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "How can a communicator balance honesty and sensitivity when conveying a difficult message?", + "unit": "Unit 2", + "type": "soft-skills" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is interpersonal communication? Provide a detailed explanation.", + "unit": "Unit 2", + "type": "soft-skills" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Why is it important to adapt vocabulary and paralanguage according to the audience and context? Provide a specific example.", + "unit": "Unit 3", + "type": "speaking-skills" + }, + { + "id": "q3b", + "label": "b)", + "text": "What do you understand by a mock presentation? Explain its significance.", + "unit": "Unit 3", + "type": "speaking-skills" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What are the key elements of a professional presentation? Provide examples of how each element contributes to its effectiveness.", + "unit": "Unit 4", + "type": "presentations" + }, + { + "id": "q4b", + "label": "b)", + "text": "What strategies can you use to assess your performance after an interview and how can this reflection help you improve in future interviews?", + "unit": "Unit 4", + "type": "interviews" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "How can strong communication skills enhance your professional personality and improve workplace relationships?", + "unit": "Unit 5", + "type": "grammar" + }, + { + "id": "q5b", + "label": "b)", + "text": "What is the difference between rising tone and falling tone in speech and how does each affect the meaning of a sentence?", + "unit": "Unit 5", + "type": "grammar" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What are some common barriers to effective interpersonal communication and how can they be overcome?", + "unit": "Unit 2", + "type": "soft-skills" + }, + { + "id": "q6b", + "label": "b)", + "text": "What do you understand by a group discussion? Discuss its objectives and significance.", + "unit": "Unit 4", + "type": "gd" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Why is clarity considered essential in technical communication and what strategies can be used to achieve it? Explain.", + "unit": "Unit 1", + "type": "communication-skills" + }, + { + "id": "q7b", + "label": "b)", + "text": "You are interested in pursuing a course in Computer Hardware. Write a letter seeking information about the same.", + "unit": "Unit 3", + "type": "writing-skills" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Explain the following (any two): a) Listening persuasion b) Delivery and Content of presentation c) Combating Nervousness d) Handling turbulence during interviews", + "unit": "Unit 2/4/3/4", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2025", + "year": 2025, + "month": "December", + "isPredicted": true, + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the importance of communication in a globalized professional environment.", + "unit": "Unit 1", + "type": "communication-skills", + "isPredicted": true + }, + { + "id": "q1b", + "label": "b)", + "text": "Discuss the role of unity, brevity and clarity in technical communication.", + "unit": "Unit 1", + "type": "communication-skills", + "isPredicted": true + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Differentiate between verbal and non-verbal communication with suitable examples.", + "unit": "Unit 2", + "type": "soft-skills", + "isPredicted": true + }, + { + "id": "q2b", + "label": "b)", + "text": "Explain cultural barriers in global communication and how to overcome them.", + "unit": "Unit 2", + "type": "soft-skills", + "isPredicted": true + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Discuss the principles and traits of effective technical writing.", + "unit": "Unit 3", + "type": "writing-skills", + "isPredicted": true + }, + { + "id": "q3b", + "label": "b)", + "text": "Explain the format and structure of a technical report.", + "unit": "Unit 3", + "type": "writing-skills", + "isPredicted": true + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What is audience awareness? Explain its role in effective public speaking.", + "unit": "Unit 3", + "type": "speaking-skills", + "isPredicted": true + }, + { + "id": "q4b", + "label": "b)", + "text": "Describe techniques to combat nervousness during presentations.", + "unit": "Unit 3", + "type": "speaking-skills", + "isPredicted": true + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain the process of preparing for a job interview.", + "unit": "Unit 4", + "type": "interviews", + "isPredicted": true + }, + { + "id": "q5b", + "label": "b)", + "text": "Discuss the importance of non-verbal cues during interviews.", + "unit": "Unit 4", + "type": "interviews", + "isPredicted": true + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Define group discussion. Explain its objectives and evaluation criteria.", + "unit": "Unit 4", + "type": "gd", + "isPredicted": true + }, + { + "id": "q6b", + "label": "b)", + "text": "Discuss argumentation and content skills required for effective group discussion.", + "unit": "Unit 4", + "type": "gd", + "isPredicted": true + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain common grammatical errors in professional communication.", + "unit": "Unit 5", + "type": "grammar", + "isPredicted": true + }, + { + "id": "q7b", + "label": "b)", + "text": "Discuss the importance of vocabulary and pronunciation etiquette.", + "unit": "Unit 5", + "type": "grammar", + "isPredicted": true + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Describe the role of tone and flow in effective speaking.", + "unit": "Unit 5", + "type": "grammar", + "isPredicted": true + }, + { + "id": "q8b", + "label": "b)", + "text": "Explain how speech contributes to professional personality development.", + "unit": "Unit 5", + "type": "grammar", + "isPredicted": true + } + ] + } + ] + } + ] +} \ No newline at end of file diff --git a/content/rgpv/aiml/semester-3/al-302/pyqs.json b/content/rgpv/aiml/semester-3/al-302/pyqs.json index 15c05d5..17348c8 100644 --- a/content/rgpv/aiml/semester-3/al-302/pyqs.json +++ b/content/rgpv/aiml/semester-3/al-302/pyqs.json @@ -3,7 +3,1159 @@ "id": "al-302", "code": "AL-302", "name": "Introduction to Probability and Statistics", - "title": "AL-302 - Introduction to Probability and Statistics" + "title": "AI/AL/CD-302 (GS) – Introduction to Probability and Statistics", + "semester": "III", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] -} + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1", + "label": "", + "text": "A random variable X has the following probability function. Determine K, evaluate P(x<6) and P(0≤x≤4), find minimum value of K if P(x≤K)>(1/2), determine the distribution function of X and mean.", + "unit": "Unit 1", + "type": "basic-probability" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "The density function of a random variable X is f(x)=e^(-x) when x≥0. Find E(x), E(x²) and variance of X.", + "unit": "Unit 2", + "type": "continuous-distributions" + }, + { + "id": "q2b", + "label": "b)", + "text": "Suppose a continuous random variable X has the probability density function f(x)=K(1-x²) for 02).", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q4b", + "label": "b)", + "text": "A manufacturer knows that the condensers he makes contain on average 1% defectives. He packs them in boxes of 100. What is the probability that a box picked at random will contain 3 or more faulty condensers?", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "If X is a normal variate with mean 30 and standard deviation 5. Find i) P(26≤X≤40) ii) P(X≥45).", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q5b", + "label": "b)", + "text": "Find Karl Pearson's coefficient of correlation from the given data on wages and cost of living.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6", + "label": "", + "text": "By the method of least squares fit a parabola of the form y=a+bx+cx² for the given data.", + "unit": "Unit 5", + "type": "applied-statistics" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "It is claimed that a random sample of 49 tyres has mean life of 15200 km. This sampled was drawn from a population whose mean is 15150 km and a standard deviation of 1200 km. Test the significance at 0.05 level.", + "unit": "Unit 5", + "type": "applied-statistics" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define: i) Correlation coefficient ii) Chebyshev's inequality.", + "unit": "Unit 1/4", + "type": "mixed" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "A sample of 26 bulbs gives a mean life of 900 hours with a standard deviation of 20 hours. The manufacturer claims that the mean life of bulbs is 1000 hours. Is the sample not up to the standard. (5% L.O.S.)", + "unit": "Unit 6", + "type": "small-samples" + }, + { + "id": "q8b", + "label": "b)", + "text": "In one sample of 10 observations, the sum of the squares of the deviations of the sample values from mean was 120 and in the other sample of 12 observations, it was 314. Test whether the difference is significant at 5% level?", + "unit": "Unit 6", + "type": "small-samples" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define continuous random variable. Also show that E(X₁X₂...Xₙ)=E(X₁)E(X₂)...E(Xₙ).", + "unit": "Unit 2", + "type": "continuous-distributions" + }, + { + "id": "q1b", + "label": "b)", + "text": "Define non-central and central moments. Also, show that V(2X+3)=4V(X).", + "unit": "Unit 1", + "type": "basic-probability" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Show that Poisson distribution is a limiting case of binomial distribution under the case n→∞, p→0 and np=m.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q2b", + "label": "b)", + "text": "Define gamma distribution. If X follows exponential distribution with parameter λ, then obtain its mean and variance.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "If X~N(μ,σ²), then show that φₓ(t)=e^(iμt-½t²σ²).", + "unit": "Unit 2", + "type": "continuous-distributions" + }, + { + "id": "q3b", + "label": "b)", + "text": "A large number of measurement is normally distributed with a mean 65.5 cm and S.D. of 6.2 cm. Find the percentage of measurement that fall between 54.8 cm and 68.8 cm.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Write down merits and demerits of measure of central tendency. Find the median for the given data.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q4b", + "label": "b)", + "text": "Show that sum of two independent random variables follows normal distribution.", + "unit": "Unit 1", + "type": "basic-probability" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Using method of Least squares, find the curve y=ax+ax² that best fit the given data.", + "unit": "Unit 5", + "type": "applied-statistics" + }, + { + "id": "q5b", + "label": "b)", + "text": "Out of 8000 graduates in a town, 800 are females, out of 1600 graduate employees, 120 are females. Use χ² test to determine if any distinction is made in appointment on the basis of sex. The value of χ² for 1 degree of freedom at 5% level is 3.841.", + "unit": "Unit 6", + "type": "small-samples" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Define Poisson distribution and obtain its mean and variance.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q6b", + "label": "b)", + "text": "Define gamma distribution with parameter λ and obtain its mean, variance, and characteristic function.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What do you mean by measure of kurtosis? Obtain β₁ and β₂ for the function: f(x)=y₀x(2-x); 0≤x≤2.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define Karl Pearson's correlation coefficient and obtain the correlation coefficient for the given data.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Find the rank correlation coefficient for the given data.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q8b", + "label": "b)", + "text": "Define binomial distribution and derive its moment generating function. Hence, obtain its mean and variance.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + } + ] + }, + { + "exam": "December 2023", + "year": 2023, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define discrete random variable and independence of random variable. Also, show that E(X₁+X₂+...+Xₙ)=E(X₁)+E(X₂)+...+E(Xₙ).", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q1b", + "label": "b)", + "text": "Define expectation of random variables. Also, show that V(aX+b)=a²V(X).", + "unit": "Unit 1", + "type": "basic-probability" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "State Chebyshev's inequality. If n→∞, p→0 and np=λ then show that binomial distribution reduces to Poisson distribution.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q2b", + "label": "b)", + "text": "Define gamma distribution. If X follows exponential distribution with parameter θ, then obtain its mean and variance.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Define regression coefficient with its properties. If X~N(μ,σ²), then show that Mₓ(t)=e^(μt+½t²σ²).", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q3b", + "label": "b)", + "text": "Define normal distribution with its properties. Describe the methodology for difference of means for large samples.", + "unit": "Unit 2/5", + "type": "mixed" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What do you understand by measure of central tendency? Also, write down its merits and demerits. Calculate mean and standard deviation for the observations 5, 10, 20, 25, 40, 42, 45, 48, 70, 80.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q4b", + "label": "b)", + "text": "Describe bivariate distribution. Write down the probability density function of bivariate normal distribution.", + "unit": "Unit 3", + "type": "bivariate" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Fit a second degree parabola to the given data.", + "unit": "Unit 5", + "type": "applied-statistics" + }, + { + "id": "q5b", + "label": "b)", + "text": "What do you understand by Chi-square test of goodness of fit? Write condition for applying Chi-square test.", + "unit": "Unit 6", + "type": "small-samples" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Define Binomial distribution and obtain its mean and variance.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q6b", + "label": "b)", + "text": "Define exponential distribution with parameter λ and obtain its mean, variance and moment generating function.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What do you mean by measure of skewness? Write tests of skewness.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define Spearman's rank correlation coefficient and obtain rank correlation coefficient for the given data.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Find the coefficient of correlation between X and Y.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q8b", + "label": "b)", + "text": "Find the regression line of y on x for the given data.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define discrete random variables. If X and Y are any two random variables, then show that E(X+Y)=E(X)+E(Y) provided E(X) and E(Y) exist.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q1b", + "label": "b)", + "text": "If X is a continuous random variable and Y=aX+b. Prove that E(Y)=aE(X)+b and V(Y)=a²V(X), where V stands for variance and a, b are constants.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "A sample of 4 items is selected at random from a box containing 12 items of which 5 are defective. Find the expected number E of defective items.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q2b", + "label": "b)", + "text": "Let f(X) be the probability density function of a continuous random variable X. Then explain Mean, Median, Mode, variance and mean deviation.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3", + "label": "", + "text": "The probability density f(X) of a continuous random variable is given by f(x)=Ce^(-|x|), -∞2).", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "If X is normally distributed with mean 2 and variance 0.1, then find P(|x-2|≥0.01).", + "unit": "Unit 2", + "type": "continuous-distributions" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain comparison between Correlation and Regression.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Fit a parabola for the given data.", + "unit": "Unit 5", + "type": "applied-statistics" + }, + { + "id": "q7b", + "label": "b)", + "text": "In a big city 325 men out of 600 men were found to be smokers. Does this information support the conclusion that the majority of men in this city are smokers.", + "unit": "Unit 5", + "type": "applied-statistics" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "The table below give the number of air craft accidents that occurred during the various days of the week. Test whether the accidents are uniformly distributed over the week.", + "unit": "Unit 6", + "type": "small-samples" + }, + { + "id": "q8b", + "label": "b)", + "text": "Show that the maximum value of rank Correlation coefficient is 1.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "If X is a continuous random variable and k is a constant. Then prove that Var(X+k)=Var(X) and Var(kX)=k²Var(X).", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q1b", + "label": "b)", + "text": "State and Prove Chebyshev's inequality.", + "unit": "Unit 1", + "type": "basic-probability" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "A random variable X is defined as the sum of the numbers on the faces when two dice are thrown. Find the mean of X.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q2b", + "label": "b)", + "text": "Explain Exponential and Gamma densities with properties.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3", + "label": "", + "text": "The probability density function of a random variable X is f(x)=sin(x)/2 for 0≤x≤π and 0 elsewhere. Find the mean, mode and median of a distribution and also find the probability between 0 and π/2.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Define Bivariate distribution and explain their properties.", + "unit": "Unit 3", + "type": "bivariate" + }, + { + "id": "q4b", + "label": "b)", + "text": "If first box contains 2 black, 3 red, 1 white balls; Second box contains 1 black, 1 red, 2 white balls; Third box contains 5 black, 3 red, 4 white balls. Of these a box is selected at random. From it a red ball is randomly drawn. If the ball is red, find the probability that it is from second box.", + "unit": "Unit 3", + "type": "bivariate" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "The values of μ₁, μ₂, μ₃ and μ₄ are 0, 9.2, 3.6 and 1.22 respectively. Find out the Skewness and Kurtosis of the distribution.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q5b", + "label": "b)", + "text": "The mean and standard deviation of a normal variable are 8 and 4 respectively. Find: P(5≤X≤10) and P(X≥5).", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Average number of accidents on any day on a national highway is 1.6. Determine the probability that the number of accidents are: i) at least one ii) at most one.", + "unit": "Unit 4", + "type": "basic-statistics" + }, + { + "id": "q6b", + "label": "b)", + "text": "Define correlation. Explain types of correlation and methods of studying correlation.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Fit a Straight line for the given data.", + "unit": "Unit 5", + "type": "applied-statistics" + }, + { + "id": "q7b", + "label": "b)", + "text": "A sample of 400 items is taken from a population whose standard deviation is 10. The mean of the sample is 40. Test whether the sample has come from a population with mean 38. Also calculate 95% confidence interval for the population.", + "unit": "Unit 5", + "type": "applied-statistics" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Define Chi-Square test of goodness of fit. Explain the conditions for Chi-Square test.", + "unit": "Unit 6", + "type": "small-samples" + }, + { + "id": "q8b", + "label": "b)", + "text": "Calculate coefficient of correlation from the given data.", + "unit": "Unit 4", + "type": "basic-statistics" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Determine (i) P(B/A) (ii) P(A/B^c) if A and B are events with P(A)=1/3, P(B)=1/4, P(A∪B)=1/2.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q1b", + "label": "b)", + "text": "A random variable X has the following probability function. Find i) K ii) Mean iii) Variance.", + "unit": "Unit 1", + "type": "basic-probability" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Define Moments. Explain types of moments.", + "unit": "Unit 1", + "type": "basic-probability" + }, + { + "id": "q2b", + "label": "b)", + "text": "Find the mean and standard deviation of a normal distribution in which 7% of items are under 35 and 89% are under 63.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "The density function of a random variable X is f(x)=e^(-x), x≥0. Find E(x), E(x²) and variance of X.", + "unit": "Unit 2", + "type": "continuous-distributions" + }, + { + "id": "q3b", + "label": "b)", + "text": "Define gamma distribution. Find the mean and Variance of gamma distribution.", + "unit": "Unit 2", + "type": "continuous-distributions" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Two factories produce identical clocks. The production of the first factory consists of 10,000 clocks of which 100 are defective. The second factory produces 20,000 clocks of which 300 are defective. What is the probability that a particular defective clock was produced in the first factory.", + "unit": "Unit 3", + "type": "bivariate" + }, + { + "id": "q4b", + "label": "b)", + "text": "Explain bivariate distributions and their properties.", + "unit": "Unit 3", + "type": "bivariate" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "If the variance of a Poisson variate is 3, then find P(x=0), P(0(1/2) find the minimum value of k. Determine the distribution function of x. Mean.", + "unit": "Unit 1", + "type": "basic-probability", + "isPredicted": true + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "The density function of a random variable X is f(x)=e^(-x) when x≥0. Find E(X), E(X²) and variance of X.", + "unit": "Unit 2", + "type": "continuous-distributions", + "isPredicted": true + }, + { + "id": "q2b", + "label": "b)", + "text": "Suppose a continuous random variable X has the probability density function f(x)=k(1-x²) for 0 Date: Tue, 14 Jul 2026 22:23:25 +0530 Subject: [PATCH 2/3] cs all subject papers added --- app/(public)/cgpa-calculator/page.tsx | 300 +++-- app/(public)/creators/page.tsx | 94 +- app/(public)/privacy/InteractivePath.tsx | 98 +- app/(public)/privacy/page.tsx | 22 +- app/api/heartbeat/route.ts | 12 + app/dashboard/page.tsx | 4 +- app/rgpv/page.tsx | 37 +- components/contact/ContactSection.tsx | 6 +- .../university/premium-animated-boy.tsx | 777 +++++++++++ .../university/university-flow-banner.tsx | 346 +++++ components/university/university-hero.tsx | 296 ++--- content/rgpv/cscy/semester-4/cy-402/pyqs.json | 740 ++++++++++- content/rgpv/cscy/semester-4/cy-405/pyqs.json | 728 +++++++++- content/rgpv/cse/semester-3/cs-302/pyqs.json | 1178 ++++++++++++++++- .../rgpv/cse/semester-3/cs-302/syllabus.json | 723 ++++++++-- content/rgpv/cse/semester-4/bt-401/pyqs.json | 1017 +++++++++++++- .../rgpv/cse/semester-4/bt-401/syllabus.json | 399 +++++- content/rgpv/cse/semester-4/cs-402/pyqs.json | 947 ++++++++++++- .../rgpv/cse/semester-4/cs-402/syllabus.json | 380 +++++- content/rgpv/cse/semester-4/cs-403/pyqs.json | 984 +++++++++++++- .../rgpv/cse/semester-4/cs-403/syllabus.json | 470 +++++-- content/rgpv/cse/semester-4/cs-404/pyqs.json | 970 +++++++++++++- .../rgpv/cse/semester-4/cs-404/syllabus.json | 431 +++++- content/rgpv/cse/semester-4/cs-405/pyqs.json | 928 ++++++++++++- .../rgpv/cse/semester-4/cs-405/syllabus.json | 275 +++- .../rgpv/csit/semester-3/csit-302/pyqs.json | 1002 +++++++------- .../csit/semester-3/csit-302/syllabus.json | 719 +++++++++- features/landing/ai-demo.tsx | 8 +- features/landing/faq.tsx | 67 +- 29 files changed, 12644 insertions(+), 1314 deletions(-) create mode 100644 app/api/heartbeat/route.ts create mode 100644 components/university/premium-animated-boy.tsx create mode 100644 components/university/university-flow-banner.tsx diff --git a/app/(public)/cgpa-calculator/page.tsx b/app/(public)/cgpa-calculator/page.tsx index 0c3385d..3c9c8c6 100644 --- a/app/(public)/cgpa-calculator/page.tsx +++ b/app/(public)/cgpa-calculator/page.tsx @@ -17,6 +17,7 @@ import { Star, Briefcase, ShieldCheck, + LucideIcon, } from "lucide-react"; export default function CgpaCalculatorPage() { @@ -29,7 +30,7 @@ export default function CgpaCalculatorPage() { const [progressValue, setProgressValue] = useState(0); // Radar State - const [radarTier, setRadarTier] = useState("tier1"); + const [radarTier, setRadarTier] = useState(null); const calculateRequiredSgpa = React.useCallback(() => { setError(null); @@ -69,7 +70,7 @@ export default function CgpaCalculatorPage() { }, [calculateRequiredSgpa]); return ( -
+
{/* Ultra-Premium Dynamic Ambient Background */}
{/* Orb 1: Top Left Blue */} @@ -103,14 +104,14 @@ export default function CgpaCalculatorPage() {
-
+
{/* Header Section */} -
+
Academic Planning @@ -119,7 +120,7 @@ export default function CgpaCalculatorPage() { initial={{ opacity: 0, y: 20 }} animate={{ opacity: 1, y: 0 }} transition={{ duration: 0.5, delay: 0.1 }} - className="text-[40px] md:text-[56px] font-extrabold tracking-tight text-slate-900 dark:text-white mb-6 leading-[1.1]" + className="text-[32px] md:text-[42px] font-extrabold tracking-tight text-slate-900 dark:text-white mb-3 leading-[1.1]" > Target CGPA{" "} @@ -130,7 +131,7 @@ export default function CgpaCalculatorPage() { initial={{ opacity: 0, y: 20 }} animate={{ opacity: 1, y: 0 }} transition={{ duration: 0.5, delay: 0.2 }} - className="text-slate-600 dark:text-slate-400 text-lg md:text-xl font-medium max-w-xl mx-auto" + className="text-slate-600 dark:text-slate-400 text-sm md:text-base font-medium max-w-xl mx-auto" > Find out exactly how much SGPA you need to score in your remaining semesters to reach your graduation goal. @@ -138,14 +139,14 @@ export default function CgpaCalculatorPage() {
{/* Calculator Grid */} -
+
{/* Input Section */} -
+
{/* Total Semesters */}
@@ -185,7 +186,7 @@ export default function CgpaCalculatorPage() { max="12" value={currentSemester} onChange={(e) => setCurrentSemester(Number(e.target.value))} - className="w-full pl-14 pr-4 py-3 sm:py-4 rounded-xl border-2 border-slate-100 dark:border-white/5 bg-white dark:bg-white/[0.03] text-slate-900 dark:text-white font-black text-lg sm:text-xl focus:bg-white dark:focus:bg-black/40 focus:border-blue-500 dark:focus:border-blue-500 focus:ring-4 focus:ring-blue-500/20 outline-none transition-all shadow-sm hover:shadow-md" + className="w-full pl-12 pr-4 py-3 rounded-xl border-2 border-slate-100 dark:border-transparent bg-white dark:bg-slate-950/50 text-slate-900 dark:text-white font-black text-lg dark:ring-1 dark:ring-inset dark:ring-white/[0.06] focus:bg-white dark:focus:bg-slate-900/80 focus:border-blue-500 dark:focus:border-transparent focus:ring-4 focus:ring-blue-500/20 dark:focus:ring-blue-500/40 outline-none transition-all shadow-sm hover:shadow-md" />
@@ -209,7 +210,7 @@ export default function CgpaCalculatorPage() { placeholder="0.00" value={currentCgpa} onChange={(e) => setCurrentCgpa(e.target.value)} - className="w-full pl-14 pr-4 py-3 sm:py-4 rounded-xl border-2 border-slate-100 dark:border-white/5 bg-white dark:bg-white/[0.03] text-slate-900 dark:text-white font-black text-lg sm:text-xl focus:bg-white dark:focus:bg-black/40 focus:border-blue-500 dark:focus:border-blue-500 focus:ring-4 focus:ring-blue-500/20 outline-none transition-all shadow-sm hover:shadow-md placeholder:font-medium placeholder:text-slate-300 dark:placeholder:text-slate-600" + className="w-full pl-12 pr-4 py-3 rounded-xl border-2 border-slate-100 dark:border-transparent bg-white dark:bg-slate-950/50 text-slate-900 dark:text-white font-black text-lg dark:ring-1 dark:ring-inset dark:ring-white/[0.06] focus:bg-white dark:focus:bg-slate-900/80 focus:border-blue-500 dark:focus:border-transparent focus:ring-4 focus:ring-blue-500/20 dark:focus:ring-blue-500/40 outline-none transition-all shadow-sm hover:shadow-md placeholder:font-medium placeholder:text-slate-300 dark:placeholder:text-slate-600" />
@@ -233,13 +234,13 @@ export default function CgpaCalculatorPage() { placeholder="0.00" value={targetCgpa} onChange={(e) => setTargetCgpa(e.target.value)} - className="w-full pl-14 pr-4 py-3 sm:py-4 rounded-xl border-2 border-slate-100 dark:border-white/5 bg-white dark:bg-white/[0.03] text-slate-900 dark:text-white font-black text-lg sm:text-xl focus:bg-white dark:focus:bg-black/40 focus:border-blue-500 dark:focus:border-blue-500 focus:ring-4 focus:ring-blue-500/20 outline-none transition-all shadow-sm hover:shadow-md placeholder:font-medium placeholder:text-slate-300 dark:placeholder:text-slate-600" + className="w-full pl-12 pr-4 py-3 rounded-xl border-2 border-slate-100 dark:border-transparent bg-white dark:bg-slate-950/50 text-slate-900 dark:text-white font-black text-lg dark:ring-1 dark:ring-inset dark:ring-white/[0.06] focus:bg-white dark:focus:bg-slate-900/80 focus:border-blue-500 dark:focus:border-transparent focus:ring-4 focus:ring-blue-500/20 dark:focus:ring-blue-500/40 outline-none transition-all shadow-sm hover:shadow-md placeholder:font-medium placeholder:text-slate-300 dark:placeholder:text-slate-600" />
-
+
@@ -257,11 +258,11 @@ export default function CgpaCalculatorPage() { initial={{ opacity: 0, x: 20 }} animate={{ opacity: 1, x: 0 }} transition={{ duration: 0.5, delay: 0.4 }} - className="lg:col-span-2 flex flex-col relative" + className="lg:col-span-2 flex flex-col relative lg:h-full" > {/* Absolute Glow behind the card */} -
-
+
+
{!currentCgpa || !targetCgpa ? (
) : result <= 0 ? ( -
-
- +
+
+
+
+ +
-

- Goal Surpassed -

-
+
+

+ Goal Surpassed +

+
+
0.00
-

+

Your current performance is so strong that you will achieve your target even if you score a{" "} - + 0.00 SGPA {" "} in your remaining semesters!

) : result <= parseFloat(currentCgpa) ? ( -
-
- +
+
+
+
+ +
-

- Target Secured -

-
+
+

+ Target Secured +

+
+
{result.toFixed(2)}
-

+

You are currently pacing ahead of your goal! Simply maintain this baseline SGPA across your final{" "} - + {totalSemesters - currentSemester} {" "} semesters to secure your target. @@ -393,15 +404,15 @@ export default function CgpaCalculatorPage() {

) : (
-
- -

+
+ +

Required Average SGPA

-
+
{result.toFixed(2)}
{result > parseFloat(currentCgpa) && ( @@ -503,7 +514,7 @@ export default function CgpaCalculatorPage() {
{/* Placement Eligibility Radar */} -
+
@@ -543,18 +554,20 @@ export default function CgpaCalculatorPage() { ].map((tier) => (
{(() => { + if (!radarTier) { + return ( +
+

+ Select a career path above to unlock tailored insights + and view your eligibility status. +

+
+ ); + } + const cutoffs: Record = { tier1: 8.0, core: 7.5, @@ -585,10 +609,10 @@ export default function CgpaCalculatorPage() { if (!currentCgpa || isNaN(current)) { return ( -
+

Enter your current CGPA above to see your eligibility - status. + status for this path.

); @@ -653,51 +677,149 @@ export default function CgpaCalculatorPage() {
{/* Pro-Tips for Boosting SGPA */} -
+
-

- Pro-Tips for Higher SGPA +

+ {radarTier + ? "Premium Career Insights" + : "Pro-Tips for Higher SGPA"}

-
- {[ - { - title: "Master High-Credit Subjects", - desc: "Subjects with 4 or 5 credits impact your SGPA exponentially more than 1-credit labs.", - icon: BarChart, - }, - { - title: "Analyze Previous Year Questions", - desc: "Professors frequently repeat patterns. Mastering PYQs is the fastest way to score marks.", - icon: History, - }, - { - title: "Utilize the Hyper AI Tutor", - desc: "Stuck on a concept? Use our AI tutor to instantly get syllabus-mapped explanations.", - icon: BookOpen, - }, - ].map((tip, idx) => ( -
-
- -
-
-

- {tip.title} -

-

- {tip.desc} -

-
-
- ))} +
+ {(() => { + const defaultTips = [ + { + title: "Master High-Credit Subjects", + desc: "Subjects with 4 or 5 credits impact your SGPA exponentially more than 1-credit labs.", + icon: BarChart, + }, + { + title: "Analyze Previous Year Questions", + desc: "Professors frequently repeat patterns. Mastering PYQs is the fastest way to score marks.", + icon: History, + }, + { + title: "Utilize the Hyper AI Tutor", + desc: "Stuck on a concept? Use our AI tutor to instantly get syllabus-mapped explanations.", + icon: BookOpen, + }, + ]; + + const tierTips: Record< + string, + { title: string; desc: string; icon: LucideIcon }[] + > = { + tier1: [ + { + title: "Advanced DSA & Problem Solving", + desc: "Top product companies test heavily on data structures. Master Leetcode Medium/Hard and participate in contests.", + icon: BookOpen, + }, + { + title: "Impactful Open Source Contributions", + desc: "Build a strong GitHub profile. Contributing to real-world open source projects sets you apart from the crowd.", + icon: Star, + }, + { + title: "System Design Fundamentals", + desc: "Learn how large-scale systems work. Understanding scalability and databases is crucial for top-tier roles.", + icon: Lightbulb, + }, + ], + core: [ + { + title: "GATE & ESE Preparation", + desc: "Start preparing for competitive exams early. A high GATE score opens doors to top PSUs and core companies.", + icon: Target, + }, + { + title: "Core Subject Mastery", + desc: "Focus intensely on fundamental subjects like Thermodynamics, Fluid Mechanics, or Power Systems.", + icon: BookOpen, + }, + { + title: "Industrial Internships", + desc: "Practical experience is vital. Secure internships at manufacturing plants or core research labs.", + icon: Briefcase, + }, + ], + tier2: [ + { + title: "Full Stack Development", + desc: "Build end-to-end projects. Frameworks like React, Node.js, and Spring Boot are highly sought after.", + icon: Lightbulb, + }, + { + title: "Aptitude & Soft Skills", + desc: "Many companies have rigorous aptitude rounds. Regular practice of quantitative and logical reasoning is essential.", + icon: Target, + }, + { + title: "Hackathon Participation", + desc: "Winning or participating in hackathons demonstrates your ability to build under pressure.", + icon: Star, + }, + ], + mass: [ + { + title: "Quantitative Aptitude", + desc: "The first elimination round is almost always an aptitude test. Practice quantitative reasoning daily.", + icon: Calculator, + }, + { + title: "Basic Coding & CS Fundamentals", + desc: "Ensure you are very comfortable with OOPS, DBMS, and basic coding in at least one language (Java/C++).", + icon: BookOpen, + }, + { + title: "Communication & Interview Skills", + desc: "Strong verbal and written English can significantly improve your chances during HR and technical interviews.", + icon: Info, + }, + ], + }; + + const activeTips = + radarTier && tierTips[radarTier] + ? tierTips[radarTier] + : defaultTips; + + return ( + + + {activeTips.map((tip, idx) => ( +
+
+ +
+
+

+ {tip.title} +

+

+ {tip.desc} +

+
+
+ ))} + + + ); + })()}
diff --git a/app/(public)/creators/page.tsx b/app/(public)/creators/page.tsx index bdb09e9..30c7eda 100644 --- a/app/(public)/creators/page.tsx +++ b/app/(public)/creators/page.tsx @@ -3,14 +3,7 @@ import Link from "next/link"; import Image from "next/image"; import { motion, Variants } from "framer-motion"; -import { - Globe, - Mail, - Users, - Code2, - Palette, - GraduationCap, -} from "lucide-react"; +import { Globe, Mail, Code2, Palette, GraduationCap } from "lucide-react"; import { FaGithub, FaLinkedin, FaTwitter, FaInstagram } from "react-icons/fa"; const teamMembers = [ @@ -91,33 +84,37 @@ export default function TeamPage() { return (
{/* Hero */} -
+
+ {/* Subtle Ambient Glows */}
-
-
+
+
-
+
- - + + + + + Meet the Team -

+

The People Behind
- + Hyper Learning

-

+

A small team of dedicated individuals working together to make engineering education more accessible and effective through AI-powered learning. @@ -141,20 +138,20 @@ export default function TeamPage() { {/* Subtle top edge highlight */} -

+
{/* Top-Right Surface Glow Orb */} -
+
{/* Top-Right animated gradient background glow */} -
+
{/* Premium Badge */} {member.badge && ( -
+
@@ -163,8 +160,8 @@ export default function TeamPage() { )} {/* Avatar */} -
-
+
+
{member.name} -

+

{member.name}

-

+

{member.role}

-

+

{member.bio}

@@ -193,7 +190,7 @@ export default function TeamPage() { href={member.socials.github} target="_blank" rel="noopener noreferrer" - className="rounded-lg p-2 text-muted-foreground transition-all duration-300 ease-out hover:-translate-y-[3px] hover:bg-white/10 hover:text-white hover:shadow-md hover:shadow-white/5" + className="rounded-lg p-2 text-muted-foreground transition-all duration-300 ease-out hover:-translate-y-[3px] hover:bg-slate-100 dark:hover:bg-white/10 hover:text-slate-900 dark:hover:text-white hover:shadow-md hover:shadow-slate-200 dark:hover:shadow-white/5" aria-label="GitHub" > @@ -217,7 +214,7 @@ export default function TeamPage() { href={member.socials.twitter} target="_blank" rel="noopener noreferrer" - className="rounded-lg p-2 text-muted-foreground transition-all duration-300 ease-out hover:-translate-y-[3px] hover:bg-white/10 hover:text-white hover:shadow-md hover:shadow-white/5" + className="rounded-lg p-2 text-muted-foreground transition-all duration-300 ease-out hover:-translate-y-[3px] hover:bg-slate-100 dark:hover:bg-white/10 hover:text-slate-900 dark:hover:text-white hover:shadow-md hover:shadow-slate-200 dark:hover:shadow-white/5" aria-label="X (Twitter)" > @@ -270,31 +267,42 @@ export default function TeamPage() { whileInView={{ opacity: 1, y: 0 }} transition={{ duration: 0.5, delay: 0.1 }} viewport={{ once: true }} - className="mx-auto mt-16 max-w-3xl rounded-[24px] border border-border bg-card/40 p-8 text-center backdrop-blur-sm md:p-12" + className="relative mx-auto mt-20 lg:mt-24 max-w-4xl text-center" > -

- Want to Join the Team? + {/* Elegant glowing orb behind text */} +
+ +

+ + Want to Join the Team? +

-

- Hyper Learning is open-source and community-driven. Contributions - are always welcome! +

+ Hyper Learning is open-source and community-driven. +
+ Contributions are always welcome!

-
+
-
- - View on GitHub + diff --git a/app/(public)/privacy/InteractivePath.tsx b/app/(public)/privacy/InteractivePath.tsx index 3228ce5..05eeef4 100644 --- a/app/(public)/privacy/InteractivePath.tsx +++ b/app/(public)/privacy/InteractivePath.tsx @@ -13,6 +13,7 @@ export function InteractivePath() { const pathRef = useRef(null); const desktopTrackerRef = useRef(null); const mobileTrackerRef = useRef(null); + const jumpBackEndTimeRef = useRef(0); const [hasJumped, setHasJumped] = useState(false); const [jumpOffset, setJumpOffset] = useState({ x: 0, y: 0 }); @@ -54,9 +55,13 @@ export function InteractivePath() { }; useMotionValueEvent(smoothProgress, "change", (val) => { - // Lock the tracker position at exactly 1.0 when we exceed 0.99. - // This stops the anchor from moving further down, guaranteeing perfect jump calculation accuracy. - const effectiveVal = val > 0.99 ? 1 : val; + // Clamp value between 0 and 1 to prevent spring overshoot from breaking getPointAtLength coordinates + const clampedVal = Math.max(0, Math.min(1, val)); + + // Lock the tracker position at exactly 1.0 when we exceed 0.99 OR if the reverse jump animation is currently playing (850ms). + // This stops the anchor from moving up the path while the man is mid-air jumping backward, guaranteeing he lands exactly where he jumped from. + const isMidAirReverse = Date.now() < jumpBackEndTimeRef.current; + const effectiveVal = clampedVal > 0.99 || isMidAirReverse ? 1 : clampedVal; // Desktop tracker if (pathRef.current && desktopTrackerRef.current) { @@ -75,29 +80,29 @@ export function InteractivePath() { } // NOW that the DOM is locked in position, check for the jump. - if (val > 0.99 && !hasJumped) { + if (clampedVal > 0.99 && !hasJumped) { triggerJump(); - } else if (val < 0.98 && hasJumped) { + } else if (clampedVal < 0.97 && hasJumped) { setHasJumped(false); + jumpBackEndTimeRef.current = Date.now() + 850; // Lock the anchor for the 0.85s reverse animation time } }); // Parabolic Jump Physics: const jumpStyleX = { transform: hasJumped ? `translateX(${jumpOffset.x}px)` : "translateX(0px)", - transition: "transform 0.65s linear", // always animate X + transition: "transform 1.05s linear", // always animate X }; const jumpStyleY = { transform: hasJumped - ? `translateY(${jumpOffset.y}px) scale(0.2)` + ? `translateY(${jumpOffset.y}px) scale(0.5)` : "translateY(0px) scale(1)", - opacity: hasJumped ? 0 : 1, // Jump IN: cubic-bezier with negative parameter (pulls UP before releasing DOWN). // Jump OUT (reverse): cubic-bezier with >1 parameter (overshoots UP before settling back to 0). transition: hasJumped - ? "transform 0.65s cubic-bezier(0.35, -0.4, 0.75, 1), opacity 0.6s ease-in" - : "transform 0.65s cubic-bezier(0.25, 1.4, 0.65, 1), opacity 0.6s ease-out", + ? "transform 1.05s cubic-bezier(0.35, -0.6, 0.75, 1)" + : "transform 0.85s cubic-bezier(0.25, 1.4, 0.65, 1)", }; return ( @@ -125,7 +130,7 @@ export function InteractivePath() { style={jumpStyleY} className="w-full h-full flex items-center justify-center" > - +
@@ -188,7 +193,7 @@ export function InteractivePath() { style={jumpStyleY} className="w-full h-full flex items-center justify-center" > - +

@@ -206,14 +211,77 @@ export function InteractivePath() { ); } -function RunningManIcon() { +function RunningManIcon({ hasJumped }: { hasJumped: boolean }) { + // Generate 8 particles for the sprinkle explosion + const particles = Array.from({ length: 8 }).map((_, i) => { + const angle = (i * 45 * Math.PI) / 180; + const radius = 45; + return { + x: Math.cos(angle) * radius, + y: Math.sin(angle) * radius, + }; + }); + return (
+ {/* Sprinkle Explosion */} + {particles.map((p, i) => ( + + ))} + + {/* Stone in Water Ripple Effect */} + {[0, 1, 2].map((i) => ( + + ))} +
-
+
- {/* Custom Animation for the Traveling Map Path & Pendulum */} - + {/* Custom Animation for the Traveling Map Path */} {/* Central Timeline Layout */} -
+
{/* Unified Desktop & Mobile Scroll-Linked Path with Tracker */} @@ -110,10 +98,10 @@ export default function PrivacyPolicyPage() {
- {/* Floating Premium CTA (Hanging Pendulum) */} -
+ {/* Floating Premium CTA */} +
{/* Connector linking timeline path to CTA */} -
+
{/* End Node */}
diff --git a/app/api/heartbeat/route.ts b/app/api/heartbeat/route.ts new file mode 100644 index 0000000..b844615 --- /dev/null +++ b/app/api/heartbeat/route.ts @@ -0,0 +1,12 @@ +import { NextResponse } from "next/server"; + +export async function POST() { + // This is a dummy endpoint to intercept and silence heartbeat POST requests + // that are likely coming from an external extension, plugin, or tunnel proxy. + // It returns a 200 OK so the dev server stops spamming 404 errors in the console. + return NextResponse.json({ status: "alive" }, { status: 200 }); +} + +export async function GET() { + return NextResponse.json({ status: "alive" }, { status: 200 }); +} diff --git a/app/dashboard/page.tsx b/app/dashboard/page.tsx index 9f2480c..5d99d50 100644 --- a/app/dashboard/page.tsx +++ b/app/dashboard/page.tsx @@ -36,7 +36,7 @@ export default function DashboardPage() {

- Welcome Back, Alex{" "} + Welcome Back, ABHAY{" "} 👋

@@ -93,7 +93,7 @@ export default function DashboardPage() {

- Continue Learning + Start your journey

- {/* Hero Section */} - +
+ {/* Ultra-Premium Ambient Global Background (Light Mode) */} +
+ {/* Intricate 3-Color Mesh Gradient (Hardware Accelerated) */} +
+
+
- {/* Branch Selection */} - + {/* Pure white glow in the center-top to maintain high contrast for the main content */} +
- {/* Academic Navigation */} - + {/* Premium Noise/Grain Texture Overlay (Apple-style) */} +
+
+ + {/* Page Content */} +
+ {/* Hero Section */} + + + {/* Branch Selection */} + + + {/* Academic Navigation */} + +
); } diff --git a/components/contact/ContactSection.tsx b/components/contact/ContactSection.tsx index 1131053..a1d9dfa 100644 --- a/components/contact/ContactSection.tsx +++ b/components/contact/ContactSection.tsx @@ -56,9 +56,11 @@ export default function ContactSection() {

- We're here to + + Hyper Learning is here to +
- help you. + help you today.

diff --git a/components/university/premium-animated-boy.tsx b/components/university/premium-animated-boy.tsx new file mode 100644 index 0000000..199ea23 --- /dev/null +++ b/components/university/premium-animated-boy.tsx @@ -0,0 +1,777 @@ +import React, { useState, useEffect } from "react"; +import { motion } from "framer-motion"; + +export const PremiumAnimatedBoy = ({ + isJumping = false, + isHappy = false, + isIdle = false, + jumpType = "standing", +}: { + isJumping?: boolean; + isHappy?: boolean; + isIdle?: boolean; + jumpType?: "standing" | "running"; +}) => { + const [stride, setStride] = useState(0); + + // eslint-disable-next-line @typescript-eslint/no-explicit-any + const t: any = { + duration: isJumping && jumpType === "running" ? 0.6 : 0.45, + ease: + isJumping && jumpType === "running" ? "easeInOut" : [0.25, 1, 0.35, 1], + }; + const ht = { + repeat: Infinity, + duration: 0.4, + repeatType: "reverse" as const, + ease: "easeInOut" as const, + }; + + // eslint-disable-next-line @typescript-eslint/no-explicit-any + const sideToFrontVars = (sideVal: number, frontVal: number): any => ({ + run_a: { x: sideVal, transition: t }, + run_b: { x: sideVal, transition: t }, + standing_jump: { x: sideVal, transition: t }, + running_jump: { x: sideVal, transition: t }, + idle: { x: sideVal, transition: { duration: 0.3 } }, + happy: { x: frontVal, transition: { duration: 0.4, ease: "easeOut" } }, + }); + + useEffect(() => { + if (isJumping || isHappy || isIdle) return; + const interval = setInterval(() => { + setStride((s) => s + 1); + }, 450); + return () => clearInterval(interval); + }, [isJumping, isHappy, isIdle]); + + const isStrideB = stride % 2 === 1; + const currentVariant = isJumping + ? jumpType === "running" + ? "running_jump" + : "standing_jump" + : isHappy + ? "happy" + : isIdle + ? "idle" + : isStrideB + ? "run_b" + : "run_a"; + + // ========================================== + // FORWARD KINEMATICS ENGINE + // ========================================== + // Calculates the (x,y) of the knee/elbow and ankle/hand + const getFK = (a1: number, a2: number, L1: number, L2: number) => { + const r1 = (a1 * Math.PI) / 180; + const x1 = -L1 * Math.sin(r1); + const y1 = L1 * Math.cos(r1); + const r2 = ((a1 + a2) * Math.PI) / 180; + const x2 = x1 - L2 * Math.sin(r2); + const y2 = y1 + L2 * Math.cos(r2); + return { x1, y1, x2, y2 }; + }; + + const getLimbPath = ( + a1s: number[], + a2s: number[], + L1: number, + L2: number + ) => { + return a1s.map((a1, i) => { + const { x1, y1, x2, y2 } = getFK(a1, a2s[i], L1, L2); + return `M 0,0 L ${x1.toFixed(2)},${y1.toFixed(2)} L ${x2.toFixed(2)},${y2.toFixed(2)}`; + }); + }; + + const getEndObj = (a1s: number[], a2s: number[], L1: number, L2: number) => ({ + x: a1s.map((a1, i) => getFK(a1, a2s[i], L1, L2).x2), + y: a1s.map((a1, i) => getFK(a1, a2s[i], L1, L2).y2), + }); + + const buildLimbVars = ( + h_ra: number[], + k_ra: number[], + h_rb: number[], + k_rb: number[], + h_j: number[], + k_j: number[], + h_rj: number[], + k_rj: number[], + h_h: number[], + k_h: number[], + L1: number, + L2: number + // eslint-disable-next-line @typescript-eslint/no-explicit-any + ): any => ({ + run_a: { d: getLimbPath(h_ra, k_ra, L1, L2), transition: t }, + run_b: { d: getLimbPath(h_rb, k_rb, L1, L2), transition: t }, + standing_jump: { d: getLimbPath(h_j, k_j, L1, L2), transition: t }, + running_jump: { d: getLimbPath(h_rj, k_rj, L1, L2), transition: t }, + idle: { + d: getLimbPath([0], [0], L1, L2)[0], + transition: { duration: 0.3 }, + }, + happy: { + d: getLimbPath([h_h[0]], [k_h[0]], L1, L2)[0], + transition: { duration: 0.3 }, + }, + }); + + const buildEndVars = ( + h_ra: number[], + k_ra: number[], + a_ra: number[] | null, + h_rb: number[], + k_rb: number[], + a_rb: number[] | null, + h_j: number[], + k_j: number[], + a_j: number[] | null, + h_rj: number[], + k_rj: number[], + a_rj: number[] | null, + h_h: number[], + k_h: number[], + a_h: number[] | null, + L1: number, + L2: number + // eslint-disable-next-line @typescript-eslint/no-explicit-any + ): any => ({ + run_a: { + ...getEndObj(h_ra, k_ra, L1, L2), + rotate: h_ra.map((h, i) => h + k_ra[i] + (a_ra?.[i] || 0)), + transition: t, + }, + run_b: { + ...getEndObj(h_rb, k_rb, L1, L2), + rotate: h_rb.map((h, i) => h + k_rb[i] + (a_rb?.[i] || 0)), + transition: t, + }, + standing_jump: { + ...getEndObj(h_j, k_j, L1, L2), + rotate: h_j.map((h, i) => h + k_j[i] + (a_j?.[i] || 0)), + transition: t, + }, + running_jump: { + ...getEndObj(h_rj, k_rj, L1, L2), + rotate: h_rj.map((h, i) => h + k_rj[i] + (a_rj?.[i] || 0)), + transition: t, + }, + idle: { + x: getEndObj([0], [0], L1, L2).x[0], + y: getEndObj([0], [0], L1, L2).y[0], + rotate: 0, + transition: { duration: 0.3 }, + }, + happy: { + x: getEndObj([h_h[0]], [k_h[0]], L1, L2).x[0], + y: getEndObj([h_h[0]], [k_h[0]], L1, L2).y[0], + rotate: h_h[0] + k_h[0] + (a_h?.[0] || 0), + transition: { duration: 0.3 }, + }, + }); + + // ========================================== + // KINEMATICS DATA + // ========================================== + const L_THIGH = 23; + const L_CALF = 19; + const L_UPARM = 12; + const L_FOREARM = 12; + + // ==== FRONT LEG ==== + const fl_h_ra = [0, -15, -40, -30, -15]; + const fl_k_ra = [0, 20, 0, 15, 30]; + const fl_a_ra = [0, 30, -15, -25, -10]; + const fl_h_rb = [0, 15, 30, 15, 0]; + const fl_k_rb = [0, 40, 110, 60, 30]; + const fl_a_rb = [0, 15, -5, -10, 5]; + const fl_h_j = [0, -30, 10, -15, -25]; + const fl_k_j = [0, 60, 10, 30, 50]; + const fl_a_j = [0, 0, 10, 5, 0]; + const fl_h_rj = [0, -30, -50, -30, -10]; + const fl_k_rj = [0, 10, 5, 10, 20]; + const fl_a_rj = [0, -10, -20, -10, 0]; + const fl_h_h = [-5, -6]; + const fl_k_h = [5, 6]; + const fl_a_h = [0, 0]; + + // ==== BACK LEG ==== + const bl_h_ra = [0, 15, 30, 15, 0]; + const bl_k_ra = [0, 40, 110, 60, 30]; + const bl_a_ra = [0, 15, -10, 5, 0]; + const bl_h_rb = [0, -15, -40, -30, -15]; + const bl_k_rb = [0, 20, 0, 15, 30]; + const bl_a_rb = [0, 25, -20, -5, 0]; + const bl_h_j = [0, -30, 10, -15, -25]; + const bl_k_j = [0, 60, 10, 30, 50]; + const bl_a_j = [0, 15, -5, 5, 10]; + const bl_h_rj = [0, 20, 45, 20, 10]; + const bl_k_rj = [0, 40, 80, 40, 20]; + const bl_a_rj = [0, 15, 5, 15, 0]; + const bl_h_h = [5, 6]; + const bl_k_h = [5, 6]; + const bl_a_h = [0, 0]; + + // ==== FRONT ARM ==== + const fa_s_ra = [0, 50, 80, 50, -10]; + const fa_e_ra = [0, -60, -100, -70, -40]; + const fa_s_rb = [0, -50, -80, -50, 10]; + const fa_e_rb = [0, -60, -90, -60, -40]; + const fa_s_j = [0, 45, -60, -28, 10]; + const fa_e_j = [0, -20, -90, -60, -40]; + const fa_s_rj = [0, 30, 55, 30, 10]; + const fa_e_rj = [0, -40, -80, -40, -20]; + const fa_s_h = [-140, -142]; + const fa_e_h = [0, -2]; + + // ==== BACK ARM ==== + const ba_s_ra = [0, -40, -70, -40, 10]; + const ba_e_ra = [0, 30, 70, 30, 0]; + const ba_s_rb = [0, 40, 70, 40, -10]; + const ba_e_rb = [0, -30, -60, -30, -15]; + const ba_s_j = [0, 45, -60, -28, 10]; + const ba_e_j = [0, 45, -90, -20, 10]; + const ba_s_rj = [0, -30, -55, -30, -10]; + const ba_e_rj = [0, 20, 50, 20, 0]; + const ba_s_h = [140, 142]; + const ba_e_h = [0, 2]; + + const renderShoe = (isHappyFront = false) => { + if (isHappyFront) { + return ( + + + + + + ); + } + return ( + + + + + + ); + }; + + return ( + + + + + + + + + + + + + + + + + + + + + + + + {/* ======== BACK ARM ======== */} + + + + + + + + + + {/* ======== BACK LEG ======== */} + + + + + {renderShoe(isHappy)} + + + + + {/* ======== BACKPACK ======== */} + + + + + + + + + + + + + {/* Static belly strap */} + + + + + + + + + {/* Drawstrings on waistband */} + + + + + + + + + + + + {/* Hair - Pulled up to Y=-23 to reveal the peach forehead! */} + + + + + + + {/* Hair Highlight (Shine) */} + + + {/* Blush - Static so it stays perfectly on his cheeks! */} + + + + {/* Face Details - Reduced shift to 3 to prevent spilling off the chin */} + + {!isHappy && ( + + + + {/* Catchlights (Premium Eye Shines) */} + + + + )} + {isHappy && ( + + + + + )} + + + {/* Centered mouth so it doesn't float off the cheek when shifted! */} + {!isHappy && ( + + )} + {isHappy && ( + + )} + + {/* Animated Golden Stars when Happy! */} + {isHappy && ( + + {/* Main 5-Point Star */} + + {/* Small Diamond Sparkle */} + + + )} + + + + + {/* ======== FRONT LEG ======== */} + + + + + {renderShoe(isHappy)} + + + + + {/* ======== FRONT ARM ======== */} + + + + + + + + + + + ); +}; diff --git a/components/university/university-flow-banner.tsx b/components/university/university-flow-banner.tsx new file mode 100644 index 0000000..0c51d56 --- /dev/null +++ b/components/university/university-flow-banner.tsx @@ -0,0 +1,346 @@ +"use client"; + +import { motion, AnimatePresence } from "framer-motion"; +import React, { useState, useEffect, useRef } from "react"; + +import { PremiumAnimatedBoy } from "./premium-animated-boy"; + +export default function UniversityFlowBanner() { + const steps = [ + "Branch", + "Semester", + "Subject", + "Syllabus", + "PYQs", + "Hyper AI", + ]; + + const [activeStep, setActiveStep] = useState(0); + const [jumpGap, setJumpGap] = useState(null); + const [targetX, setTargetX] = useState(0); + const containerRef = useRef(null); + const scrollContainerRef = useRef(null); + const jumpTimeoutRef = useRef(null); + + useEffect(() => { + return () => { + if (jumpTimeoutRef.current) clearTimeout(jumpTimeoutRef.current); + }; + }, []); + + useEffect(() => { + const updatePosition = () => { + if (containerRef.current) { + const nodes = + containerRef.current.querySelectorAll(".node-center-point"); + if (nodes[activeStep]) { + const node = nodes[activeStep] as HTMLElement; + const containerRect = containerRef.current.getBoundingClientRect(); + const nodeRect = node.getBoundingClientRect(); + const x = nodeRect.left - containerRect.left + nodeRect.width / 2; + setTargetX(x); + + if (scrollContainerRef.current) { + const scrollContainer = scrollContainerRef.current; + const scrollLeft = + node.offsetLeft - + scrollContainer.clientWidth / 2 + + node.clientWidth / 2; + scrollContainer.scrollTo({ left: scrollLeft, behavior: "smooth" }); + } + } + } + }; + + let resizeTimeout: NodeJS.Timeout; + const handleResize = () => { + clearTimeout(resizeTimeout); + resizeTimeout = setTimeout(updatePosition, 100); + }; + + // Need a small timeout to ensure DOM layout is complete before measuring + const t = setTimeout(updatePosition, 50); + window.addEventListener("resize", handleResize); + return () => { + clearTimeout(t); + clearTimeout(resizeTimeout); + window.removeEventListener("resize", handleResize); + }; + }, [activeStep]); + + useEffect(() => { + let timeoutId: NodeJS.Timeout; + + if (activeStep >= steps.length - 1) { + // We reached the end. Do nothing, stay on the last node forever. + return; + } else { + // First node: 1.5s to build anticipation for standing jump + // Second node: 1s brief pause after landing first jump + // Remaining nodes: 700ms for continuous running — must be > 500ms so bounce resets + const delay = activeStep === 0 ? 1500 : activeStep === 1 ? 1000 : 700; + + timeoutId = setTimeout(() => { + // 1. Trigger the jump trail arc and boy's leap animation + setJumpGap(activeStep); + jumpTimeoutRef.current = setTimeout( + () => setJumpGap(null), + activeStep === 0 ? 500 : 600 + ); + + // 2. Actually move to the next node + setActiveStep(activeStep + 1); + }, delay); + } + + return () => clearTimeout(timeoutId); + }, [activeStep, steps.length]); + + const isJumping = jumpGap !== null; + + return ( +

+
+
+ {/* Inner container that enforces min-width so nodes don't get squished */} +
+ {/* Premium Braided Rope / Cable (Background Track) */} +
+ {/* Animated Blue Rope Fill */} + +
+ + + {/* SINGLE GLOBAL BOY TO PREVENT GHOSTING */} + {targetX > 0 && ( + + + + + {activeStep === steps.length - 1 && !isJumping && ( + <> + {/* Minimal Radial Burst */} + {[ + { + x: 35, + y: -35, + r: 45, + color: "#3b82f6", + size: 3, + delay: 0, + }, + { + x: 50, + y: -10, + r: 75, + color: "#10b981", + size: 2.5, + delay: 0.05, + }, + { + x: 35, + y: 25, + r: 125, + color: "#06b6d4", + size: 3, + delay: 0.1, + }, + { + x: -35, + y: 25, + r: 235, + color: "#ec4899", + size: 2.5, + delay: 0.02, + }, + { + x: -50, + y: -10, + r: 285, + color: "#f59e0b", + size: 3, + delay: 0.08, + }, + { + x: -35, + y: -35, + r: 315, + color: "#8b5cf6", + size: 2.5, + delay: 0.04, + }, + { + x: 20, + y: -15, + r: 55, + color: "#f43f5e", + size: 2, + delay: 0.07, + }, + { + x: -20, + y: -15, + r: 305, + color: "#eab308", + size: 2, + delay: 0.03, + }, + ].map((p, i) => ( + + ))} + + )} + + + )} + + {steps.map((step, index) => ( + + {/* Node Container */} +
+ {/* Glass Platform underneath the Node */} +
+ + {/* The Node Pill */} +
index + ? "scale-100 opacity-100" + : "scale-100 opacity-70" + } ${ + step === "Hyper AI" + ? "bg-gradient-to-b from-blue-500 to-indigo-600 text-white shadow-[0_4px_14px_0_rgb(59,130,246,40%)] border-0" + : activeStep === index + ? "bg-blue-50 border-2 border-blue-400 text-blue-700 shadow-sm dark:bg-blue-950 dark:border-blue-500/80 dark:text-blue-300" + : activeStep > index + ? "bg-white border-2 border-blue-200 text-blue-600 shadow-sm dark:bg-slate-900 dark:border-blue-800/60 dark:text-blue-400" + : "bg-white border-2 border-slate-200 text-slate-500 shadow-sm dark:bg-slate-900 dark:border-slate-700/80 dark:text-slate-400" + }`} + > + {step} +
+
+ + {/* Dynamic Dashed Jump Arc Trail */} + {index < steps.length - 1 && ( +
+ + {jumpGap === index && ( + + + + )} + + + {/* Mobile Separator */} +
+
+ )} + + ))} + +
+
+
+
+ ); +} diff --git a/components/university/university-hero.tsx b/components/university/university-hero.tsx index 61bb54e..0b5892f 100644 --- a/components/university/university-hero.tsx +++ b/components/university/university-hero.tsx @@ -1,56 +1,34 @@ "use client"; -import Link from "next/link"; import { motion, Variants } from "framer-motion"; -import { - ArrowRight, - GraduationCap, - Building2, - BookOpen, - BrainCircuit, - CheckCircle2, -} from "lucide-react"; +import { ArrowRight, GraduationCap, Sparkles, Check } from "lucide-react"; +import UniversityFlowBanner from "./university-flow-banner"; export default function UniversityHero() { const containerVariants: Variants = { hidden: { opacity: 0 }, visible: { opacity: 1, - transition: { - staggerChildren: 0.15, - delayChildren: 0.1, - }, + transition: { staggerChildren: 0.1, delayChildren: 0.1 }, }, }; const itemVariants: Variants = { - hidden: { - opacity: 0, - y: 20, - }, + hidden: { opacity: 0, y: 15 }, visible: { opacity: 1, y: 0, - transition: { - duration: 0.6, - ease: [0.25, 0.1, 0.25, 1], - }, + transition: { duration: 0.6, ease: [0.16, 1, 0.3, 1] }, }, }; - const flowSteps = [ - { icon: GraduationCap, label: "RGPV" }, - { icon: Building2, label: "All Branches" }, - { icon: BookOpen, label: "Subjects & Syllabus" }, - { icon: BrainCircuit, label: "Hyper AI Learning" }, - ]; - - const resources = [ + const features = [ "Semester-wise Subjects", - "Unit-wise Syllabus", - "Previous Year Questions", - "Hyper AI Assistance", + "Unit-wise Breakdowns", + "Curated PYQ Archives", + "Instant AI Assistance", ]; + const handleScrollToBranches = (e: React.MouseEvent) => { e.preventDefault(); const section = document.getElementById("branches"); @@ -60,174 +38,128 @@ export default function UniversityHero() { }; return ( -
- {/* Background */}{" "} -
- {" "} -
{" "} -
{" "} -
-
-
- {/* Left Side */} - +
+ + +
+ + Rajiv Gandhi Proudyogiki Vishwavidyalaya +
+ + + - -
- - Rajiv Gandhi Proudyogiki Vishwavidyalaya -
- + RGPV +
+ + Engineering Hub + + + + + A premium academic environment designed for absolute clarity. Access + meticulously organized syllabus topics, curated previous year + questions, and AI-driven insights to master your engineering + journey. + - + - RGPV -
- - Engineering Hub - -
- - Explore Branches, Subjects, Syllabus & Previous Year Questions - - + {/* Extra glossy top highlight for 3D tactile shade */} +
- - Access organized engineering resources across all branches and - semesters. Navigate subjects, syllabus topics, previous year - papers, AI-generated notes, and Hyper AI learning support from a - single academic platform. - - - - + Explore Branches - - - - - Browse Subjects - - - - -
-

13+

-

Branches

-
- -
-

8

-

Semesters

-
- -
-

100+

-

Subjects

-
- -
-

AI

-

Learning

-
- + + + + +
+ {features.map((feature, i) => ( +
+ + + {feature} + +
+ ))} +
- {/* Right Side */} + {/* Authentic, ultra-minimal stats section */} -
-
-
- -
+
+
+ + 13+ + + + Branches + +
-
-

- Academic Navigation -

+
-

- Structured Learning Path -

-
+
+ + 8 + + + Semesters +
- {/* Compact step flow */} -
- {flowSteps.map((step, i) => { - const Icon = step.icon; - return ( -
-
- - - {step.label} - -
- - - {i + 1} - -
- ); - })} +
+ +
+ + 100+ + + + Subjects +
-
-

- Available Resources -

- -
- {resources.map((resource) => ( -
- - {resource} -
- ))} -
+
+ +
+ + + AI + + + Powered +
-
+ +
+ + {/* Submerged Flow Banner with Corrected Hierarchy */} +
+
); diff --git a/content/rgpv/cscy/semester-4/cy-402/pyqs.json b/content/rgpv/cscy/semester-4/cy-402/pyqs.json index b94db80..15b1829 100644 --- a/content/rgpv/cscy/semester-4/cy-402/pyqs.json +++ b/content/rgpv/cscy/semester-4/cy-402/pyqs.json @@ -5,5 +5,743 @@ "name": "Fundamental of Cyber Security", "title": "CY-402 - Fundamental of Cyber Security" }, - "papers": [] + "papers": [ + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define Cyber Crime. Classify the different types of Cyber Crimes.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Write short notes on the Internet Time Theft.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What are the distinguishing characteristics between email spoofing and spamming, and how do these practices impact cyber security measures and user trust in online communication?", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "Differentiate Hackers and extremist groups.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What are the different types of computer network intrusion techniques? Explain how we prevent them with suitable examples?", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "How does web jacking differ from traditional hacking methods, and what are the specific techniques and vulnerabilities exploited in web jacking attacks?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What are the different strategies followed to tackle the Cyber Crimes? Explain them.", + "unit": "Unit 3" + }, + { + "id": "q4b", + "label": "b)", + "text": "How has the proliferation of teenage web vandals impacted online communities and digital spaces and what measures can be implemented to mitigate their influence and protect internet integrity?", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "How the nature of criminality effects the Cyber Crime? Provide necessary examples.", + "unit": "Unit 3" + }, + { + "id": "q5b", + "label": "b)", + "text": "Compare and contrast The Indian Evidence Act of 1872 v/s Information Technology Act, 2000.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Explain in brief about the role of proving electronic messages in the Cyber Crime.", + "unit": "Unit 4" + }, + { + "id": "q6b", + "label": "b)", + "text": "Write short notes on the electronic agreements as the proofs of the Cyber Crime.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "How has the evolution of computer viruses influenced the cybercrime and what are the most significant challenges in detecting and mitigating the viruses?", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "Write short notes on the DDoS Attacks.", + "unit": "Unit 5" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two of the following:\ni) Salami Technique\nii) Software Piracy\niii) Cyber Fraud\niv) Trojan Horses", + "unit": "Unit 1" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define Cyber-crime. What are the challenges of the Cyber Crimes.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Write short notes on the E-mail Spoofing and Spamming.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Explain in detail about the Salami Technique.", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "Compare and contrast hackers and insurgents.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is meant by software piracy? What are the major factors contributing to its persistence?", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "What are the most prevalent tactics and techniques utilized by cybercriminals in perpetrating online fraud, and how can individuals and organizations effectively safeguard themselves against such threats?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What are the major elements of the Cyber Crime and IT Act 2000?", + "unit": "Unit 3" + }, + { + "id": "q4b", + "label": "b)", + "text": "Discuss about the monetary penalties applied for the different types of Cyber Crimes.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Differentiate Defamation and E-mail Abuse.", + "unit": "Unit 3" + }, + { + "id": "q5b", + "label": "b)", + "text": "How do management strategies address the unique challenges posed by electronic records in the investigation and prosecution of Cyber Crimes.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Write short notes on the probative value of e-signatures.", + "unit": "Unit 4" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain in briefly about the status of the electronic records as evidence.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "How do proxy servers and anonymizers function to enhance online privacy and security and what are the distinguishing features between the two in terms of their operation and effectiveness in safeguarding users' identities and data?", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "What are the primary differences between keyloggers and spyware in terms of functionality, potential impact on computer systems?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two of the following:\ni) Internet Time Theft\nii) Web Jacking\niii) Trends of Cyber Crime\niv) Phishing", + "unit": "Unit 1" + } + ] + } + ] + }, + { + "exam": "November 2023", + "year": 2023, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain cyber crime. Mention some important cyber crime and explain each of them.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Explain E-mail spoofing, spamming.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Explain web jacking along with the prevention measure of online fraud and software piracy.", + "unit": "Unit 2" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is theft in cyber terrorism also explain web server hacking?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Explain criminal justice with some of the main provisions of cyber crime in IT Act 2000.", + "unit": "Unit 3" + }, + { + "id": "q3b", + "label": "b)", + "text": "Explain Dos and DDos attacks in brief. What are the techniques behind such attacks?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain Indian Evidence Act 1872. What are the provisions mention in it.", + "unit": "Unit 4" + }, + { + "id": "q4b", + "label": "b)", + "text": "What do you understand by attack on web server? Explain the steps taken to avoid web server hacking.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "List down some of the strategies to tackle cyber crime.", + "unit": "Unit 3" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the term 'Hacking'. What are the various classification of hacker? Mention them.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What do you mean by 'Salami attack'? What are the adverse effect on economic structure of society. Explain with example.", + "unit": "Unit 1" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain defamation in the context of cyber crime. Mention the provision of cyber defamation.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What do you understand by the term VIRUS and WORMS along with their types in details.", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain \"Software Piracy\" write down various activities that constitutes software piracy.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "How to find record as evidence to proof and management of electronic record for relevancy.", + "unit": "Unit 4" + }, + { + "id": "q8b", + "label": "b)", + "text": "Explain Session Hijacking with the method of initiating session hijacking.", + "unit": "Unit 2" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "What are the challenges of cyber security and identify its elements?", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is spoofing explain with example?", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What types of Internet frauds are most common explain?", + "unit": "Unit 2" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is software piracy and its types?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is cyber crime also brief about IT Act, 2000?", + "unit": "Unit 3" + }, + { + "id": "q3b", + "label": "b)", + "text": "What is the meaning of cyber criminality?", + "unit": "Unit 3" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Discuss the impact of Digital signatures in ITA 2000.", + "unit": "Unit 4" + }, + { + "id": "q4b", + "label": "b)", + "text": "What is the Chain of Custody concept? How it is related to forensics?", + "unit": "Unit 4" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What is the role of digital signature in digital evidence?", + "unit": "Unit 4" + }, + { + "id": "q5b", + "label": "b)", + "text": "What do you mean by proof and management of electronic records?", + "unit": "Unit 4" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What are the methods and tools of cyber crime?", + "unit": "Unit 5" + }, + { + "id": "q6b", + "label": "b)", + "text": "How are proxy servers different from Anonymizers?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What are the characteristics of cyber criminals?", + "unit": "Unit 2" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is World Wide Web? Explain.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Explain the following terms related to cyber crimes:\ni) Spamming\nii) Salami technique\niii) Hacking\niv) Password sniffing", + "unit": "Unit 1" + } + ] + } + ] + }, + { + "exam": "June 2022", + "year": 2022, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Give difference between spoofing and phishing.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Explain spamming with suitable example.", + "unit": "Unit 1" + }, + { + "id": "q1c", + "label": "c)", + "text": "What is Salami attack explain with example?", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "How do you prevent network intrusions?", + "unit": "Unit 2" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is password sniffing in cyber security?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What are the characteristics of cyber criminals?", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "What is World Wide Web? Explain.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Discuss the impact of Digital signatures in ITA 2000.", + "unit": "Unit 4" + }, + { + "id": "q4b", + "label": "b)", + "text": "What are the positive aspects of the ITA 2000? Explain.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Write a short note on Network Forensics.", + "unit": "Unit 5" + }, + { + "id": "q5b", + "label": "b)", + "text": "What is cyber defamation and harassment?", + "unit": "Unit 3" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What are some examples of password attack techniques?", + "unit": "Unit 5" + }, + { + "id": "q6b", + "label": "b)", + "text": "How does viruses and worms works in cyber-attacks?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What are the most common attacks on wireless networks?", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is spyware and key loggers?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Explain the following terms according to IT Act 2000:\ni) Records as evidence\nii) Proof of electronic agreements\niii) Status of electronic\niv) Software Piracy", + "unit": "Unit 4" + } + ] + } + ] + } + ] } diff --git a/content/rgpv/cscy/semester-4/cy-405/pyqs.json b/content/rgpv/cscy/semester-4/cy-405/pyqs.json index 5b9c2ce..4b9a8fb 100644 --- a/content/rgpv/cscy/semester-4/cy-405/pyqs.json +++ b/content/rgpv/cscy/semester-4/cy-405/pyqs.json @@ -5,5 +5,731 @@ "name": "Database Management System", "title": "CY-405 - Database Management System" }, - "papers": [] + "papers": [ + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the architecture of DBMS and describe the main components.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Differentiate between DBMS and traditional file systems. Explain how DBMS offers data independence with examples.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Draw and explain an ER diagram for a Hospital Management System with entities like Patients, Doctors and Appointments, including relationships and constraints.", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "Describe different types of relational keys. What is the importance of primary and candidate keys in relational databases?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Write SQL queries to perform the following tasks on a student database:\ni) Retrieve all students who scored above 85 in Mathematics.\nii) Find the names of students who are enrolled in both Math and Science courses.", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "Define triggers in SQL. Write a trigger that updates the total order amount in an \"Orders\" table whenever a new order is added in an \"OrderItems\" table.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Define functional dependencies with examples. Explain the importance of functional dependencies in achieving database normalization.", + "unit": "Unit 3" + }, + { + "id": "q4b", + "label": "b)", + "text": "Normalize the following relation to 2NF and 3NF:\nEmployee(SSN, EmpName, DeptID, DeptName, DeptLocation, ProjectID, ProjectName)", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Define deadlock in the context of databases. Describe one technique each for deadlock prevention, detection and resolution.", + "unit": "Unit 4" + }, + { + "id": "q5b", + "label": "b)", + "text": "Discuss two-phase locking protocol. Explain its role in maintaining serializability in concurrent transactions.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Differentiate between serial and non-serial schedules. Test if the following schedule is serializable or not:\nT1 : R(X), W(X), R(Y), W(Y)\nT2 : R(X), R(Y), W(Y)\nT3 : R(Y), W(X)", + "unit": "Unit 4" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain the purpose of indexing in database. How does a primary index differ from a clustering index?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Describe the different phases of query processing in DBMS. How does query optimization contribute to the efficiency of database systems?", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "Given a database of student records, explain how a hash function can be used for quick data retrieval.", + "unit": "Unit 5" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two):\ni) Relational integrity constraints and their importance in databases\nii) Entity-Relationship (ER) model\niii) Lossless Join and Dependency Preserving Decomposition\niv) Serializability and its types", + "unit": "Unit 2" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "What is DBMS and differentiate between DBMS and traditional file Storage System?", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Explain different types of data models in DBMS?", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "State and Explain various features of E-R models?", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "What are the statements in SQL for destroying and altering tables. Explain with examples?", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Discuss about different types of Integrity Constraints?", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "Write Relational Algebra Queries for the following for (Sailor Database). Sailors(Sid, Sname, Rating, Age), Boats(Bid, Bname, Color), Reserves(Sid, Bid, Day)\ni) Find the following id's with age over 20 and who have not reserved a red boat.\nii) Find the names of Sailors who reserved boat 103.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What do you understand by a Functional Dependencies. Explain?", + "unit": "Unit 3" + }, + { + "id": "q4b", + "label": "b)", + "text": "State and Explain Lossless join decomposition?", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain in detail about Relation Schemas with suitable examples?", + "unit": "Unit 3" + }, + { + "id": "q5b", + "label": "b)", + "text": "What is a transaction and explain its properties and States?", + "unit": "Unit 4" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What is Schedule? Explain about Serial and Non Serial Schedule?", + "unit": "Unit 4" + }, + { + "id": "q6b", + "label": "b)", + "text": "How the Lock Manager implements lock and Unlock request? Explain.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain extendable hashing techniques for indexing data records. Consider your Class students data records and roll numbers as index attribute and show the Hash directory?", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain Static Hashing? What are the advantages of static hashing in DBMS?", + "unit": "Unit 5" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two:\ni) Query Processing\nii) Data independence\niii) Union and Intersection\niv) Dependency Preservation", + "unit": "Unit 5" + } + ] + } + ] + }, + { + "exam": "November 2023", + "year": 2023, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the architecture of Database Management Systems with neat diagram?", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is Null Attribute? With suitable diagram explain Weak and Strong Entity Set.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Discuss about File Organization and Access methods.", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "How to write the queries in Relational Algebra? Explain with examples.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What do you understand by Tuples and Attributes? Explain with examples.", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "Discuss about Joins with suitable examples.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain normalization using (1NF, 2NF, 4NF) with suitable examples?", + "unit": "Unit 3" + }, + { + "id": "q4b", + "label": "b)", + "text": "What are the steps to be followed to convert a relation in 3NF to BCNF?", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Compute the closer of the following set of functional dependencies for a relation scheme. R(A, B, C, D, E), F = { A → BC, CD → E, B → D, E → A } List out the candidate keys of R.", + "unit": "Unit 3" + }, + { + "id": "q5b", + "label": "b)", + "text": "State and explain shadow paging with suitable example.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Discuss about Timestamp Based Concurrency Control.", + "unit": "Unit 4" + }, + { + "id": "q6b", + "label": "b)", + "text": "What do you understand by Deadlocks, Explain Avoidance and Prevention in deadlock?", + "unit": "Unit 4" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Write an algorithm to implement project and join operation of relational algebra.", + "unit": "Unit 5" + }, + { + "id": "q7b", + "label": "b)", + "text": "Compare Single and Multilevel indices.", + "unit": "Unit 5" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two:\ni) Complexity Measures\nii) Components of DBMS\niii) Triggers\niv) Recoverability", + "unit": "Unit 5" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the various levels of data abstraction in a database management system.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Explain different types of relationships amongst tables in a DBMS. Explain different types of attributes in a DBMS.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Define degree and cardinality. Based upon the given table write degree and cardinality.\nPatients Table:\nPatNo | PatName | Dept | DocID\n1 | Leena | ENT | 100\n2 | Supreeth | Ortho | 200\n3 | Madhu | ENT | 100\n4 | Neha | ENT | 100\n5 | Deepak | Ortho | 200", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is the meaning of ACID characteristics in relational databases? Define the structure of a relational database schema.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Describe the different types of keys. Explain different operations in Relational algebra.", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "Consider the student table given below. Write commands (using relational algebra operations), and outputs for the followings:\nStudent Table:\nReg.No. | Branch | Section\n1 | CSE | A\n2 | ECE | B\n3 | CIVIL | B\n4 | IT | A\ni) To display all the records of student table.\nii) To display all the records of CSE branch in student table.\niii) To display the record of ECE branch section B students.\niv) To display the records of section B CSE and IT branch.\nv) To display all the records in student tables whose regno>2.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What does Normalization mean? Explain different normal forms with examples.", + "unit": "Unit 3" + }, + { + "id": "q4b", + "label": "b)", + "text": "Suppose you are given a relation R = (A, B, C, D, E) with the following functional dependencies: {CE→D, D→B, C→A}.\ni) Find all candidate keys.\nii) Identify the best normal form that R satisfies (1NF, 2NF, 3NF, or BCNF).\niii) If the relation is not in BCNF, decompose it until it becomes BCNF. At each step, identify a new relation, decompose and re-compute the keys and the normal forms they satisfy.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Let R = (A, B, C, D, E, F) be a relation scheme with the following dependencies: C→F, E→A, EC→D, A→B. Find candidate key for R?", + "unit": "Unit 3" + }, + { + "id": "q5b", + "label": "b)", + "text": "The following functional dependencies are given: AB→CD, AF→D, DE→F, C→G, F→E, G→A. Find the closure of CF, BG, AB and AF.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What do you mean by Serializability? Discuss the conflict and view serializability with suitable example.", + "unit": "Unit 4" + }, + { + "id": "q6b", + "label": "b)", + "text": "What do you mean by Multiple granularities? How is it implemented in transaction system?", + "unit": "Unit 4" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What are the methods used for deadlock prevention in DBMS? What is difference between blocking and deadlock?", + "unit": "Unit 4" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is Checkpoint in DBMS? Why is Checkpoint used in database? How Checkpoint works in DBMS?", + "unit": "Unit 4" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write secondary storage? Explain types of data storage in DBMS and describe storage hierarchy.\nDistinguish between:\ni) Primary and Secondary indexing.\nii) Ordered indexing and hashing.", + "unit": "Unit 5" + } + ] + } + ] + }, + { + "exam": "June 2022", + "year": 2022, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Mention the drawbacks of traditional file-based systems that make a database management system a better option.", + "unit": "Unit 1" + }, + { + "id": "q1b", + "label": "b)", + "text": "Define data, database, and database management system. Discuss the advantages of DBMS?", + "unit": "Unit 1" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is meant by an entity-relationship (E-R) model? Explain the terms Entity, Entity Type and Entity Set in DBMS.", + "unit": "Unit 1" + }, + { + "id": "q2b", + "label": "b)", + "text": "Draw E-R Diagram of Library Management System.", + "unit": "Unit 1" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is the difference between a relation and a relation schema? Discuss their relationship.", + "unit": "Unit 2" + }, + { + "id": "q3b", + "label": "b)", + "text": "What is a Foreign key? List the properties of a foreign key. Explain with the help of an example.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Write a query and explain with examples that JOIN two tables so that all rows from the first table are in the result.", + "unit": "Unit 2" + }, + { + "id": "q4b", + "label": "b)", + "text": "What is the difference between a LEFT JOIN and a FULL JOIN? Explain with the help of an example.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain aggregate function with syntax and give an example.", + "unit": "Unit 2" + }, + { + "id": "q5b", + "label": "b)", + "text": "Write the SQL query for the followings:\ni) Fetch the EmpId and FullName of all the employees working under Manager with id – '121' from Employee table.\nii) Fetch the different projects available from the Employee Salary table.\niii) Fetch the count of employees working in project 'P1' from Employee Salary table.\niv) Find the maximum, minimum, and average salary of the employees from Employee Salary table.\nv) Find the employee id whose salary lies in the range of 9000 and 15000 from Employee Salary table.", + "unit": "Unit 2" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What is difference between Lossless join decomposition and lossy less join decomposition? Explain with examples.", + "unit": "Unit 3" + }, + { + "id": "q6b", + "label": "b)", + "text": "Given a relation R(A, B, C, D) and Functional Dependency set FD = { AB → CD, B → C }, determine whether the given R is in 2NF? If not convert it into 2NF.", + "unit": "Unit 3" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What is Log? How is it maintained? Discuss the salient features of deferred database modification and immediate database modification strategies in brief.", + "unit": "Unit 4" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is Recoverable schedule? Why is recoverability of schedules desirable? Are there any circumstances under which it would be desirable to allow non-recoverable schedules? Explain your answer.", + "unit": "Unit 4" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Why query Optimization is needed? What is the difference between query processing and query optimization?\nWhat are the phases of Query Processing? How are query processing and query optimization related?", + "unit": "Unit 5" + } + ] + } + ] + } + ] } diff --git a/content/rgpv/cse/semester-3/cs-302/pyqs.json b/content/rgpv/cse/semester-3/cs-302/pyqs.json index 68fc0f7..609589f 100644 --- a/content/rgpv/cse/semester-3/cs-302/pyqs.json +++ b/content/rgpv/cse/semester-3/cs-302/pyqs.json @@ -2,8 +2,1180 @@ "subject": { "id": "cs-302", "code": "CS-302", - "name": "Discrete Structure (DS)", - "title": "CS-302 - Discrete Structure (DS)" + "name": "Discrete Structure", + "title": "(CSE)-302 – Discrete Structure", + "semester": "III", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Show that the relation 'R' defined by (a, b) R (c, d) if a + d = b + c is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q1b", + "label": "b)", + "text": "If X = {1, 2, 3, 4} and R = {(x, y) | x < y}. Draw the graph of 'R' and also give its matrix.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Prove that if R is an equivalence relation on a set A, show that R⁻¹ is also an equivalence relation on A.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is Mathematical induction? Use mathematical induction to prove that: 1.1! + 2.2! + ... + n.n! = (n + 1)! - 1 where n is a positive integer.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Find the explicit formula for the Fibonacci numbers. Use fₙ = fₙ₋₁ + fₙ₋₂ as recursive condition and f₀ = 0 and f₁ = 1 as initial condition.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q3b", + "label": "b)", + "text": "Draw the Hasse diagram representing the positive divisors of 36.", + "unit": "Unit 5", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Prove that the set G = {0, 1, 2, 3, 4, 5, 6} is a finite abelian group of order 7 with respect to multiplication modulo 7 as the composition in G.", + "unit": "Unit 2", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "State the Lagrange's Theorem with example. Also explain Permutation and Symmetric Group.", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Find PDNF by constructing its PCNF of (Q ∨ P) ∧ (Q ∨ R) ∧ (∼(P ∨ R) ∨ ∼Q).", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Prove that for any three propositions P, Q, R the compound proposition (P → (Q → R)) → ((P → Q) → (P → R)) is a tautology by laws of logic.", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Explain Tautologies, Contradiction and Contingencies with suitable examples.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain the method of proving theorems by direct, indirect, contradiction and by cases.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Give a simple condition on the weights of a graph that will guarantee that there is a unique maximal spanning tree for the graph.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define Isomorphism of graphs. What are the steps followed in discovering the Isomorphism?", + "unit": "Unit 4", + "type": "theory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Explain Eulerian and Hamiltonian graphs with examples, also draw the graphs of the following: i) Eulerian but not Hamiltonian ii) Hamiltonian but not Eulerian", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q8b", + "label": "b)", + "text": "Prove that the sum of the degree of all the vertices in a graph G is equal to twice the number of edges in G.", + "unit": "Unit 4", + "type": "theory" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Prove that P(A) ⊆ P(B) if and only if A ⊆ B.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q1b", + "label": "b)", + "text": "Suppose that R is the relation on the set of strings of English letters such that aRb if and only if l(a) = l(b), where l(x) is the length of the string x. Is R an equivalence relation?", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Illustrate the concept of an inverse function. Let f : Z → Z be such that f(x) = x + 1. Is f invertible? if it is then what is its inverse?", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q2b", + "label": "b)", + "text": "Define group. Explain the properties of groups.", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "", + "text": "Let S = N × N. Let * be the operation on S defined by (a, b) * (a', b') = (aa', bb'). i) Define f : (S, *) → (Q, ×) by f(a, b) = a/b. Show that f is a homomorphism. ii) Find the congruence relation ∼ in S determined by the homomorphism f, that is, where x ∼ y if f(x) = f(y).", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Show that the ((p ∨ q) ∧ ¬p) → q compound proposition is a tautology.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "Use existential and universal quantifiers to express the statement. \"No one has more than three grandmothers\" using the propositional function G(x, y), which represents \"x is the grandmother of y.\"", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Discuss the 6 tuple notation of finite state machine M with an example.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Consider the complete weighted graph G in the following figure with 5 vertices. Find a Hamiltonian circuit of minimal weight.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.5-b_june-2023.png", + "imageAlt": "A complete weighted graph with 5 vertices labeled A, B, C, D, E. The graph forms a pentagon shape with inner star connections. Edge weights are: A-B=100, B-C=125, C-D=300, D-E=75, E-A=175, A-C=200, A-D=225, B-D=250, B-E=225, C-E=275." + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Discuss the various applications of graph colouring.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q6b", + "label": "b)", + "text": "State Euler's formula for a planar graph. Give an example of a planar graph with 5 vertices and 5 regions and verify Euler's formula for your example.", + "unit": "Unit 4", + "type": "theory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Consider the set A = {4, 5, 6, 7}. Let R be the relation ≤ on A. Draw the directed graph and the Hasse diagram of R.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Consider the lattice M in the following figure. i) Find the non-zero join irreducible elements and atoms of M. ii) Is M distributive and complemented?", + "unit": "Unit 5", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.7-b_june-2023.png", + "imageAlt": "A Hasse diagram labeled M with 6 nodes. Bottom node is 0. Top node is 1. Node 0 connects upwards to 'a' and 'b'. Node 'a' connects upwards to 'c'. Node 'b' connects upwards to 'c' and 'd'. Nodes 'c' and 'd' connect upwards to 1." + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "", + "text": "Discuss in brief any two of the following: i) Partial ordering relation ii) Cosets iii) Disjunctive normal form iv) Pigeonhole principle", + "unit": "Unit 1, Unit 2, Unit 3, Unit 1", + "type": "theory" + } + ] + } + ] + }, + { + "exam": "December 2023", + "year": 2023, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Out of 120 students surveyed, it was found that 20 students have studied French, 50 students have studied English, 70 students have studied Hindi, 5 have studied English and French, 20 have studied English and Hindi, 10 have studied Hindi and French, only 3 students have studied all the three languages. Find how many students have studied: i) Hindi alone ii) French alone iii) English, but not Hindi iv) Hindi, but not French", + "unit": "Unit 1", + "type": "numerical" + }, + { + "id": "q1b", + "label": "b)", + "text": "If R be a relation in the set of integers Z defined by R = {(x, y) : x ∈ Z, y ∈ Z, (x - y) is multiple of 3}. Show that it is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "If f : R → R is defined by: f(x) = {3x - 12, x > 3; 2x² + 3, -2 < x ≤ 3; 3x² - 7, x ≤ -2}. Find f⁻¹(3), f⁻¹(0), and f⁻¹(-2).", + "unit": "Unit 1", + "type": "numerical" + }, + { + "id": "q2b", + "label": "b)", + "text": "Show that 1² + 2² + 3² + ... + n² = n(n+1)(2n+1)/6, n ≥ 1 by mathematical induction.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Prove that F = {a + b√2 | a, b are rational} is a field.", + "unit": "Unit 2", + "type": "theory" + }, + { + "id": "q3b", + "label": "b)", + "text": "Define the following: i) Symmetric Group ii) Normal Subgroup iii) Homomorphism", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Construct the truth table of the following formula: i) (∼(p ∨ (q ∨ r)) ⇔ ((p ∨ q) ∧ (p ∨ r))) ii) ((∼q ⇒ ∼p) ⇒ (p ⇒ q))", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "Write the negation of the following: i) If the determinant of a system of linear equations is zero then either the system has no solution or has an indefinite number of solutions. ii) Either today is not a Sunday or today is not a Wednesday.", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Show that the proposition ∼(p ∧ q) and ∼p ∨ ∼q are logically equivalent.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Obtain the conjunctive normal form (CNF) of: i) p ∧ (p ⇒ q) ii) ∼p ⇒ [r ∧ (p ⇒ q)]", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Determine whether the graphs F₁ and F₂ are isomorphic.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.6-a_dec-2023.png", + "imageAlt": "Two graphs labeled F1 and F2. Graph F1 has 5 vertices with edges crossing, resembling a distorted bowtie or a cycle with chords. Graph F2 is a pentagon with 5 vertices and one internal diagonal edge connecting two non-adjacent vertices." + }, + { + "id": "q6b", + "label": "b)", + "text": "Find an Euler Path in the graph below.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.6-b_dec-2023.png", + "imageAlt": "Undirected graph with 7 vertices labeled A, B, C, D, E, F, G. Vertices A, B, C are in the top row, G, F, E in the bottom row, and D in the center. Edges connect: A-B, B-C, C-E, E-F, F-G, G-A (forming an outer rectangle loop), plus internal edges A-D, C-D, A-F, and C-F." + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Define a lattice. Let (L, ≤, ∨, ∧) be a lattice, and a, b, c, d ∈ L be such that a ≤ b and c ≤ d. Show that a ∨ c ≤ b ∨ d and a ∧ c ≤ b ∧ d.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Show that D₁₂ and D₁₈ are isomorphic lattices. Further, show that none is isomorphic to the lattice D₂₀.", + "unit": "Unit 5", + "type": "theory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Show that aₙ = c₁2ⁿ + c₂4ⁿ is a solution of the recurrence relation aₙ - 6aₙ₋₁ + 8aₙ₋₂ = 0.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q8b", + "label": "b)", + "text": "Find the sequence having the generating function G(x) given by: G(x) = x / (1 - 2x)", + "unit": "Unit 5", + "type": "theory" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the following: i) Euler Graph ii) Isomorphic graphs iii) Minimal spanning tree iv) Height of the tree", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q1b", + "label": "b)", + "text": "Let Z be the group of integers with binary operation * defined by a * b = a + b - 2, for all a, b ∈ Z. Find the identity element of the group ⟨Z, *⟩.", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Prove that the Complement of each element in a Boolean Algebra B is unique.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q2b", + "label": "b)", + "text": "Let A be any finite set and P(A) be the power set of A. ⊆ be the inclusion relation on the elements of P(A). Draw the Hasse diagrams of (P(A), ⊆) for the following: i) A = {a} ii) A = {a, b} iii) A = {a, b, c} iv) A = {a, b, c, d}", + "unit": "Unit 5", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "i) Prove that p ∧ q ⇒ q ∨ p is a Tautology. ii) Show that (p ∨ q) ∧ (¬p) ∧ (¬q) is a contradiction.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q3b", + "label": "b)", + "text": "Explain complete digraph and Euler Graph using suitable example of both.", + "unit": "Unit 4", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Define planar graph. Prove that for any connected planar graph, v - e + r = 2 where v, e, r is the number of vertices, edges, and regions of the graph respectively.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "Prove that the relation R defined by \"a is congruent to b modulo m\" on the set of integers is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Prove that 5²ⁿ - 1 is divisible by 24, where n is any positive integer.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Draw the Hasse diagram representing the positive divisors of 36 and 45.", + "unit": "Unit 5", + "type": "theory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Show that the relation 'R' defined by (a, b) R (c, d) iff a + d = b + c is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain various Rules of Inference for Propositional Logic.", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Show that every Cyclic group is Abelian. Prove that a lattice with 5 elements is not a Boolean algebra.", + "unit": "Unit 2, Unit 5", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define Pigeon hole Principle. Write the contra positive of the implication: \"if it is Sunday then it is a holiday.\"", + "unit": "Unit 1, Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Prove that G = {0, 1, 2, 3, 4, 5, 6} is an abelian group of order 7 with respect to addition modulo 7.", + "unit": "Unit 2", + "type": "theory" + }, + { + "id": "q8b", + "label": "b)", + "text": "Prove or disprove that intersection of two normal subgroups of a group G is again a normal subgroup of G. Define subgroup, normal subgroup, Quotient group, with an example for each.", + "unit": "Unit 2", + "type": "theory" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define various types of functions. How many symmetric and reflexive relations are possible from a set A containing ‘n’ elements?", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q1b", + "label": "b)", + "text": "Let Z be the group of integers with binary operation * defined by a * b = a + b - 2, for all a, b ∈ Z. Find the identity element of the group ⟨Z, *⟩.", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Show that every Cyclic group is Abelian. Prove that a lattice with 5 elements is not a Boolean algebra.", + "unit": "Unit 2, Unit 5", + "type": "theory" + }, + { + "id": "q2b", + "label": "b)", + "text": "Define Pigeon hole Principle. Write the contra positive of the implication: \"if it is Sunday then it is a holiday.\"", + "unit": "Unit 1, Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Show that there does not exist a graph with 5 vertices with degrees 1, 3, 4, 2, 3 respectively.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q3b", + "label": "b)", + "text": "Obtain the generating function for the sequence 4, 4, 4, 4, 4, 4. Explain complete digraph.", + "unit": "Unit 5, Unit 4", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Define planar graph. Prove that for any connected planar graph, v - e + r = 2 Where v, e, r is the number of vertices, edges, and regions of the graph respectively.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "Find the numbers between 1 to 500 that are not divisible by any of the integers 2 or 3 or 5 or 7.", + "unit": "Unit 5", + "type": "numerical" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "A collection of 10 electric bulbs contain 3 defective ones. (i) In how many ways can a sample of four bulbs be selected? (ii) In how many ways can a sample of 4 bulbs be selected which contain 2 good bulbs and 2 defective ones? (iii) In how many ways can a sample of 4 bulbs be selected so that either the sample contains 3 good ones and 1 defectives ones or 1 good and 3 defectives ones?", + "unit": "Unit 5", + "type": "numerical" + }, + { + "id": "q5b", + "label": "b)", + "text": "Discuss about Complete digraph and Euler Graph with the help of suitable examples.", + "unit": "Unit 4", + "type": "theory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Solve the following recurrence equation using generating function. G(K) - 7 G(K-1) + 10 G(K-2) = 8K + 6.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q6b", + "label": "b)", + "text": "Prove the validity of the following argument \"if the races are fixed so the casinos are crooked, then the tourist trade will decline. If the tourist trade decreases, then the police will be happy. The police force is never happy. Therefore, the races are not fixed.\"", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Let (L, ∨, ∧, ≤) be a distributive lattice and a, b ∈ L. if a ∧ b = a ∧ c and a ∨ b = a ∨ c then show that b = c.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain various Rules of Inference for Propositional Logic.", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "What is Ring? Define elementary properties of Ring with example.", + "unit": "Unit 2", + "type": "theory" + }, + { + "id": "q8b", + "label": "b)", + "text": "Prove or disprove that intersection of two normal subgroups of a group G is again a normal subgroup of G.", + "unit": "Unit 2", + "type": "theory" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Consider three sets A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6} and C = {1, 5, 7}. Using Venn diagrams, determine and shade the regions corresponding to (A ∪ B) ∩ (B ∩ C) and A ∩ (B ∪ C). Verify if these expressions are equivalent by listing the elements.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q1b", + "label": "b)", + "text": "Define and illustrate an equivalence relation by constructing an equivalence relation on the set S = {1, 2, 3, 4, 5, 6} where two elements are related if they have the same remainder when divided by 3.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is pigeonhole principle? Prove it by using mathematical induction and use it to show that in a group of 15 people, at least two share the same birth month.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q2b", + "label": "b)", + "text": "Explain a recursively defined function. Solve the recurrence relation f(n) = f(n-1) + 3 with initial condition f(0) = 2.", + "unit": "Unit 5", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Prove that the set G = {0, 1, 2, 3} under addition modulo 4 is an abelian group. Identify the identity and inverse elements.", + "unit": "Unit 2", + "type": "theory" + }, + { + "id": "q3b", + "label": "b)", + "text": "Define a homomorphism between two groups. Verify whether the mapping f: R → R defined by f(x) = 2x is a homomorphism under addition.", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Consider the propositions p, q and r, where: p: \"It is raining.\" q: \"I am carrying an umbrella.\" r: \"I stay dry.\" Assume the implication (p → q) → r. Construct a truth table for the expression (p → q) → r and determine if it is a tautology or contradiction.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "What are predicates in propositional logic? Define universal and existential quantifiers with examples.", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Define graph theory and explain the basic terminology of graphs such as vertices, edges, degree and adjacency.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Define and give an example of an isomorphic graph pair. Verify isomorphism between two adjacency matrices.", + "unit": "Unit 4", + "type": "theory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "For the graph G with vertices V = {A, B, C, D} and edges E = {(A, B), (B, C), (C, D), (D, A), (A, C)}, determine: i) Whether the graph contains a Eulerian path or circuit or not. ii) All Hamiltonian circuits in the graph G.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q6b", + "label": "b)", + "text": "How many permutations can be formed from the letters of the word “MATHEMATICS” such that all vowels are together?", + "unit": "Unit 5", + "type": "numerical" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What is a Hasse diagram? Draw the Hasse diagram for the set {1, 2, 3, 6, 9, 18} with the divisibility relation.", + "unit": "Unit 5", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define a lattice and prove that every finite lattice has a unique least upper bound and greatest lower bound.", + "unit": "Unit 5", + "type": "theory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "", + "text": "Write short notes on (any four): i) Finite state machines as language recognizers ii) Binomial theorem iii) Permutation group iv) Partial Ordering Relation v) Countable and uncountable sets", + "unit": "Unit 3, Unit 5, Unit 2, Unit 1, Unit 1", + "type": "theory" + } + ] + } + ] + }, + { + "exam": "December 2025", + "year": 2025, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define countable and uncountable sets. Prove that the set of rational numbers is countable.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q1b", + "label": "b)", + "text": "Using Venn diagram, prove: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Define relation. Explain equivalence relation and partial ordering relation with suitable examples.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q2b", + "label": "b)", + "text": "Let A = {1, 2, 3} R = {(1,1), (2,2), (3,3), (1,2), (2,1)}. Check whether R is an equivalence relation and find equivalence classes.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Define one-one, onto and bijective functions. Prove that inverse of a function exists if and only if the function is bijective.", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q3b", + "label": "b)", + "text": "State and prove Pigeonhole Principle.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Construct truth table for the proposition. (p → q) ↔ (¬p ∨ q) and show that it is a tautology.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q4b", + "label": "b)", + "text": "Convert the following statement into predicate logic and write its negation: \"Every student studies Discrete Mathematics.\"", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Prove by mathematical induction that: 1 + 2 + 3 + ... + n = n(n+1)/2", + "unit": "Unit 1", + "type": "theory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Prove by contradiction that √2 is irrational.", + "unit": "Unit 1", + "type": "theory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Define group and Abelian group. Prove that identity element of a group is unique.", + "unit": "Unit 2", + "type": "theory" + }, + { + "id": "q6b", + "label": "b)", + "text": "Find all subgroups of the group Z₈.", + "unit": "Unit 2", + "type": "theory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Define Finite State Machine. Explain FSM as a language recognizer.", + "unit": "Unit 3", + "type": "theory" + }, + { + "id": "q7b", + "label": "b)", + "text": "Design a finite state machine that accepts all binary strings ending with 01.", + "unit": "Unit 3", + "type": "theory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Define Euler path and Euler circuit. State necessary and sufficient conditions for their existence.", + "unit": "Unit 4", + "type": "theory" + }, + { + "id": "q8b", + "label": "b)", + "text": "Explain Dijkstra's Algorithm and find the shortest path from a given source vertex 0 to all other vertices in a weighted graph.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.8-b_dec-2025.png", + "imageAlt": "A weighted undirected graph with 5 vertices labeled 0 to 4. The edges and their weights are: edge between 0 and 1 with weight 4, edge between 0 and 2 with weight 8, edge between 1 and 4 with weight 6, edge between 2 and 3 with weight 2, and edge between 3 and 4 with weight 10." + } + ] + } + ] + } + ] } diff --git a/content/rgpv/cse/semester-3/cs-302/syllabus.json b/content/rgpv/cse/semester-3/cs-302/syllabus.json index aa97ba1..b5d0273 100644 --- a/content/rgpv/cse/semester-3/cs-302/syllabus.json +++ b/content/rgpv/cse/semester-3/cs-302/syllabus.json @@ -1,111 +1,686 @@ { "subject": { - "id": "cs-302", - "code": "CS-302", + "id": "cse-302", + "code": "CSE-302", "name": "Discrete Structure", - "title": "CS-302 - Discrete Structure", - "semester": "III" + "title": "(CSE)-302 – Discrete Structure", + "semester": "III", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, "modules": [ { - "id": "module-1", + "id": "cse302-u1", "number": 1, "title": "Set Theory, Relation, Function, Theorem Proving Techniques", "hours": 8, "topics": [ - "Set Theory: Definition of sets", - "Countable and uncountable sets", - "Venn Diagrams", - "Proofs of some general identities on sets", - "Relation: Definition", - "Types of relation", - "Composition of relations", - "Pictorial representation of relation", - "Equivalence relation", - "Partial ordering relation", - "Job-Scheduling problem", - "Function: Definition", - "Type of functions: one to one, into and onto function", - "Inverse function", - "Composition of functions", - "Recursively defined functions", - "Pigeonhole principle", - "Theorem proving Techniques: Mathematical induction, Proof by contradiction" - ] + { + "id": "cse302-u1-set-theory-definition", + "slug": "set-theory-definition", + "title": "Set Theory: Definition of sets", + "displayOrder": 1 + }, + { + "id": "cse302-u1-countable-uncountable", + "slug": "countable-uncountable", + "title": "Countable and uncountable sets", + "displayOrder": 2 + }, + { + "id": "cse302-u1-venn-diagrams", + "slug": "venn-diagrams", + "title": "Venn Diagrams", + "displayOrder": 3 + }, + { + "id": "cse302-u1-proofs-set-identities", + "slug": "proofs-set-identities", + "title": "Proofs of some general identities on sets", + "displayOrder": 4 + }, + { + "id": "cse302-u1-relation-definition", + "slug": "relation-definition", + "title": "Relation: Definition", + "displayOrder": 5 + }, + { + "id": "cse302-u1-types-of-relation", + "slug": "types-of-relation", + "title": "Types of relation", + "displayOrder": 6 + }, + { + "id": "cse302-u1-composition-of-relations", + "slug": "composition-of-relations", + "title": "Composition of relations", + "displayOrder": 7 + }, + { + "id": "cse302-u1-pictorial-representation", + "slug": "pictorial-representation", + "title": "Pictorial representation of relation", + "displayOrder": 8 + }, + { + "id": "cse302-u1-equivalence-relation", + "slug": "equivalence-relation", + "title": "Equivalence relation", + "displayOrder": 9 + }, + { + "id": "cse302-u1-partial-ordering-relation", + "slug": "partial-ordering-relation", + "title": "Partial ordering relation", + "displayOrder": 10 + }, + { + "id": "cse302-u1-job-scheduling", + "slug": "job-scheduling", + "title": "Job-Scheduling problem", + "displayOrder": 11 + }, + { + "id": "cse302-u1-function-definition", + "slug": "function-definition", + "title": "Function: Definition", + "displayOrder": 12 + }, + { + "id": "cse302-u1-type-of-functions", + "slug": "type-of-functions", + "title": "Type of functions: one to one, into and onto function", + "displayOrder": 13 + }, + { + "id": "cse302-u1-inverse-function", + "slug": "inverse-function", + "title": "Inverse function", + "displayOrder": 14 + }, + { + "id": "cse302-u1-composition-of-functions", + "slug": "composition-of-functions", + "title": "Composition of functions", + "displayOrder": 15 + }, + { + "id": "cse302-u1-recursively-defined-functions", + "slug": "recursively-defined-functions", + "title": "Recursively defined functions", + "displayOrder": 16 + }, + { + "id": "cse302-u1-pigeonhole-principle", + "slug": "pigeonhole-principle", + "title": "Pigeonhole principle", + "displayOrder": 17 + }, + { + "id": "cse302-u1-mathematical-induction", + "slug": "mathematical-induction", + "title": "Mathematical induction", + "displayOrder": 18 + }, + { + "id": "cse302-u1-proof-by-contradiction", + "slug": "proof-by-contradiction", + "title": "Proof by contradiction", + "displayOrder": 19 + } + ], + "questionIds": [ + "q1a_nov2022", + "q1b_nov2022", + "q2a_nov2022", + "q2b_nov2022", + "q6b_nov2022", + "q1a_june2023", + "q1b_june2023", + "q2a_june2023", + "q8a_june2023_p1", + "q8a_june2023_p4", + "q1a_dec2023", + "q1b_dec2023", + "q2a_dec2023", + "q2b_dec2023", + "q4b_june2024", + "q5a_june2024", + "q6a_june2024", + "q7b_june2024", + "q1a_dec2024", + "q2b_dec2024", + "q1a_june2025", + "q1b_june2025", + "q2a_june2025", + "q8a_june2025_p4", + "q8a_june2025_p5", + "q1a_dec2025", + "q1b_dec2025", + "q2a_dec2025", + "q2b_dec2025", + "q3a_dec2025", + "q3b_dec2025", + "q5a_dec2025", + "q5b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "cse302-u2", "number": 2, "title": "Algebraic Structures", "hours": 8, "topics": [ - "Algebraic Structures: Definition, Properties", - "Types: Semi Groups, Monoid, Groups, Abelian group", - "Properties of groups", - "Subgroup", - "Cyclic groups", - "Cosets", - "Factor group", - "Permutation groups", - "Normal subgroup", - "Homomorphism and Isomorphism: Homomorphism and isomorphism of Groups, example and standard results", - "Rings and Fields: Definition and standard results" - ] + { + "id": "cse302-u2-algebraic-structures-definition", + "slug": "algebraic-structures-definition", + "title": "Algebraic Structures: Definition", + "displayOrder": 1 + }, + { + "id": "cse302-u2-properties", + "slug": "algebraic-structures-properties", + "title": "Properties of Algebraic Structures", + "displayOrder": 2 + }, + { + "id": "cse302-u2-semi-groups-monoid", + "slug": "semi-groups-monoid", + "title": "Types: Semi Groups, Monoid", + "displayOrder": 3 + }, + { + "id": "cse302-u2-groups-abelian-group", + "slug": "groups-abelian-group", + "title": "Groups, Abelian group", + "displayOrder": 4 + }, + { + "id": "cse302-u2-properties-of-groups", + "slug": "properties-of-groups", + "title": "Properties of groups", + "displayOrder": 5 + }, + { + "id": "cse302-u2-subgroup", + "slug": "subgroup", + "title": "Subgroup", + "displayOrder": 6 + }, + { + "id": "cse302-u2-cyclic-groups", + "slug": "cyclic-groups", + "title": "Cyclic groups", + "displayOrder": 7 + }, + { + "id": "cse302-u2-cosets", + "slug": "cosets", + "title": "Cosets", + "displayOrder": 8 + }, + { + "id": "cse302-u2-factor-group", + "slug": "factor-group", + "title": "Factor group", + "displayOrder": 9 + }, + { + "id": "cse302-u2-permutation-groups", + "slug": "permutation-groups", + "title": "Permutation groups", + "displayOrder": 10 + }, + { + "id": "cse302-u2-normal-subgroup", + "slug": "normal-subgroup", + "title": "Normal subgroup", + "displayOrder": 11 + }, + { + "id": "cse302-u2-homomorphism-isomorphism", + "slug": "homomorphism-isomorphism", + "title": "Homomorphism and Isomorphism of Groups", + "displayOrder": 12 + }, + { + "id": "cse302-u2-homomorphism-examples", + "slug": "homomorphism-examples", + "title": "Homomorphism and Isomorphism: example and standard results", + "displayOrder": 13 + }, + { + "id": "cse302-u2-rings-definition", + "slug": "rings-definition", + "title": "Rings: Definition", + "displayOrder": 14 + }, + { + "id": "cse302-u2-rings-standard-results", + "slug": "rings-standard-results", + "title": "Rings: standard results", + "displayOrder": 15 + }, + { + "id": "cse302-u2-fields-definition", + "slug": "fields-definition", + "title": "Fields: Definition", + "displayOrder": 16 + }, + { + "id": "cse302-u2-fields-standard-results", + "slug": "fields-standard-results", + "title": "Fields: standard results", + "displayOrder": 17 + } + ], + "questionIds": [ + "q4a_nov2022", + "q4b_nov2022", + "q2b_june2023", + "q3a_june2023", + "q8a_june2023_p2", + "q3a_dec2023", + "q3b_dec2023", + "q1b_june2024", + "q7a_june2024", + "q8a_june2024", + "q8b_june2024", + "q1b_dec2024", + "q2a_dec2024", + "q8a_dec2024", + "q8b_dec2024", + "q3a_june2025", + "q3b_june2025", + "q8a_june2025_p3", + "q6a_dec2025", + "q6b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "cse302-u3", "number": 3, "title": "Propositional Logic", "hours": 8, "topics": [ - "Propositional Logic: Proposition", - "First order logic", - "Basic logical operation", - "Truth tables", - "Tautologies", - "Contradictions", - "Algebra of Proposition", - "Logical implications", - "Logical equivalence", - "Predicates", - "Normal Forms", - "Universal and existential quantifiers", - "Finite State Machine: Introduction to finite state machine", - "Finite state machines as models of physical system equivalence machines", - "Finite state machines as language recognizers" - ] + { + "id": "cse302-u3-proposition", + "slug": "proposition", + "title": "Propositional Logic: Proposition", + "displayOrder": 1 + }, + { + "id": "cse302-u3-first-order-logic", + "slug": "first-order-logic", + "title": "First order logic", + "displayOrder": 2 + }, + { + "id": "cse302-u3-basic-logical-operation", + "slug": "basic-logical-operation", + "title": "Basic logical operation", + "displayOrder": 3 + }, + { + "id": "cse302-u3-truth-tables", + "slug": "truth-tables", + "title": "Truth tables", + "displayOrder": 4 + }, + { + "id": "cse302-u3-tautologies", + "slug": "tautologies", + "title": "Tautologies", + "displayOrder": 5 + }, + { + "id": "cse302-u3-contradictions", + "slug": "contradictions", + "title": "Contradictions", + "displayOrder": 6 + }, + { + "id": "cse302-u3-algebra-of-proposition", + "slug": "algebra-of-proposition", + "title": "Algebra of Proposition", + "displayOrder": 7 + }, + { + "id": "cse302-u3-logical-implications", + "slug": "logical-implications", + "title": "Logical implications", + "displayOrder": 8 + }, + { + "id": "cse302-u3-logical-equivalence", + "slug": "logical-equivalence", + "title": "Logical equivalence", + "displayOrder": 9 + }, + { + "id": "cse302-u3-predicates", + "slug": "predicates", + "title": "Predicates", + "displayOrder": 10 + }, + { + "id": "cse302-u3-normal-forms", + "slug": "normal-forms", + "title": "Normal Forms", + "displayOrder": 11 + }, + { + "id": "cse302-u3-universal-existential-quantifiers", + "slug": "universal-existential-quantifiers", + "title": "Universal and existential quantifiers", + "displayOrder": 12 + }, + { + "id": "cse302-u3-fsm-introduction", + "slug": "fsm-introduction", + "title": "Finite State Machine: Introduction", + "displayOrder": 13 + }, + { + "id": "cse302-u3-fsm-models", + "slug": "fsm-models", + "title": "Finite state machines as models of physical system equivalence machines", + "displayOrder": 14 + }, + { + "id": "cse302-u3-fsm-language-recognizers", + "slug": "fsm-language-recognizers", + "title": "Finite state machines as language recognizers", + "displayOrder": 15 + } + ], + "questionIds": [ + "q5a_nov2022", + "q5b_nov2022", + "q6a_nov2022", + "q4a_june2023", + "q4b_june2023", + "q5a_june2023", + "q8a_june2023_p3", + "q4a_dec2023", + "q4b_dec2023", + "q5a_dec2023", + "q5b_dec2023", + "q3a_june2024", + "q6b_june2024", + "q7b_june2024", + "q2b_dec2024", + "q6b_dec2024", + "q7b_dec2024", + "q4a_june2025", + "q4b_june2025", + "q8a_june2025_p1", + "q4a_dec2025", + "q4b_dec2025", + "q7a_dec2025", + "q7b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "cse302-u4", "number": 4, "title": "Graph Theory", "hours": 8, "topics": [ - "Introduction: Basic terminology of graphs", - "Planar graphs", - "Multigraphs and weighted graphs", - "Connectivity & Paths: Isomorphic graphs, Paths, Cycles and connectivity", - "Shortest path in weighted graph", - "Advanced Paths: Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits", - "Coloring & Isomorphism: Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs" - ] + { + "id": "cse302-u4-basic-terminology", + "slug": "basic-terminology", + "title": "Basic terminology of graphs", + "displayOrder": 1 + }, + { + "id": "cse302-u4-planar-graphs", + "slug": "planar-graphs", + "title": "Planar graphs", + "displayOrder": 2 + }, + { + "id": "cse302-u4-multigraphs", + "slug": "multigraphs", + "title": "Multigraphs", + "displayOrder": 3 + }, + { + "id": "cse302-u4-weighted-graphs", + "slug": "weighted-graphs", + "title": "Weighted graphs", + "displayOrder": 4 + }, + { + "id": "cse302-u4-isomorphic-graphs", + "slug": "isomorphic-graphs", + "title": "Isomorphic graphs", + "displayOrder": 5 + }, + { + "id": "cse302-u4-paths-cycles-connectivity", + "slug": "paths-cycles-connectivity", + "title": "Paths, Cycles and connectivity", + "displayOrder": 6 + }, + { + "id": "cse302-u4-shortest-path", + "slug": "shortest-path", + "title": "Shortest path in weighted graph", + "displayOrder": 7 + }, + { + "id": "cse302-u4-eulerian-paths-circuits", + "slug": "eulerian-paths-circuits", + "title": "Introduction to Eulerian paths and circuits", + "displayOrder": 8 + }, + { + "id": "cse302-u4-hamiltonian-paths-circuits", + "slug": "hamiltonian-paths-circuits", + "title": "Hamiltonian paths and circuits", + "displayOrder": 9 + }, + { + "id": "cse302-u4-graph-coloring", + "slug": "graph-coloring", + "title": "Graph coloring", + "displayOrder": 10 + }, + { + "id": "cse302-u4-chromatic-number", + "slug": "chromatic-number", + "title": "Chromatic number", + "displayOrder": 11 + }, + { + "id": "cse302-u4-isomorphism-homomorphism-graphs", + "slug": "isomorphism-homomorphism-graphs", + "title": "Isomorphism and Homomorphism of graphs", + "displayOrder": 12 + } + ], + "questionIds": [ + "q7a_nov2022", + "q7b_nov2022", + "q8a_nov2022", + "q8b_nov2022", + "q5b_june2023", + "q6a_june2023", + "q6b_june2023", + "q6a_dec2023", + "q6b_dec2023", + "q1a_june2024", + "q3b_june2024", + "q4a_june2024", + "q3a_dec2024", + "q3b_dec2024", + "q4a_dec2024", + "q5b_dec2024", + "q5a_june2025", + "q5b_june2025", + "q6a_june2025", + "q8a_dec2025", + "q8b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "cse302-u5", "number": 5, "title": "Posets, Lattices, Combinatorics, Recurrence Relations", "hours": 8, "topics": [ - "Posets, Hasse Diagram and Lattices: Introduction, ordered set", - "Hasse diagram of partially ordered set", - "Isomorphic ordered set, well ordered set", - "Properties of Lattices, bounded and complemented lattices", - "Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multinomial Coefficients", - "Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms", - "Linear recurrence relations with constant coefficients", - "Homogeneous solutions, Particular solutions, Total solutions", - "Generating functions, Solution by method of generating functions" - ] + { + "id": "cse302-u5-posets-introduction", + "slug": "posets-introduction", + "title": "Posets: Introduction", + "displayOrder": 1 + }, + { + "id": "cse302-u5-ordered-set", + "slug": "ordered-set", + "title": "Ordered set", + "displayOrder": 2 + }, + { + "id": "cse302-u5-hasse-diagram", + "slug": "hasse-diagram", + "title": "Hasse diagram of partially ordered set", + "displayOrder": 3 + }, + { + "id": "cse302-u5-isomorphic-ordered-set", + "slug": "isomorphic-ordered-set", + "title": "Isomorphic ordered set", + "displayOrder": 4 + }, + { + "id": "cse302-u5-well-ordered-set", + "slug": "well-ordered-set", + "title": "Well ordered set", + "displayOrder": 5 + }, + { + "id": "cse302-u5-properties-of-lattices", + "slug": "properties-of-lattices", + "title": "Properties of Lattices", + "displayOrder": 6 + }, + { + "id": "cse302-u5-bounded-complemented-lattices", + "slug": "bounded-complemented-lattices", + "title": "Bounded and complemented lattices", + "displayOrder": 7 + }, + { + "id": "cse302-u5-combinatorics-introduction", + "slug": "combinatorics-introduction", + "title": "Combinatorics: Introduction", + "displayOrder": 8 + }, + { + "id": "cse302-u5-permutation-combination", + "slug": "permutation-combination", + "title": "Permutation and combination", + "displayOrder": 9 + }, + { + "id": "cse302-u5-binomial-theorem", + "slug": "binomial-theorem", + "title": "Binomial Theorem", + "displayOrder": 10 + }, + { + "id": "cse302-u5-multinomial-coefficients", + "slug": "multinomial-coefficients", + "title": "Multinomial Coefficients", + "displayOrder": 11 + }, + { + "id": "cse302-u5-recurrence-relation-introduction", + "slug": "recurrence-relation-introduction", + "title": "Introduction to Recurrence Relation", + "displayOrder": 12 + }, + { + "id": "cse302-u5-recursive-algorithms", + "slug": "recursive-algorithms", + "title": "Recursive algorithms", + "displayOrder": 13 + }, + { + "id": "cse302-u5-linear-recurrence-relations", + "slug": "linear-recurrence-relations", + "title": "Linear recurrence relations with constant coefficients", + "displayOrder": 14 + }, + { + "id": "cse302-u5-homogeneous-solutions", + "slug": "homogeneous-solutions", + "title": "Homogeneous solutions", + "displayOrder": 15 + }, + { + "id": "cse302-u5-particular-solutions", + "slug": "particular-solutions", + "title": "Particular solutions", + "displayOrder": 16 + }, + { + "id": "cse302-u5-total-solutions", + "slug": "total-solutions", + "title": "Total solutions", + "displayOrder": 17 + }, + { + "id": "cse302-u5-generating-functions", + "slug": "generating-functions", + "title": "Generating functions", + "displayOrder": 18 + }, + { + "id": "cse302-u5-solution-by-generating-functions", + "slug": "solution-by-generating-functions", + "title": "Solution by method of generating functions", + "displayOrder": 19 + } + ], + "questionIds": [ + "q3a_nov2022", + "q3b_nov2022", + "q7a_june2023", + "q7b_june2023", + "q7a_dec2023", + "q7b_dec2023", + "q8a_dec2023", + "q8b_dec2023", + "q2a_june2024", + "q2b_june2024", + "q5b_june2024", + "q7a_june2024", + "q2a_dec2024", + "q3b_dec2024", + "q4b_dec2024", + "q5a_dec2024", + "q6a_dec2024", + "q7a_dec2024", + "q2b_june2025", + "q6b_june2025", + "q7a_june2025", + "q7b_june2025", + "q8a_june2025_p2" + ], + "predictedQuestionIds": [] } ] } diff --git a/content/rgpv/cse/semester-4/bt-401/pyqs.json b/content/rgpv/cse/semester-4/bt-401/pyqs.json index 135dcfe..100fa74 100644 --- a/content/rgpv/cse/semester-4/bt-401/pyqs.json +++ b/content/rgpv/cse/semester-4/bt-401/pyqs.json @@ -1,9 +1,1020 @@ { "subject": { - "id": "bt-401-cse", + "id": "bt-401", "code": "BT-401", "name": "Mathematics-III", - "title": "BT-401 - Mathematics-III" + "title": "BT-401 (GS) – Mathematics-III", + "semester": "IV", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Use Newton's formula for interpolation to find the net premium at the age 25 from the given table.", + "unit": "Unit 1", + "type": "interpolation" + }, + { + "id": "q1b", + "label": "b)", + "text": "Using Newton-Raphson's method find the real root of x⁴ - x - 10 = 0.", + "unit": "Unit 1", + "type": "root-finding" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Solve the simultaneous linear equations using Crout's method: x₁+x₂+x₃=1, 3x₁+x₂-3x₃=5, x₁-2x₂-5x₃=10.", + "unit": "Unit 2", + "type": "linear-equations" + }, + { + "id": "q2b", + "label": "b)", + "text": "Evaluate ∫₀¹ log x cos x dx by (i) Trapezoidal rule (ii) Simpson 3/8 rule.", + "unit": "Unit 2", + "type": "numerical-integration" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Find y(0.1) for differential equation dy/dx = x²y - 1, y(0) = 1 using Taylor's series method.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q3b", + "label": "b)", + "text": "Solve xy'' + y' + xy = 0, where y(0) = 1, y'(0) = 0, for x = 0 to x = 1.5.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Find Laplace transform of piecewise function f(t) = sin t for 0 < t < 2π, and 0 for 2π < t.", + "unit": "Unit 4", + "type": "laplace" + }, + { + "id": "q4b", + "label": "b)", + "text": "Find the Fourier series for periodic extension of piecewise function f(t) = sin t for 0 ≤ t ≤ π, and 0 for π ≤ t ≤ 2π.", + "unit": "Unit 4", + "type": "fourier" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "If m balls are distributed among a men and b women, show that the probability that the number of balls received by men is odd is (1/2)[((b+a)^m - (b-a)^m)/(b+a)^m].", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q5b", + "label": "b)", + "text": "Two independent random variable X and Y are both normally distributed with means 1 and 2 and standard deviations 3 and 4 respectively. If Z = X - Y, write the pdf of Z and find P[Z+1 ≤ 0].", + "unit": "Unit 5", + "type": "probability" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Prove that Δⁿ 0^(n+1) = [n(n+1)/2] Δⁿ 0^n.", + "unit": "Unit 1", + "type": "finite-differences" + }, + { + "id": "q6b", + "label": "b)", + "text": "Given log x values for x = 310, 320, 330, 340, 350, 360, find the value of log 3375.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Use Runge-Kutta method to approximate y when x=0.1 and x=0.2, given x=0 when y=1 and dy/dx=x+y.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q7b", + "label": "b)", + "text": "Use Milne's method to solve dy/dx = x + y with initial condition y(0)=1, from x=0.20 to x=0.30.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Prove that for normal distribution, QD:MD:SD :: 10:12:15.", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q8b", + "label": "b)", + "text": "Prove that Δⁿ sin(ax+b) = (2 sin(ah/2))^n sin[ax+b+n((ah+π)/2)].", + "unit": "Unit 1", + "type": "finite-differences" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Find the real root of the equation x³ - 3x - 5 = 0 correct to four places of decimals by Newton Raphson method.", + "unit": "Unit 1", + "type": "root-finding" + }, + { + "id": "q1b", + "label": "b)", + "text": "Evaluate Δ⁶(ax-1)(bx²-1)(cx³-1); h=1.", + "unit": "Unit 1", + "type": "finite-differences" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Using Newton's divided difference formula, find f(8) and f(15) from the given table.", + "unit": "Unit 1", + "type": "interpolation" + }, + { + "id": "q2b", + "label": "b)", + "text": "Find the real root of the equation xe^x - 3 = 0 correct to three decimal places by Regula Falsi method.", + "unit": "Unit 1", + "type": "root-finding" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Use Simpson's 1/3 and 3/8 rule to evaluate ∫₀¹ dx/(1+x²). Hence obtain the approximate value of π.", + "unit": "Unit 2", + "type": "numerical-integration" + }, + { + "id": "q3b", + "label": "b)", + "text": "Compute the value of ∫₀·₂¹·⁴ (sin x - log_e x + e^x) dx by trapezoidal rule.", + "unit": "Unit 2", + "type": "numerical-integration" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Solve the following system by Gauss Seidel iteration method: 27x+6y-z=85, 6x+15y+2z=72, x+y+54z=110.", + "unit": "Unit 2", + "type": "linear-equations" + }, + { + "id": "q4b", + "label": "b)", + "text": "Use Simpson's rule to find approximate value of ∫₁² dx/x.", + "unit": "Unit 2", + "type": "numerical-integration" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Use Euler's method compute the solution of dy/dx = y² - x² with y(0)=1 at x=0.1.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q5b", + "label": "b)", + "text": "Use Euler's Modified method to solve dy/dx = x + y, y(0)=1, h=0.2 compute y(1).", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Use Laplace transform to solve the IVP: y' + 2y = 26 sin 3t, y(0) = 3.", + "unit": "Unit 4", + "type": "laplace" + }, + { + "id": "q6b", + "label": "b)", + "text": "Evaluate L(t cos at).", + "unit": "Unit 4", + "type": "laplace" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Evaluate L⁻¹[1/(1+s)³].", + "unit": "Unit 4", + "type": "inverse-laplace" + }, + { + "id": "q7b", + "label": "b)", + "text": "Evaluate L{t² e^(-3t)}.", + "unit": "Unit 4", + "type": "laplace" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Find mean of Poisson distribution.", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q8b", + "label": "b)", + "text": "Write Short note on Exponential Distribution.", + "unit": "Unit 5", + "type": "probability" + } + ] + } + ] + }, + { + "exam": "November 2023", + "year": 2023, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Evaluate √12 to four decimal places by Newton Raphson Method.", + "unit": "Unit 1", + "type": "root-finding" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is the rate of convergence of bisection method?", + "unit": "Unit 1", + "type": "root-finding" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Prove the relations between finite difference operators Δ, δ, and ∇.", + "unit": "Unit 1", + "type": "finite-differences" + }, + { + "id": "q2b", + "label": "b)", + "text": "Construct a backward difference table for y = log x and find values of ∇³log 40 and ∇⁴log 50.", + "unit": "Unit 1", + "type": "finite-differences" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Using Lagrange's Method find f(x) as a polynomial in x from the given data.", + "unit": "Unit 1", + "type": "interpolation" + }, + { + "id": "q3b", + "label": "b)", + "text": "Using Newton's divided difference formula, calculate the value of f(6) from the given data.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Find f'(1.1) and f''(1.1) from the given table.", + "unit": "Unit 2", + "type": "numerical-differentiation" + }, + { + "id": "q4b", + "label": "b)", + "text": "Find missing values in the given table.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Find ∫₀⁶ e^x/(1+x) dx approximately using Simpson's 3/8th rule.", + "unit": "Unit 2", + "type": "numerical-integration" + }, + { + "id": "q5b", + "label": "b)", + "text": "Solve dy/dx = 1 - y with y(0)=0 using Euler's modified method at x=0.1,0.2,0.3.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Using Lagrange's interpolation formula to fit a polynomial to the given data.", + "unit": "Unit 1", + "type": "interpolation" + }, + { + "id": "q6b", + "label": "b)", + "text": "Using Regula-Falsi method, find the real root of x log₁₀ x = 1.2 correct to four decimal places.", + "unit": "Unit 1", + "type": "root-finding" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Solve dy/dx = x + y² by Runge-Kutta method of fourth order for y at x=0.2, given y=1 at x=0, h=0.1.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q7b", + "label": "b)", + "text": "Evaluate L⁻¹[(s+7)/(s²+4s+8)].", + "unit": "Unit 4", + "type": "inverse-laplace" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Find the inverse Laplace transform of (s+4)/[s(s-1)(s²+4)].", + "unit": "Unit 4", + "type": "inverse-laplace" + }, + { + "id": "q8b", + "label": "b)", + "text": "Prove that L{f(t)/t} = ∫_s^∞ F(s) ds and hence evaluate (e^(at) - cos bt)/t.", + "unit": "Unit 4", + "type": "laplace" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "If f(x)=x³-x²+4x-4=0, find next approximation from x=2 correct up to 2 decimal places.", + "unit": "Unit 1", + "type": "root-finding" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is the rate of convergence of Newton Raphson method?", + "unit": "Unit 1", + "type": "root-finding" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Find Δe^(ax), Δ²e^x, Δlog x.", + "unit": "Unit 1", + "type": "finite-differences" + }, + { + "id": "q2b", + "label": "b)", + "text": "Prove that f(4) = f(3) + Δf(2) + Δ²f(1) + Δ³f(1) taking 1 as the interval of differencing.", + "unit": "Unit 1", + "type": "finite-differences" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Using Simpson's 3/8 rule to solve the integral ∫₄⁵·² log_e x dx.", + "unit": "Unit 2", + "type": "numerical-integration" + }, + { + "id": "q3b", + "label": "b)", + "text": "Find f(0.18) from the given table using Newton's Forward interpolation formula.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Apply Gauss Elimination method to solve: 2x-y+3z=9, x+y+z=6, x-y+z=2.", + "unit": "Unit 2", + "type": "linear-equations" + }, + { + "id": "q4b", + "label": "b)", + "text": "Find missing values in the given table.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Use Runge-Kutta method to approximate y at x=0.1,0.2, given y=1 at x=0 and dy/dx=x+y.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q5b", + "label": "b)", + "text": "Use Milne's method to solve dy/dx=x+y with y(0)=1 from x=0.20 to x=0.30.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Find the value of f(5) from the given table using interpolation.", + "unit": "Unit 1", + "type": "interpolation" + }, + { + "id": "q6b", + "label": "b)", + "text": "Find the real root of x log₁₀ x - 1.2 = 0 correct to five decimal places by Regula Falsi Method.", + "unit": "Unit 1", + "type": "root-finding" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Find the inverse Laplace transform of (2s+1)/[s(s-1)].", + "unit": "Unit 4", + "type": "inverse-laplace" + }, + { + "id": "q7b", + "label": "b)", + "text": "State convolution theorem and evaluate L⁻¹[s/{(s²+1)(s²+4)}].", + "unit": "Unit 4", + "type": "inverse-laplace" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "A binomial variable X satisfies 9P(X=4)=P(X=2) when n=6. Find p and P(X=1).", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q8b", + "label": "b)", + "text": "Find the percentage of measurements between 54.8\" and 68.8\" for N(65.5, 6.2²).", + "unit": "Unit 5", + "type": "probability" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Using Newton-Raphson method find the real root of 3x = cos x + 1 correct to five decimal places.", + "unit": "Unit 1", + "type": "root-finding" + }, + { + "id": "q1b", + "label": "b)", + "text": "Find f(g) from the given table.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Apply Simpson's 3/8 rule to evaluate ∫₁·₀¹·³ √x dx for six digits.", + "unit": "Unit 2", + "type": "numerical-integration" + }, + { + "id": "q2b", + "label": "b)", + "text": "Solve the system using Gauss-Seidel method: 27x+6y-z=85, 6x+15y+2z=72, x+y+54z=110.", + "unit": "Unit 2", + "type": "linear-equations" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Using Runge-Kutta 4th order solve dy/dx=(y²-x²)/(y²+x²), y(0)=1 at x=0.4, step 0.2.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q3b", + "label": "b)", + "text": "Find y(2.2) using Euler's method for dy/dx = -xy² where y(2)=1.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Find the Inverse Laplace transform of 1/[p³(p²+a²)].", + "unit": "Unit 4", + "type": "inverse-laplace" + }, + { + "id": "q4b", + "label": "b)", + "text": "Using Laplace transform solve y'''+2y''-y'-2y=0 with y(0)=1, y'(0)=2, y''(0)=2.", + "unit": "Unit 4", + "type": "laplace" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Fit a Poisson distribution to the given data.", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q5b", + "label": "b)", + "text": "Calculate the mean and standard deviation of Binomial Distribution.", + "unit": "Unit 5", + "type": "probability" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Find dy/dx at x=1.5 from the given table.", + "unit": "Unit 2", + "type": "numerical-differentiation" + }, + { + "id": "q6b", + "label": "b)", + "text": "Evaluate ∫₀^∞ e^(-t)·sin t / t dt.", + "unit": "Unit 4", + "type": "laplace" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Show that Newton Raphson method is quadratic convergent.", + "unit": "Unit 1", + "type": "root-finding" + }, + { + "id": "q7b", + "label": "b)", + "text": "Derive Newton forward interpolation formula and estimate f(1.25) from the given table.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Solve the system using Gauss elimination: 3x+y-z=3, 2x-8y+z=-5, x-2y+9z=8.", + "unit": "Unit 2", + "type": "linear-equations" + }, + { + "id": "q8b", + "label": "b)", + "text": "Find Fourier sine transform of 1/x.", + "unit": "Unit 4", + "type": "fourier" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Find the real root of f(x)=x³-x-10 by Newton Raphson method correct up to 4 decimal places.", + "unit": "Unit 1", + "type": "root-finding" + }, + { + "id": "q1b", + "label": "b)", + "text": "Find solution y(301) using Newton Divided difference interpolation formula.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Evaluate the integral using Simpson's 3/8 rule from the given table.", + "unit": "Unit 2", + "type": "numerical-integration" + }, + { + "id": "q2b", + "label": "b)", + "text": "Solve the system by Gauss elimination: x+y+z=4, x+4y+3z=8, x+6y+2z=6.", + "unit": "Unit 2", + "type": "linear-equations" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Using modified Euler's method, find y at x=0.3 given dy/dx=x+y, y=1 when x=0.", + "unit": "Unit 3", + "type": "ode" + }, + { + "id": "q3b", + "label": "b)", + "text": "Find y(1.05) using 4th order Runge-Kutta for dy/dx=x²+y², y(1)=1.2.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Find the inverse Laplace transform of F(s)=1/[(s+1)(s²+1)].", + "unit": "Unit 4", + "type": "inverse-laplace" + }, + { + "id": "q4b", + "label": "b)", + "text": "Find Laplace transform of y(t) satisfying y''-2y'-y=1, y(0)=-1, y'(0)=1.", + "unit": "Unit 4", + "type": "laplace" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Find probability that car speed >100 km/hr for N(90,10²).", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q5b", + "label": "b)", + "text": "Find binomial distribution with mean 100 and SD 5.", + "unit": "Unit 5", + "type": "probability" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Find mean and SD of normal distribution where 10.03% items under 25 kg and 89.97% under 70 kg.", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q6b", + "label": "b)", + "text": "Find solution using Lagrange's Interpolation formula.", + "unit": "Unit 1", + "type": "interpolation" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Find L(t² e^(-t) cosh 2t) and L(e^(3t) sin² 4t).", + "unit": "Unit 4", + "type": "laplace" + }, + { + "id": "q7b", + "label": "b)", + "text": "Using Milne's method find y(4.4) given 5xy+y²-2=0 and four starting values.", + "unit": "Unit 3", + "type": "ode" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Find mean of Poisson distribution.", + "unit": "Unit 5", + "type": "probability" + }, + { + "id": "q8b", + "label": "b)", + "text": "Write short note on Exponential distribution.", + "unit": "Unit 5", + "type": "probability" + } + ] + } + ] + } + ] } diff --git a/content/rgpv/cse/semester-4/bt-401/syllabus.json b/content/rgpv/cse/semester-4/bt-401/syllabus.json index ffae265..e79c00d 100644 --- a/content/rgpv/cse/semester-4/bt-401/syllabus.json +++ b/content/rgpv/cse/semester-4/bt-401/syllabus.json @@ -3,75 +3,398 @@ "id": "bt-401", "code": "BT-401", "name": "Mathematics-III", - "title": "BT-401 - Mathematics-III", - "semester": "IV" + "title": "BT-401 – Mathematics-III", + "university": "Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal", + "scheme": "New Scheme Based On AICTE Flexible Curricula", + "semester": "IV", + "branch": "CSE-Computer Science Engineering" }, "modules": [ { - "id": "module-1", + "id": "bt401-m1", "number": 1, "title": "Numerical Methods – 1", "hours": 8, "topics": [ - "Solution of polynomial and transcendental equations – Bisection method, Newton-Raphson method and Regula-Falsi method", - "Finite differences", - "Relation between operators", - "Interpolation using Newton’s forward and backward difference formulae", - "Interpolation with unequal intervals: Newton’s divided difference and Lagrange’s formulae" - ] + { + "id": "bt401-m1-bisection", + "slug": "bisection-method", + "title": "Bisection method", + "displayOrder": 1 + }, + { + "id": "bt401-m1-newton-raphson", + "slug": "newton-raphson-method", + "title": "Newton-Raphson method", + "displayOrder": 2 + }, + { + "id": "bt401-m1-regula-falsi", + "slug": "regula-falsi-method", + "title": "Regula-Falsi method", + "displayOrder": 3 + }, + { + "id": "bt401-m1-finite-differences", + "slug": "finite-differences", + "title": "Finite differences, Relation between operators", + "displayOrder": 4 + }, + { + "id": "bt401-m1-newton-forward-backward", + "slug": "newton-forward-backward", + "title": "Interpolation using Newton's forward and backward difference formulae", + "displayOrder": 5 + }, + { + "id": "bt401-m1-newton-divided-difference", + "slug": "newton-divided-difference", + "title": "Newton's divided difference formula", + "displayOrder": 6 + }, + { + "id": "bt401-m1-lagrange", + "slug": "lagrange-formula", + "title": "Lagrange's interpolation formula", + "displayOrder": 7 + } + ], + "questionIds": [ + "bt401_m1_june2025_q1", + "bt401_m1_june2025_q2", + "bt401_m1_june2025_q3", + "bt401_m1_dec2024_q4", + "bt401_m1_dec2024_q5", + "bt401_m1_dec2024_q6", + "bt401_m1_dec2024_q7", + "bt401_m1_june2024_q8", + "bt401_m1_june2024_q9", + "bt401_m1_june2024_q10", + "bt401_m1_june2024_q11", + "bt401_m1_june2024_q12", + "bt401_m1_june2024_q13", + "bt401_m1_june2024_q14", + "bt401_m1_nov2023_q15", + "bt401_m1_nov2023_q16", + "bt401_m1_nov2023_q17", + "bt401_m1_nov2023_q18", + "bt401_m1_nov2023_q19", + "bt401_m1_nov2023_q20", + "bt401_m1_nov2023_q21", + "bt401_m1_nov2023_q22", + "bt401_m1_nov2023_q23", + "bt401_m1_june2023_q24", + "bt401_m1_june2023_q25", + "bt401_m1_june2023_q26", + "bt401_m1_june2023_q27", + "bt401_m1_nov2022_q28", + "bt401_m1_nov2022_q29", + "bt401_m1_nov2022_q30", + "bt401_m1_nov2022_q31", + "bt401_m1_nov2022_q32" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "bt401-m2", "number": 2, "title": "Numerical Methods – 2", "hours": 6, "topics": [ - "Numerical Differentiation", - "Numerical integration: Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules", - "Solution of Simultaneous Linear Algebraic Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and Relaxation method" - ] + { + "id": "bt401-m2-numerical-differentiation", + "slug": "numerical-differentiation", + "title": "Numerical Differentiation", + "displayOrder": 1 + }, + { + "id": "bt401-m2-trapezoidal", + "slug": "trapezoidal-rule", + "title": "Numerical integration: Trapezoidal rule", + "displayOrder": 2 + }, + { + "id": "bt401-m2-simpson", + "slug": "simpson-rules", + "title": "Simpson's 1/3rd and 3/8 rules", + "displayOrder": 3 + }, + { + "id": "bt401-m2-gauss-elimination", + "slug": "gauss-elimination", + "title": "Gauss's Elimination method", + "displayOrder": 4 + }, + { + "id": "bt401-m2-gauss-jordan", + "slug": "gauss-jordan", + "title": "Gauss's Jordan method", + "displayOrder": 5 + }, + { + "id": "bt401-m2-crout", + "slug": "crout-method", + "title": "Crout's method", + "displayOrder": 6 + }, + { + "id": "bt401-m2-jacobi", + "slug": "jacobi-method", + "title": "Jacobi's method", + "displayOrder": 7 + }, + { + "id": "bt401-m2-gauss-seidal", + "slug": "gauss-seidal", + "title": "Gauss-Seidal method", + "displayOrder": 8 + }, + { + "id": "bt401-m2-relaxation", + "slug": "relaxation-method", + "title": "Relaxation method", + "displayOrder": 9 + } + ], + "questionIds": [ + "bt401_m2_june2025_q1", + "bt401_m2_june2025_q2", + "bt401_m2_dec2024_q3", + "bt401_m2_dec2024_q4", + "bt401_m2_dec2024_q5", + "bt401_m2_dec2024_q6", + "bt401_m2_june2024_q7", + "bt401_m2_june2024_q8", + "bt401_m2_nov2023_q9", + "bt401_m2_nov2023_q10", + "bt401_m2_june2023_q4", + "bt401_m2_june2023_q11", + "bt401_m2_june2023_q12", + "bt401_m2_june2023_q13", + "bt401_m2_nov2022_q14", + "bt401_m2_nov2022_q15" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "bt401-m3", "number": 3, "title": "Numerical Methods – 3", "hours": 10, "topics": [ - "Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods", - "RungeKutta method of fourth order for solving first and second order equations", - "Milne’s and Adam’s predicator-corrector methods", - "Partial differential equations: Finite difference solution two dimensional Laplace equation and Poission equation", - "Implicit and explicit methods for one dimensional heat equation (BenderSchmidt and Crank-Nicholson methods)", - "Finite difference explicit method for wave equation" - ] + { + "id": "bt401-m3-taylor-series", + "slug": "taylor-series-method", + "title": "Taylor's series method", + "displayOrder": 1 + }, + { + "id": "bt401-m3-euler", + "slug": "euler-method", + "title": "Euler method", + "displayOrder": 2 + }, + { + "id": "bt401-m3-modified-euler", + "slug": "modified-euler-method", + "title": "Modified Euler's method", + "displayOrder": 3 + }, + { + "id": "bt401-m3-runge-kutta", + "slug": "runge-kutta-method", + "title": "Runge-Kutta method of fourth order for first and second order equations", + "displayOrder": 4 + }, + { + "id": "bt401-m3-milne", + "slug": "milne-method", + "title": "Milne's predictor-corrector method", + "displayOrder": 5 + }, + { + "id": "bt401-m3-adams", + "slug": "adams-method", + "title": "Adam's predictor-corrector method", + "displayOrder": 6 + }, + { + "id": "bt401-m3-laplace-poisson", + "slug": "laplace-poisson-fde", + "title": "Finite difference solution of two dimensional Laplace and Poisson equations", + "displayOrder": 7 + }, + { + "id": "bt401-m3-heat-equation", + "slug": "heat-equation-methods", + "title": "Bender-Schmidt and Crank-Nicholson methods for one dimensional heat equation", + "displayOrder": 8 + }, + { + "id": "bt401-m3-wave-equation", + "slug": "wave-equation-fde", + "title": "Finite difference explicit method for wave equation", + "displayOrder": 9 + } + ], + "questionIds": [ + "bt401_m3_june2025_q1", + "bt401_m3_june2025_q2", + "bt401_m3_june2025_q3", + "bt401_m3_dec2024_q4", + "bt401_m3_dec2024_q5", + "bt401_m3_june2024_q6", + "bt401_m3_june2024_q7", + "bt401_m3_nov2023_q8", + "bt401_m3_nov2023_q9", + "bt401_m3_june2023_q10", + "bt401_m3_june2023_q11", + "bt401_m3_nov2022_q6", + "bt401_m3_nov2022_q7", + "bt401_m3_nov2022_q12", + "bt401_m3_nov2022_q13" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "bt401-m4", "number": 4, "title": "Transform Calculus", "hours": 8, "topics": [ - "Laplace Transform", - "Properties of Laplace Transform", - "Laplace transform of periodic functions", - "Finding inverse Laplace transform by different methods", - "Convolution theorem", - "Evaluation of integrals by Laplace transform", - "Solving ODEs by Laplace Transform method", - "Fourier transforms" - ] + { + "id": "bt401-m4-laplace-transform", + "slug": "laplace-transform", + "title": "Laplace Transform", + "displayOrder": 1 + }, + { + "id": "bt401-m4-laplace-properties", + "slug": "laplace-properties", + "title": "Properties of Laplace Transform", + "displayOrder": 2 + }, + { + "id": "bt401-m4-laplace-periodic", + "slug": "laplace-periodic", + "title": "Laplace transform of periodic functions", + "displayOrder": 3 + }, + { + "id": "bt401-m4-inverse-laplace", + "slug": "inverse-laplace", + "title": "Finding inverse Laplace transform by different methods", + "displayOrder": 4 + }, + { + "id": "bt401-m4-convolution", + "slug": "convolution-theorem", + "title": "Convolution theorem", + "displayOrder": 5 + }, + { + "id": "bt401-m4-laplace-integrals", + "slug": "laplace-integrals", + "title": "Evaluation of integrals by Laplace transform", + "displayOrder": 6 + }, + { + "id": "bt401-m4-laplace-ode", + "slug": "laplace-ode", + "title": "Solving ODEs by Laplace Transform method", + "displayOrder": 7 + }, + { + "id": "bt401-m4-fourier-transform", + "slug": "fourier-transform", + "title": "Fourier transforms", + "displayOrder": 8 + } + ], + "questionIds": [ + "bt401_m4_june2025_q1", + "bt401_m4_june2025_q2", + "bt401_m4_june2025_q3", + "bt401_m4_dec2024_q4", + "bt401_m4_dec2024_q5", + "bt401_m4_dec2024_q6", + "bt401_m4_dec2024_q7", + "bt401_m4_june2024_q8", + "bt401_m4_june2024_q9", + "bt401_m4_nov2023_q10", + "bt401_m4_nov2023_q11", + "bt401_m4_nov2023_q12", + "bt401_m4_june2023_q13", + "bt401_m4_june2023_q14", + "bt401_m4_june2023_q15", + "bt401_m4_june2023_q16", + "bt401_m4_nov2022_q17", + "bt401_m4_nov2022_q18" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "bt401-m5", "number": 5, "title": "Concept of Probability", "hours": 8, "topics": [ - "Probability Mass function", - "Probability Density Function", - "Discrete Distribution: Binomial, Poisson’s", - "Continuous Distribution: Normal Distribution, Exponential Distribution" - ] + { + "id": "bt401-m5-pmf", + "slug": "probability-mass-function", + "title": "Probability Mass function", + "displayOrder": 1 + }, + { + "id": "bt401-m5-pdf", + "slug": "probability-density-function", + "title": "Probability Density Function", + "displayOrder": 2 + }, + { + "id": "bt401-m5-binomial", + "slug": "binomial-distribution", + "title": "Binomial Distribution", + "displayOrder": 3 + }, + { + "id": "bt401-m5-poisson", + "slug": "poisson-distribution", + "title": "Poisson Distribution", + "displayOrder": 4 + }, + { + "id": "bt401-m5-normal", + "slug": "normal-distribution", + "title": "Normal Distribution", + "displayOrder": 5 + }, + { + "id": "bt401-m5-exponential", + "slug": "exponential-distribution", + "title": "Exponential Distribution", + "displayOrder": 6 + } + ], + "questionIds": [ + "bt401_m5_june2025_q1", + "bt401_m5_june2025_q2", + "bt401_m5_june2025_q3", + "bt401_m5_june2025_q4", + "bt401_m5_june2025_q5", + "bt401_m5_dec2024_q6", + "bt401_m5_dec2024_q7", + "bt401_m5_june2024_q8", + "bt401_m5_june2024_q9", + "bt401_m5_nov2023_q6", + "bt401_m5_nov2023_q7", + "bt401_m5_june2023_q4", + "bt401_m5_june2023_q5", + "bt401_m5_nov2022_q10", + "bt401_m5_nov2022_q11", + "bt401_m5_nov2022_q12" + ], + "predictedQuestionIds": [] } ] } diff --git a/content/rgpv/cse/semester-4/cs-402/pyqs.json b/content/rgpv/cse/semester-4/cs-402/pyqs.json index 2215c8f..39ab974 100644 --- a/content/rgpv/cse/semester-4/cs-402/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-402/pyqs.json @@ -2,8 +2,949 @@ "subject": { "id": "cs-402", "code": "CS-402", - "name": "Analysis Design of Algorithm (ADA)", - "title": "CS-402 - Analysis Design of Algorithm (ADA)" + "name": "Analysis Design of Algorithm", + "title": "CS/SD-402 (GS) – Analysis Design of Algorithm", + "semester": "IV", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Write and explain the control abstraction for Divide and conquer.", + "unit": "Unit 1", + "type": "divide-conquer" + }, + { + "id": "q1b", + "label": "b)", + "text": "Explain the theta notation used in algorithm analysis.", + "unit": "Unit 1", + "type": "asymptotic" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is an algorithm? Explain its characteristics.", + "unit": "Unit 1", + "type": "algorithms" + }, + { + "id": "q2b", + "label": "b)", + "text": "Differentiate between greedy method and dynamic programming.", + "unit": "Unit 3", + "type": "dp" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3", + "label": "", + "text": "Write a greedy algorithm to state the Job-Sequencing with deadlines problem. Find an optimal sequence for n=5 jobs with profits (20,15,10,5,1) and deadlines (2,2,1,3,3).", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What do you mean by forward and backward approach of problem solving in Dynamic Programming?", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q4b", + "label": "b)", + "text": "Discuss the need of Floyd Warshall Algorithm. Write the advantages and its time complexity.", + "unit": "Unit 3", + "type": "floyd-warshall" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Find minimum path cost between vertex s and t for the given multistage graph using dynamic programming.", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q5b", + "label": "b)", + "text": "Discuss the use of lower bound theory and its uses in solving the algebraic problem.", + "unit": "Unit 4", + "type": "lower-bound" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What is graph coloring problem? Describe the backtracking technique to m-coloring with the given planar graph.", + "unit": "Unit 4", + "type": "backtracking" + }, + { + "id": "q6b", + "label": "b)", + "text": "Write about Hamiltonian cycle. Draw portion state space tree for the given graph.", + "unit": "Unit 4", + "type": "backtracking" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Construct B Tree of order 5 for the list of elements 2,8,5,6,13,9,14,12,19,24,18,15,5,16,20,21.", + "unit": "Unit 5", + "type": "b-trees" + }, + { + "id": "q7b", + "label": "b)", + "text": "How do you find the height of a balanced tree? Explain with an example.", + "unit": "Unit 5", + "type": "avl" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: i) Binary search ii) Huffman coding iii) Tree Traversals iv) NP completeness.", + "unit": "Unit 1/2/5", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Trace the quick sort algorithm to sort the list C,O,L,L,E,G,E in alphabetical order.", + "unit": "Unit 1", + "type": "quick-sort" + }, + { + "id": "q1b", + "label": "b)", + "text": "Discuss Strassen's matrix multiplication and derive its time complexity.", + "unit": "Unit 1", + "type": "strassen" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Design merge sort algorithm and discuss its best-case, average-case and worst-case Efficiency.", + "unit": "Unit 1", + "type": "merge-sort" + }, + { + "id": "q2b", + "label": "b)", + "text": "How to solve the Knapsack problem with greedy method? Explain.", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Write an algorithm for single source shortest path and explain with an example.", + "unit": "Unit 2", + "type": "greedy" + }, + { + "id": "q3b", + "label": "b)", + "text": "Discuss briefly about the minimum spanning tree.", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What do you mean by forward and backward approach of problem solving in Dynamic Programming?", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q4b", + "label": "b)", + "text": "How the reliability of a system is determined using dynamic programming? Discuss.", + "unit": "Unit 3", + "type": "dp" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Find an optimal solution for 0/1 Knapsack problem using DP: n=4, M=5, W=(2,3,4,5), P=(3,4,5,6).", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the 8 queen's problem and apply the backtracking to solve the 8 queen's problem.", + "unit": "Unit 4", + "type": "backtracking" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6", + "label": "", + "text": "Write the control abstraction for LC-Search. Explain how Traveling Salesperson problem is solved using LCBB with the given cost matrix.", + "unit": "Unit 4", + "type": "branch-bound" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Discuss the differences between BFS and DFS.", + "unit": "Unit 5", + "type": "graph-traversal" + }, + { + "id": "q7b", + "label": "b)", + "text": "What are 2-3 trees used for? Why are 2-3 trees better than BST trees? Write the limitations of 2-3 tree.", + "unit": "Unit 5", + "type": "2-3-trees" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Discuss briefly any two: a) Heap sort b) Dynamic Programming c) Height balanced tree d) Parallel algorithm.", + "unit": "Unit 1/3/5/4", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "November 2023", + "year": 2023, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Solve the recurrence relation T(n)=1 for n≤4, T(n)=T(√n)+C for n>4 using substitution method.", + "unit": "Unit 1", + "type": "recurrence" + }, + { + "id": "q1b", + "label": "b)", + "text": "Give an algorithm for quick sort and analyze the algorithm.", + "unit": "Unit 1", + "type": "quick-sort" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is the solution generated by JS when n=7, P=(3,5,20,18,1,6,30), d=(1,3,4,3,2,1,2).", + "unit": "Unit 2", + "type": "greedy" + }, + { + "id": "q2b", + "label": "b)", + "text": "Show that adding an edge not in spanning tree T to T creates a unique cycle.", + "unit": "Unit 2", + "type": "mst" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Find optimal solution for 0/1 knapsack problem: W=(10,15,6,9), P=(2,5,8,1), M=30.", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q3b", + "label": "b)", + "text": "How reliability design can be obtained using dynamic programming?", + "unit": "Unit 3", + "type": "dp" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Generalize Hamiltonian so that it processes a graph with edge costs and finds a Hamiltonian cycle with minimum cost.", + "unit": "Unit 4", + "type": "backtracking" + }, + { + "id": "q4b", + "label": "b)", + "text": "How can comparison trees be used for deriving lower bounds on problem of sorting.", + "unit": "Unit 4", + "type": "lower-bound" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Write a function to construct binary tree from given inorder and postorder sequences. What is the complexity?", + "unit": "Unit 5", + "type": "binary-tree" + }, + { + "id": "q5b", + "label": "b)", + "text": "Give an example of n-vertex graph where DFS recursion depth is n-1 but BFS queue has at most one vertex.", + "unit": "Unit 5", + "type": "graph-traversal" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What do you mean by performance analysis of an algorithm? Explain.", + "unit": "Unit 1", + "type": "algorithms" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain Heap? Sort the data using heap sort: 81,39,10,36,45,15,55,23,91,88,12.", + "unit": "Unit 1", + "type": "heap-sort" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Draw the portion of state space tree generated by LCBB for knapsack: n=4, P=(10,10,12,18), W=(2,4,6,9), M=15.", + "unit": "Unit 4", + "type": "branch-bound" + }, + { + "id": "q7b", + "label": "b)", + "text": "Give an example of knapsack instances for which |Sⁱ|=2ⁱ, 0≤i≤n.", + "unit": "Unit 3", + "type": "dp" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two): a) Asymptotic Notations b) DFS and BFS c) Graph Coloring Problem.", + "unit": "Unit 1/5/4", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Obtain asymptotic bound using substitution method for T(n)=3T(n/3)+n and represent in θ notation.", + "unit": "Unit 1", + "type": "recurrence" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is Merge sort? Sort the elements 20,30,15,11,35,19,12,11,55 using Merge sort.", + "unit": "Unit 1", + "type": "merge-sort" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Discuss Strassen's matrix multiplication and Classical O(n³) methods. When does Strassen's outperform?", + "unit": "Unit 1", + "type": "strassen" + }, + { + "id": "q2b", + "label": "b)", + "text": "Define spanning tree? Construct a minimal spanning tree for the given graph using Prim's algorithm.", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3", + "label": "", + "text": "Solve job sequencing with deadlines using Greedy: n=4, P=(100,10,15,27), d=(2,1,2,1).", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Apply greedy method to solve 0/1 Knapsack: n=3, m=20, W=(18,15,10), P=(25,24,15).", + "unit": "Unit 2", + "type": "greedy" + }, + { + "id": "q4b", + "label": "b)", + "text": "Construct a multistage graph for the given graph using the greedy method.", + "unit": "Unit 3", + "type": "dp" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain the Floyd Warshall algorithm for the given graph.", + "unit": "Unit 3", + "type": "floyd-warshall" + }, + { + "id": "q5b", + "label": "b)", + "text": "Using branch and bound technique explain the 0/1 knapsack problem.", + "unit": "Unit 4", + "type": "branch-bound" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Give the solution to the 8-queens problem using backtracking.", + "unit": "Unit 4", + "type": "backtracking" + }, + { + "id": "q6b", + "label": "b)", + "text": "What is graph coloring? Explain graph coloring for the given graph.", + "unit": "Unit 4", + "type": "backtracking" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Use OBST to compute w(i,j), r(i,j), c(i,j) for identifier set (char,float,while,else) with given probabilities and construct optimal BST.", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain in detail about 2-3 Trees with an example.", + "unit": "Unit 5", + "type": "2-3-trees" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Binary search algorithm and its time complexity b) Single source shortest path c) Parallel algorithms d) NP Completeness.", + "unit": "Unit 1/2/4/5", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Give the asymptotic bounds for f(n)=2n²-4n+20 and represent in θ notation.", + "unit": "Unit 1", + "type": "asymptotic" + }, + { + "id": "q1b", + "label": "b)", + "text": "Define Quicksort? Sort elements 22,12,30,46,28,14,8,10,56,18,3 using Merge sort.", + "unit": "Unit 1", + "type": "merge-sort" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Write an algorithm to find matrix multiplication using Strassen's method.", + "unit": "Unit 1", + "type": "strassen" + }, + { + "id": "q2b", + "label": "b)", + "text": "Construct Huffman coding for the given character frequencies and write applications.", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3", + "label": "", + "text": "Solve job sequencing with deadlines using Greedy: n=5, P=(5,20,10,15,1), d=(3,2,1,2,3).", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Solve 0/1 Knapsack using DP: n=4, m=40, W=(2,11,22,15), P=(11,21,31,33).", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q4b", + "label": "b)", + "text": "Construct a multistage graph for the given graph using the Greedy method.", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain the Floyd Warshall algorithm for the given graph.", + "unit": "Unit 3", + "type": "floyd-warshall" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain in detail about the FIFO branch and bound.", + "unit": "Unit 4", + "type": "branch-bound" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Write an algorithm for the 8-queens problem using backtracking.", + "unit": "Unit 4", + "type": "backtracking" + }, + { + "id": "q6b", + "label": "b)", + "text": "Draw the state space tree for 'm' coloring when n=3 and m=3.", + "unit": "Unit 4", + "type": "backtracking" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Use OBST to compute w(i,j), r(i,j), c(i,j) for identifier set (double,int,for,if) and construct optimal BST.", + "unit": "Unit 5", + "type": "bst" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain in detail Height balanced tree with an example.", + "unit": "Unit 5", + "type": "avl" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Binary search algorithm and its time complexity b) Single source shortest path c) Hamiltonian graph and cycle d) Breadth First Search.", + "unit": "Unit 1/2/4/5", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Solve T(n)=1 for n≤4, T(n)=2T(√n)+log n for n>4 using substitution method.", + "unit": "Unit 1", + "type": "recurrence" + }, + { + "id": "q1b", + "label": "b)", + "text": "The worst case of merge sort is O(n log n). What is its best case? Can we say merge sort is O(n log n)?", + "unit": "Unit 1", + "type": "merge-sort" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Obtain optimal Huffman codes for messages with frequencies (4,5,7,8,10,12,20). Draw the decode tree.", + "unit": "Unit 2", + "type": "greedy" + }, + { + "id": "q2b", + "label": "b)", + "text": "Use shortest paths algorithm to obtain lengths from vertex 1 to all remaining vertices in the given di-graph.", + "unit": "Unit 2", + "type": "greedy" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Give an example of knapsack instances for which |Sⁱ|=2ⁱ, 0≤i≤n, with one instance for each n.", + "unit": "Unit 3", + "type": "dp" + }, + { + "id": "q3b", + "label": "b)", + "text": "Explain Floyd Warshall algorithm with suitable example.", + "unit": "Unit 3", + "type": "floyd-warshall" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Given an n×n chessboard, present an algorithm for Knight's tour problem to visit all squares exactly once.", + "unit": "Unit 4", + "type": "backtracking" + }, + { + "id": "q4b", + "label": "b)", + "text": "Consider the traveling salesperson instance defined by the given 5×5 cost matrix.", + "unit": "Unit 4", + "type": "branch-bound" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Show that DFS visits all vertices in G reachable from V.", + "unit": "Unit 5", + "type": "graph-traversal" + }, + { + "id": "q5b", + "label": "b)", + "text": "Obtain a nondeterministic algorithm of O(n) to determine if a subset of n numbers sums to m.", + "unit": "Unit 5", + "type": "np" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Write an algorithm to delete element x from a BST. What is the time complexity?", + "unit": "Unit 5", + "type": "bst" + }, + { + "id": "q6b", + "label": "b)", + "text": "What do you mean by balance factor in AVL tree? Give example to balance an AVL tree.", + "unit": "Unit 5", + "type": "avl" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Write an algorithm for n jobs on k parallel processors to minimize finish time.", + "unit": "Unit 4", + "type": "parallel" + }, + { + "id": "q7b", + "label": "b)", + "text": "Find optimal solution for 0/1 knapsack: W=(10,15,6,9), P=(2,5,8,1), M=30.", + "unit": "Unit 3", + "type": "dp" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two): a) B-Trees b) Tree Traversal c) Reliability Design.", + "unit": "Unit 5/3", + "type": "mixed" + } + ] + } + ] + } + ] } diff --git a/content/rgpv/cse/semester-4/cs-402/syllabus.json b/content/rgpv/cse/semester-4/cs-402/syllabus.json index c0fc708..3444d74 100644 --- a/content/rgpv/cse/semester-4/cs-402/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-402/syllabus.json @@ -3,71 +3,373 @@ "id": "cs-402", "code": "CS-402", "name": "Analysis Design of Algorithm", - "title": "CS-402 - Analysis Design of Algorithm", - "semester": "IV" + "title": "CS-402 – Analysis Design of Algorithm (ADA)", + "university": "Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal", + "scheme": "New Scheme Based On AICTE Flexible Curricula", + "semester": "IV", + "branch": "CSE-Computer Science Engineering" }, "modules": [ { - "id": "module-1", + "id": "cs402-m1", "number": 1, "title": "Introduction to Algorithms and Divide & Conquer", - "hours": 8, + "hours": null, "topics": [ - "Algorithms", - "Designing algorithms", - "analyzing algorithms", - "asymptotic notations", - "heap and heap sort", - "Introduction to divide and conquer technique", - "analysis, design and comparison of various algorithms based on this technique", - "example binary search, merge sort, quick sort, strassen’s matrix multiplication" - ] + { + "id": "cs402-m1-algorithms", + "slug": "algorithms", + "title": "Algorithms, Designing algorithms, analyzing algorithms", + "displayOrder": 1 + }, + { + "id": "cs402-m1-asymptotic", + "slug": "asymptotic-notations", + "title": "Asymptotic notations", + "displayOrder": 2 + }, + { + "id": "cs402-m1-heap", + "slug": "heap-sort", + "title": "Heap and heap sort", + "displayOrder": 3 + }, + { + "id": "cs402-m1-divide-conquer", + "slug": "divide-and-conquer", + "title": "Introduction to divide and conquer technique", + "displayOrder": 4 + }, + { + "id": "cs402-m1-binary-search", + "slug": "binary-search", + "title": "Binary search", + "displayOrder": 5 + }, + { + "id": "cs402-m1-merge-sort", + "slug": "merge-sort", + "title": "Merge sort", + "displayOrder": 6 + }, + { + "id": "cs402-m1-quick-sort", + "slug": "quick-sort", + "title": "Quick sort", + "displayOrder": 7 + }, + { + "id": "cs402-m1-strassen", + "slug": "strassen-multiplication", + "title": "Strassen's matrix multiplication", + "displayOrder": 8 + } + ], + "questionIds": [ + "cs402_m1_june2025_q1", + "cs402_m1_june2025_q2", + "cs402_m1_dec2024_q3", + "cs402_m1_dec2024_q4", + "cs402_m1_dec2024_q5", + "cs402_m1_dec2024_q6", + "cs402_m1_june2024_q7", + "cs402_m1_june2024_q8", + "cs402_m1_june2024_q9", + "cs402_m1_june2024_q10", + "cs402_m1_nov2023_q11", + "cs402_m1_nov2023_q12", + "cs402_m1_nov2023_q13", + "cs402_m1_nov2023_q14", + "cs402_m1_nov2023_q15", + "cs402_m1_june2023_q16", + "cs402_m1_june2023_q17", + "cs402_m1_june2023_q18", + "cs402_m1_june2023_q19", + "cs402_m1_nov2022_q20", + "cs402_m1_nov2022_q21", + "cs402_m1_nov2022_q22", + "cs402_m1_nov2022_q23" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "cs402-m2", "number": 2, "title": "Greedy Strategy", - "hours": 8, + "hours": null, "topics": [ - "Study of Greedy strategy", - "examples of greedy method like optimal merge patterns, Huffman coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path algorithm" - ] + { + "id": "cs402-m2-greedy-intro", + "slug": "greedy-strategy", + "title": "Study of Greedy strategy", + "displayOrder": 1 + }, + { + "id": "cs402-m2-optimal-merge", + "slug": "optimal-merge-patterns", + "title": "Optimal merge patterns", + "displayOrder": 2 + }, + { + "id": "cs402-m2-huffman", + "slug": "huffman-coding", + "title": "Huffman coding", + "displayOrder": 3 + }, + { + "id": "cs402-m2-mst", + "slug": "minimum-spanning-trees", + "title": "Minimum spanning trees", + "displayOrder": 4 + }, + { + "id": "cs402-m2-knapsack", + "slug": "knapsack-problem", + "title": "Knapsack problem", + "displayOrder": 5 + }, + { + "id": "cs402-m2-job-sequencing", + "slug": "job-sequencing-deadlines", + "title": "Job sequencing with deadlines", + "displayOrder": 6 + }, + { + "id": "cs402-m2-sssp", + "slug": "single-source-shortest-path", + "title": "Single source shortest path algorithm", + "displayOrder": 7 + } + ], + "questionIds": [ + "cs402_m2_june2025_q1", + "cs402_m2_june2025_q2", + "cs402_m2_dec2024_q3", + "cs402_m2_dec2024_q4", + "cs402_m2_dec2024_q5", + "cs402_m2_dec2024_q6", + "cs402_m2_june2024_q7", + "cs402_m2_june2024_q8", + "cs402_m2_june2024_q9", + "cs402_m2_june2024_q10", + "cs402_m2_nov2023_q11", + "cs402_m2_nov2023_q12", + "cs402_m2_june2023_q13", + "cs402_m2_june2023_q14", + "cs402_m2_june2023_q15", + "cs402_m2_nov2022_q16", + "cs402_m2_nov2022_q17" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "cs402-m3", "number": 3, "title": "Dynamic Programming", - "hours": 8, + "hours": null, "topics": [ - "Concept of dynamic programming", - "problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd-Warshall algorithm" - ] + { + "id": "cs402-m3-dp-concept", + "slug": "dynamic-programming", + "title": "Concept of dynamic programming", + "displayOrder": 1 + }, + { + "id": "cs402-m3-knapsack-dp", + "slug": "knapsack-dp", + "title": "0/1 Knapsack problem using DP", + "displayOrder": 2 + }, + { + "id": "cs402-m3-multistage", + "slug": "multistage-graph", + "title": "Multistage graph", + "displayOrder": 3 + }, + { + "id": "cs402-m3-reliability", + "slug": "reliability-design", + "title": "Reliability design", + "displayOrder": 4 + }, + { + "id": "cs402-m3-floyd-warshall", + "slug": "floyd-warshall", + "title": "Floyd-Warshall algorithm", + "displayOrder": 5 + } + ], + "questionIds": [ + "cs402_m3_june2025_q1", + "cs402_m3_june2025_q2", + "cs402_m3_june2025_q3", + "cs402_m3_june2025_q4", + "cs402_m3_dec2024_q5", + "cs402_m3_dec2024_q6", + "cs402_m3_june2024_q7", + "cs402_m3_june2024_q8", + "cs402_m3_june2024_q9", + "cs402_m3_nov2023_q10", + "cs402_m3_nov2023_q11", + "cs402_m3_nov2023_q12", + "cs402_m3_june2023_q13", + "cs402_m3_june2023_q14", + "cs402_m3_june2023_q15", + "cs402_m3_june2023_q16", + "cs402_m3_nov2022_q17", + "cs402_m3_nov2022_q18", + "cs402_m3_nov2022_q19", + "cs402_m3_nov2022_q20" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "cs402-m4", "number": 4, "title": "Backtracking and Branch & Bound", - "hours": 8, + "hours": null, "topics": [ - "Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring problem etc.", - "Introduction to branch & bound method", - "examples of branch and bound method like traveling salesman problem etc.", - "Meaning of lower bound theory and its use in solving algebraic problem", - "introduction to parallel algorithms" - ] + { + "id": "cs402-m4-backtracking", + "slug": "backtracking", + "title": "Backtracking concept", + "displayOrder": 1 + }, + { + "id": "cs402-m4-8queens", + "slug": "8-queens-problem", + "title": "8 Queen's problem", + "displayOrder": 2 + }, + { + "id": "cs402-m4-hamiltonian", + "slug": "hamiltonian-cycle", + "title": "Hamiltonian cycle", + "displayOrder": 3 + }, + { + "id": "cs402-m4-graph-coloring", + "slug": "graph-coloring", + "title": "Graph coloring problem", + "displayOrder": 4 + }, + { + "id": "cs402-m4-branch-bound", + "slug": "branch-and-bound", + "title": "Introduction to branch & bound method", + "displayOrder": 5 + }, + { + "id": "cs402-m4-tsp", + "slug": "traveling-salesman", + "title": "Traveling salesman problem using branch & bound", + "displayOrder": 6 + }, + { + "id": "cs402-m4-lower-bound", + "slug": "lower-bound-theory", + "title": "Lower bound theory and its use in solving algebraic problem", + "displayOrder": 7 + }, + { + "id": "cs402-m4-parallel", + "slug": "parallel-algorithms", + "title": "Introduction to parallel algorithms", + "displayOrder": 8 + } + ], + "questionIds": [ + "cs402_m4_june2025_q1", + "cs402_m4_june2025_q2", + "cs402_m4_june2025_q3", + "cs402_m4_dec2024_q4", + "cs402_m4_dec2024_q5", + "cs402_m4_dec2024_q6", + "cs402_m4_dec2024_q7", + "cs402_m4_june2024_q8", + "cs402_m4_june2024_q9", + "cs402_m4_june2024_q10", + "cs402_m4_june2024_q11", + "cs402_m4_nov2023_q12", + "cs402_m4_nov2023_q13", + "cs402_m4_nov2023_q14", + "cs402_m4_nov2023_q15", + "cs402_m4_june2023_q16", + "cs402_m4_june2023_q17", + "cs402_m4_june2023_q18", + "cs402_m4_nov2022_q19", + "cs402_m4_nov2022_q20", + "cs402_m4_nov2022_q21" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "cs402-m5", "number": 5, "title": "Trees, Graphs, and NP-Completeness", - "hours": 8, + "hours": null, "topics": [ - "Binary search trees", - "height balanced trees", - "2-3 trees, B-trees", - "basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS)", - "NP-completeness" - ] + { + "id": "cs402-m5-bst", + "slug": "binary-search-trees", + "title": "Binary search trees", + "displayOrder": 1 + }, + { + "id": "cs402-m5-avl", + "slug": "height-balanced-trees", + "title": "Height balanced trees (AVL)", + "displayOrder": 2 + }, + { + "id": "cs402-m5-23trees", + "slug": "2-3-trees", + "title": "2-3 trees", + "displayOrder": 3 + }, + { + "id": "cs402-m5-btrees", + "slug": "b-trees", + "title": "B-trees", + "displayOrder": 4 + }, + { + "id": "cs402-m5-traversals", + "slug": "tree-graph-traversals", + "title": "Basic search and traversal techniques (Inorder, Preorder, Postorder, DFS, BFS)", + "displayOrder": 5 + }, + { + "id": "cs402-m5-np", + "slug": "np-completeness", + "title": "NP-completeness", + "displayOrder": 6 + } + ], + "questionIds": [ + "cs402_m5_june2025_q1", + "cs402_m5_june2025_q2", + "cs402_m5_june2025_q3", + "cs402_m5_june2025_q4", + "cs402_m5_june2025_q5", + "cs402_m5_june2025_q6", + "cs402_m5_dec2024_q7", + "cs402_m5_dec2024_q8", + "cs402_m5_dec2024_q9", + "cs402_m5_june2024_q10", + "cs402_m5_june2024_q11", + "cs402_m5_nov2023_q12", + "cs402_m5_nov2023_q13", + "cs402_m5_nov2023_q14", + "cs402_m5_june2023_q15", + "cs402_m5_june2023_q16", + "cs402_m5_june2023_q17", + "cs402_m5_nov2022_q18", + "cs402_m5_nov2022_q19", + "cs402_m5_nov2022_q20", + "cs402_m5_nov2022_q21" + ], + "predictedQuestionIds": [] } ] } diff --git a/content/rgpv/cse/semester-4/cs-403/pyqs.json b/content/rgpv/cse/semester-4/cs-403/pyqs.json index 5bfcc42..1cb83bc 100644 --- a/content/rgpv/cse/semester-4/cs-403/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-403/pyqs.json @@ -2,8 +2,984 @@ "subject": { "id": "cs-403", "code": "CS-403", - "name": "Software Engineering (SE)", - "title": "CS-403 - Software Engineering (SE)" + "name": "Software Engineering", + "title": "AL/CD/CS/CT/CO/SD-403 (GS) – Software Engineering", + "semester": "IV", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] -} + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "With a neat diagram explain about the component assembly model and rational unified process.", + "unit": "Unit 1", + "type": "process-models" + }, + { + "id": "q1b", + "label": "b)", + "text": "Write about the characteristics of software engineering.", + "unit": "Unit 1", + "type": "software-characteristics" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Explain about the CMM levels.", + "unit": "Unit 1", + "type": "cmm" + }, + { + "id": "q2b", + "label": "b)", + "text": "Draw a use case diagram for booking a ticket in a reservation system.", + "unit": "Unit 2", + "type": "use-case" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is meant by software requirement elicitation. How the requirements can be specified.", + "unit": "Unit 2", + "type": "elicitation" + }, + { + "id": "q3b", + "label": "b)", + "text": "What is a model? Why it is needed in the development of software.", + "unit": "Unit 3", + "type": "design-modeling" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain in detail about the design concepts and principles.", + "unit": "Unit 3", + "type": "design-concepts" + }, + { + "id": "q4b", + "label": "b)", + "text": "How architecture is used in the development of software. What are the different styles used for it? Explain any two of them.", + "unit": "Unit 3", + "type": "architectural-styles" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "How do you describe the architecture of the software intensive system based on the use of multiple, concurrent views.", + "unit": "Unit 3", + "type": "architectural-views" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain different specialized testing techniques.", + "unit": "Unit 4", + "type": "testing" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What is the need of integration testing? Explain it with a neat figure.", + "unit": "Unit 4", + "type": "integration-testing" + }, + { + "id": "q6b", + "label": "b)", + "text": "What is software testing? What are the levels present in it? How unit testing is used for software.", + "unit": "Unit 4", + "type": "testing" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain software configuration management in detail.", + "unit": "Unit 5", + "type": "scm" + }, + { + "id": "q7b", + "label": "b)", + "text": "Write the difference between the re-engineering and reverse engineering with diagrams.", + "unit": "Unit 5", + "type": "maintenance" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on: a) Traceability b) Static Analysis c) Risk management.", + "unit": "Unit 2/4/5", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Discuss in detail about Evolutionary process model in software Engineering.", + "unit": "Unit 1", + "type": "process-models" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is RAD Model and why it is important. Give the applications of RAD model.", + "unit": "Unit 1", + "type": "rad" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "The functional requirements specification of a system should be both complete and consistent. Substantiate with examples.", + "unit": "Unit 2", + "type": "requirements" + }, + { + "id": "q2b", + "label": "b)", + "text": "What is the use-case model and how to make it? Discuss the four basic parts of a use-case model.", + "unit": "Unit 2", + "type": "use-case" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Discuss about the basic principles of software design in software engineering.", + "unit": "Unit 3", + "type": "design-principles" + }, + { + "id": "q3b", + "label": "b)", + "text": "What are SA and SD? Discuss about component based design and what are its advantages.", + "unit": "Unit 3", + "type": "sa-sd" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What are the strategic approaches to software testing? Explain in detail.", + "unit": "Unit 4", + "type": "testing" + }, + { + "id": "q4b", + "label": "b)", + "text": "What is unit testing in software Engineering? Explain with suitable example.", + "unit": "Unit 4", + "type": "unit-testing" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What is meant by software quality? Explain the metrics for maintenance.", + "unit": "Unit 5", + "type": "sqa" + }, + { + "id": "q5b", + "label": "b)", + "text": "Discuss about SCM function in software engineering with suitable example.", + "unit": "Unit 5", + "type": "scm" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What is system testing. Discuss about different types of system testing.", + "unit": "Unit 4", + "type": "system-testing" + }, + { + "id": "q6b", + "label": "b)", + "text": "What are test metrics and its types? What is the purpose of testing metrics? Explain.", + "unit": "Unit 4", + "type": "test-metrics" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "What is the difference between product and process metric?", + "unit": "Unit 1", + "type": "metrics" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is component model in software engineering? Explain with neat diagram.", + "unit": "Unit 3", + "type": "component-model" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Object Models b) Black-Box Testing c) Program Comprehension Techniques d) Testing Tools.", + "unit": "Unit 2/4/5", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "November 2023", + "year": 2023, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "What is spiral model? Explain with neat diagram.", + "unit": "Unit 1", + "type": "spiral" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is SDLC? Illustrate the phases of SDLC in software engineering.", + "unit": "Unit 1", + "type": "sdlc" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is the difference between function oriented modeling and object oriented modeling?", + "unit": "Unit 2", + "type": "analysis-modeling" + }, + { + "id": "q2b", + "label": "b)", + "text": "Discuss about system and software requirement specifications.", + "unit": "Unit 2", + "type": "srs" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What is a design metrics? Explain the importance of design metrics.", + "unit": "Unit 3", + "type": "design-metrics" + }, + { + "id": "q3b", + "label": "b)", + "text": "Discuss about the function oriented design strategies in detail.", + "unit": "Unit 3", + "type": "function-oriented" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What is software testing and system testing? Explain in detail.", + "unit": "Unit 4", + "type": "testing" + }, + { + "id": "q4b", + "label": "b)", + "text": "Discuss about integration testing with suitable example.", + "unit": "Unit 4", + "type": "integration-testing" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What is risk and how to identify the risk in software engineering? Explain.", + "unit": "Unit 5", + "type": "risk" + }, + { + "id": "q5b", + "label": "b)", + "text": "Write the difference between reverse engineering and re-engineering.", + "unit": "Unit 5", + "type": "maintenance" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What are the steps of acceptance testing? Explain in detail.", + "unit": "Unit 4", + "type": "acceptance-testing" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain the principles of risk assessment and mitigation.", + "unit": "Unit 5", + "type": "risk" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Write about project scheduling and tracking.", + "unit": "Unit 5", + "type": "project-management" + }, + { + "id": "q7b", + "label": "b)", + "text": "Describe RUP and agile processes in detail.", + "unit": "Unit 1", + "type": "rup-agile" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Structured methods b) White-Box Testing c) Feasibility Analysis d) Test Case Design.", + "unit": "Unit 3/4/5", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Elucidate the key features of the software process models with suitable examples?", + "unit": "Unit 1", + "type": "process-models" + }, + { + "id": "q1b", + "label": "b)", + "text": "Write about CMM (Capability Maturity Model) and how it is used for Software Quality?", + "unit": "Unit 1", + "type": "cmm" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Draw and explain the spiral model with its advantages and disadvantages?", + "unit": "Unit 1", + "type": "spiral" + }, + { + "id": "q2b", + "label": "b)", + "text": "Discuss the components of a software requirement specification document?", + "unit": "Unit 2", + "type": "srs" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Differentiate between functional and Non Functional requirements with suitable examples?", + "unit": "Unit 2", + "type": "requirements" + }, + { + "id": "q3b", + "label": "b)", + "text": "What are the activities of requirement elicitation and Analysis? Explain.", + "unit": "Unit 2", + "type": "elicitation" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Discuss about pattern based software design in detail?", + "unit": "Unit 3", + "type": "design-patterns" + }, + { + "id": "q4b", + "label": "b)", + "text": "Briefly explain about Function-Oriented design?", + "unit": "Unit 3", + "type": "function-oriented" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "List and explain the golden rules of User-Interface design?", + "unit": "Unit 3", + "type": "ui-design" + }, + { + "id": "q5b", + "label": "b)", + "text": "Briefly discuss about Integration testing Strategies?", + "unit": "Unit 4", + "type": "integration-testing" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What is Black-Box testing? What is boundary value Analysis? Explain with example.", + "unit": "Unit 4", + "type": "black-box" + }, + { + "id": "q6b", + "label": "b)", + "text": "What is White-Box testing? How white box testing is carried out? Demonstrate with example.", + "unit": "Unit 4", + "type": "white-box" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain briefly about Software Configuration Management (SCM)?", + "unit": "Unit 5", + "type": "scm" + }, + { + "id": "q7b", + "label": "b)", + "text": "What do you understand by Feasibility Analysis? Explain.", + "unit": "Unit 5", + "type": "feasibility" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Schedule and Cost Estimation b) RUP c) Traceability d) Design Principles.", + "unit": "Unit 5/1/2/3", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain with neat diagram about RAD model.", + "unit": "Unit 1", + "type": "rad" + }, + { + "id": "q1b", + "label": "b)", + "text": "Describe briefly about Prototyping model for Software development?", + "unit": "Unit 1", + "type": "prototyping" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Draw and explain the Incremental Model with its Merits and Demerits?", + "unit": "Unit 1", + "type": "incremental" + }, + { + "id": "q2b", + "label": "b)", + "text": "Discuss briefly about Use case Model with neat sketch?", + "unit": "Unit 2", + "type": "use-case" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Differentiate between Function-Oriented and Object-Oriented Software development?", + "unit": "Unit 2", + "type": "analysis-modeling" + }, + { + "id": "q3b", + "label": "b)", + "text": "Describe different checks to be carried out during requirement validation process?", + "unit": "Unit 2", + "type": "validation" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "How system modeling is achieved using UML? Explain with a suitable example.", + "unit": "Unit 3", + "type": "uml" + }, + { + "id": "q4b", + "label": "b)", + "text": "What do you understand by Function-Oriented design? Discuss in detail.", + "unit": "Unit 3", + "type": "function-oriented" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "List and Explain different kinds of architecture styles and patterns?", + "unit": "Unit 3", + "type": "architectural-styles" + }, + { + "id": "q5b", + "label": "b)", + "text": "What is Test Oracles? Explain different types of test techniques.", + "unit": "Unit 4", + "type": "test-techniques" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "With neat sketch explain briefly about testing levels?", + "unit": "Unit 4", + "type": "testing-levels" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain briefly about Software Configuration Management (SCM)?", + "unit": "Unit 5", + "type": "scm" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Discuss about Risk Assessment and Mitigation.", + "unit": "Unit 5", + "type": "risk" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is Re-Engineering and discuss about steps involved in Re-Engineering?", + "unit": "Unit 5", + "type": "maintenance" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: i) Resource Allocation ii) Component Assembly Model iii) SA/SD Component Based Design iv) Testing frameworks.", + "unit": "Unit 5/1/3/4", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "What are the five major activities of an operating system in regards to memory management?", + "unit": "Unit 1", + "type": "os" + }, + { + "id": "q1b", + "label": "b)", + "text": "List the functions of OS. How operating system perform management task in a system?", + "unit": "Unit 1", + "type": "os" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is the Component Assembly Model? How does it differ from the Incremental Model?", + "unit": "Unit 1", + "type": "process-models" + }, + { + "id": "q2b", + "label": "b)", + "text": "Explain the purpose of process customization and improvement with reference to CMM.", + "unit": "Unit 1", + "type": "cmm" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Describe functional and non-functional requirements with examples.", + "unit": "Unit 2", + "type": "requirements" + }, + { + "id": "q3b", + "label": "b)", + "text": "What are the major requirement elicitation techniques? Discuss any two in detail.", + "unit": "Unit 2", + "type": "elicitation" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain use case modeling with the help of an example.", + "unit": "Unit 2", + "type": "use-case" + }, + { + "id": "q4b", + "label": "b)", + "text": "What are the key contents of a Software Requirement Specification (SRS) document?", + "unit": "Unit 2", + "type": "srs" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Describe any four fundamental software design principles.", + "unit": "Unit 3", + "type": "design-principles" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the SA/SD approach to function-oriented design.", + "unit": "Unit 3", + "type": "sa-sd" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What are architectural views? Briefly describe different architectural styles.", + "unit": "Unit 3", + "type": "architectural-views" + }, + { + "id": "q6b", + "label": "b)", + "text": "What are the key design metrics used to evaluate software design quality?", + "unit": "Unit 3", + "type": "design-metrics" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Differentiate between static and dynamic code analysis.", + "unit": "Unit 4", + "type": "static-dynamic" + }, + { + "id": "q7b", + "label": "b)", + "text": "Describe the black-box testing technique with an example.", + "unit": "Unit 4", + "type": "black-box" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "What is Software Configuration Management (SCM)? Describe its major activities.", + "unit": "Unit 5", + "type": "scm" + }, + { + "id": "q8b", + "label": "b)", + "text": "Explain software project feasibility analysis and its types.", + "unit": "Unit 5", + "type": "feasibility" + } + ] + } + ] + } + ] +} \ No newline at end of file diff --git a/content/rgpv/cse/semester-4/cs-403/syllabus.json b/content/rgpv/cse/semester-4/cs-403/syllabus.json index b40e4f4..efccd24 100644 --- a/content/rgpv/cse/semester-4/cs-403/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-403/syllabus.json @@ -3,107 +3,425 @@ "id": "cs-403", "code": "CS-403", "name": "Software Engineering", - "title": "CS-403 - Software Engineering", - "semester": "IV" + "title": "CS-403 – Software Engineering (SE)", + "university": "Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal", + "scheme": "New Scheme Based On AICTE Flexible Curricula", + "semester": "IV", + "branch": "CSE-Computer Science Engineering" }, "modules": [ { - "id": "module-1", + "id": "cs403-m1", "number": 1, "title": "The Software Product and Software Process", - "hours": 8, + "hours": null, "topics": [ - "Software Product and Process Characteristics", - "Software Process Models: Linear Sequential Model, Prototyping Model, RAD Model", - "Evolutionary Process Models like Incremental Model, Spiral Model", - "Component Assembly Model", - "RUP and Agile processes", - "Software Process customization and improvement", - "CMM", - "Product and ProcessMetrics" - ] + { + "id": "cs403-m1-product-process", + "slug": "software-product-process", + "title": "Software Product and Process Characteristics", + "displayOrder": 1 + }, + { + "id": "cs403-m1-linear-sequential", + "slug": "linear-sequential-model", + "title": "Linear Sequential Model", + "displayOrder": 2 + }, + { + "id": "cs403-m1-prototyping", + "slug": "prototyping-model", + "title": "Prototyping Model", + "displayOrder": 3 + }, + { + "id": "cs403-m1-rad", + "slug": "rad-model", + "title": "RAD Model", + "displayOrder": 4 + }, + { + "id": "cs403-m1-evolutionary", + "slug": "evolutionary-process-models", + "title": "Evolutionary Process Models (Incremental Model, Spiral Model, Component Assembly Model)", + "displayOrder": 5 + }, + { + "id": "cs403-m1-rup-agile", + "slug": "rup-agile-processes", + "title": "RUP and Agile processes", + "displayOrder": 6 + }, + { + "id": "cs403-m1-cmm", + "slug": "cmm", + "title": "Software Process customization and improvement, CMM", + "displayOrder": 7 + }, + { + "id": "cs403-m1-metrics", + "slug": "product-process-metrics", + "title": "Product and Process Metrics", + "displayOrder": 8 + } + ], + "questionIds": [ + "cs403_m1_june2025_q1", + "cs403_m1_june2025_q2", + "cs403_m1_june2025_q3", + "cs403_m1_june2025_q4", + "cs403_m1_dec2024_q5", + "cs403_m1_dec2024_q6", + "cs403_m1_dec2024_q7", + "cs403_m1_june2024_q8", + "cs403_m1_june2024_q9", + "cs403_m1_june2024_q10", + "cs403_m1_june2024_q11", + "cs403_m1_nov2023_q12", + "cs403_m1_nov2023_q13", + "cs403_m1_nov2023_q14", + "cs403_m1_nov2023_q15", + "cs403_m1_june2023_q16", + "cs403_m1_june2023_q17", + "cs403_m1_june2023_q18", + "cs403_m1_nov2022_q19", + "cs403_m1_nov2022_q20", + "cs403_m1_nov2022_q21" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "cs403-m2", "number": 2, "title": "Requirement Elicitation, Analysis, and Specification", - "hours": 8, + "hours": null, "topics": [ - "Functional and Non-functional requirements", - "Requirement Sources and Elicitation Techniques", - "Analysis Modeling for Function-oriented and Object-oriented software development", - "Use case Modeling", - "System and Software Requirement Specifications", - "Requirement Validation", - "Traceability" - ] + { + "id": "cs403-m2-functional-nonfunctional", + "slug": "functional-nonfunctional-requirements", + "title": "Functional and Non-functional requirements", + "displayOrder": 1 + }, + { + "id": "cs403-m2-elicitation", + "slug": "requirement-elicitation", + "title": "Requirement Sources and Elicitation Techniques", + "displayOrder": 2 + }, + { + "id": "cs403-m2-analysis-modeling", + "slug": "analysis-modeling", + "title": "Analysis Modeling for Function-oriented and Object-oriented software development", + "displayOrder": 3 + }, + { + "id": "cs403-m2-use-case", + "slug": "use-case-modeling", + "title": "Use case Modeling", + "displayOrder": 4 + }, + { + "id": "cs403-m2-srs", + "slug": "srs", + "title": "System and Software Requirement Specifications", + "displayOrder": 5 + }, + { + "id": "cs403-m2-validation", + "slug": "requirement-validation", + "title": "Requirement Validation", + "displayOrder": 6 + }, + { + "id": "cs403-m2-traceability", + "slug": "traceability", + "title": "Traceability", + "displayOrder": 7 + } + ], + "questionIds": [ + "cs403_m2_june2025_q1", + "cs403_m2_june2025_q2", + "cs403_m2_june2025_q3", + "cs403_m2_june2025_q4", + "cs403_m2_dec2024_q5", + "cs403_m2_dec2024_q6", + "cs403_m2_dec2024_q7", + "cs403_m2_june2024_q8", + "cs403_m2_june2024_q9", + "cs403_m2_june2024_q10", + "cs403_m2_june2024_q11", + "cs403_m2_nov2023_q11", + "cs403_m2_nov2023_q12", + "cs403_m2_nov2023_q13", + "cs403_m2_june2023_q14", + "cs403_m2_june2023_q15", + "cs403_m2_june2023_q16", + "cs403_m2_nov2022_q11", + "cs403_m2_nov2022_q17", + "cs403_m2_nov2022_q18" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "cs403-m3", "number": 3, "title": "Software Design", - "hours": 8, + "hours": null, "topics": [ - "The Software Design Process", - "Design Concepts and Principles", - "Software Modeling and UML", - "Architectural Design", - "Architectural Views and Styles", - "User Interface Design", - "Function- oriented Design", - "SA/SD Component Based Design", - "DesignMetrics" - ] + { + "id": "cs403-m3-design-process", + "slug": "software-design-process", + "title": "The Software Design Process", + "displayOrder": 1 + }, + { + "id": "cs403-m3-design-concepts", + "slug": "design-concepts-principles", + "title": "Design Concepts and Principles", + "displayOrder": 2 + }, + { + "id": "cs403-m3-uml", + "slug": "software-modeling-uml", + "title": "Software Modeling and UML", + "displayOrder": 3 + }, + { + "id": "cs403-m3-architectural", + "slug": "architectural-design", + "title": "Architectural Design, Architectural Views and Styles", + "displayOrder": 4 + }, + { + "id": "cs403-m3-ui-design", + "slug": "user-interface-design", + "title": "User Interface Design", + "displayOrder": 5 + }, + { + "id": "cs403-m3-function-oriented", + "slug": "function-oriented-design", + "title": "Function-oriented Design, SA/SD", + "displayOrder": 6 + }, + { + "id": "cs403-m3-component-based", + "slug": "component-based-design", + "title": "Component Based Design", + "displayOrder": 7 + }, + { + "id": "cs403-m3-design-metrics", + "slug": "design-metrics", + "title": "Design Metrics", + "displayOrder": 8 + } + ], + "questionIds": [ + "cs403_m3_june2025_q1", + "cs403_m3_june2025_q2", + "cs403_m3_june2025_q3", + "cs403_m3_june2025_q4", + "cs403_m3_dec2024_q5", + "cs403_m3_dec2024_q6", + "cs403_m3_dec2024_q7", + "cs403_m3_dec2024_q8", + "cs403_m3_june2024_q9", + "cs403_m3_june2024_q10", + "cs403_m3_june2024_q11", + "cs403_m3_june2024_q12", + "cs403_m3_nov2023_q13", + "cs403_m3_nov2023_q14", + "cs403_m3_nov2023_q15", + "cs403_m3_june2023_q16", + "cs403_m3_june2023_q17", + "cs403_m3_june2023_q18", + "cs403_m3_nov2022_q19", + "cs403_m3_nov2022_q20", + "cs403_m3_nov2022_q21", + "cs403_m3_nov2022_q22" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "cs403-m4", "number": 4, "title": "Software Analysis and Testing", - "hours": 8, + "hours": null, "topics": [ - "Software Static and Dynamic analysis", - "Code inspections", - "Software Testing, Fundamentals", - "Software Test Process", - "Testing Levels", - "Test Criteria", - "Test Case Design", - "Test Oracles", - "Test Techniques", - "BlackBox Testing", - "White-Box Unit Testing and Unit", - "Testing Frameworks", - "Integration Testing", - "System Testing and other Specialized Testing", - "Test Plan, Test Metrics, Testing Tools", - "Introduction to Object-oriented analysis, design and comparison with structured SoftwareEngg" - ] + { + "id": "cs403-m4-static-dynamic", + "slug": "static-dynamic-analysis", + "title": "Software Static and Dynamic analysis, Code inspections", + "displayOrder": 1 + }, + { + "id": "cs403-m4-testing-fundamentals", + "slug": "software-testing-fundamentals", + "title": "Software Testing Fundamentals, Software Test Process", + "displayOrder": 2 + }, + { + "id": "cs403-m4-testing-levels", + "slug": "testing-levels", + "title": "Testing Levels, Test Criteria", + "displayOrder": 3 + }, + { + "id": "cs403-m4-test-case", + "slug": "test-case-design", + "title": "Test Case Design, Test Oracles, Test Techniques", + "displayOrder": 4 + }, + { + "id": "cs403-m4-black-box", + "slug": "black-box-testing", + "title": "Black-Box Testing", + "displayOrder": 5 + }, + { + "id": "cs403-m4-white-box", + "slug": "white-box-testing", + "title": "White-Box Unit Testing and Unit Testing Frameworks", + "displayOrder": 6 + }, + { + "id": "cs403-m4-integration", + "slug": "integration-system-testing", + "title": "Integration Testing, System Testing and other Specialized Testing", + "displayOrder": 7 + }, + { + "id": "cs403-m4-test-plan", + "slug": "test-plan-metrics", + "title": "Test Plan, Test Metrics, Testing Tools", + "displayOrder": 8 + }, + { + "id": "cs403-m4-oo-analysis", + "slug": "object-oriented-analysis", + "title": "Introduction to Object-oriented analysis, design and comparison with structured SE", + "displayOrder": 9 + } + ], + "questionIds": [ + "cs403_m4_june2025_q1", + "cs403_m4_june2025_q2", + "cs403_m4_dec2024_q3", + "cs403_m4_dec2024_q4", + "cs403_m4_dec2024_q5", + "cs403_m4_june2024_q6", + "cs403_m4_june2024_q7", + "cs403_m4_june2024_q8", + "cs403_m4_nov2023_q9", + "cs403_m4_nov2023_q10", + "cs403_m4_nov2023_q11", + "cs403_m4_nov2023_q12", + "cs403_m4_nov2023_q13", + "cs403_m4_june2023_q14", + "cs403_m4_june2023_q15", + "cs403_m4_june2023_q16", + "cs403_m4_june2023_q17", + "cs403_m4_june2023_q18", + "cs403_m4_june2023_q19", + "cs403_m4_nov2022_q20", + "cs403_m4_nov2022_q21", + "cs403_m4_nov2022_q22", + "cs403_m4_nov2022_q23" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "cs403-m5", "number": 5, "title": "Software Maintenance & Software Project Measurement", - "hours": 8, + "hours": null, "topics": [ - "Need and Types of Maintenance", - "Software Configuration Management (SCM)", - "Software Change Management", - "Version Control", - "Change control and Reporting", - "Program Comprehension Techniques", - "Re-engineering", - "Reverse Engineering", - "Tool Support", - "Project Management Concepts", - "Feasibility Analysis", - "Project and Process Planning", - "Resources Allocations", - "Software efforts, Schedule, and Cost estimations", - "Project Scheduling and Tracking", - "Risk Assessment and Mitigation", - "Software Quality Assurance (SQA)", - "Project Plan, ProjectMetrics" - ] + { + "id": "cs403-m5-maintenance", + "slug": "software-maintenance", + "title": "Need and Types of Maintenance", + "displayOrder": 1 + }, + { + "id": "cs403-m5-scm", + "slug": "scm", + "title": "Software Configuration Management (SCM), Software Change Management, Version Control, Change control and Reporting", + "displayOrder": 2 + }, + { + "id": "cs403-m5-comprehension", + "slug": "program-comprehension", + "title": "Program Comprehension Techniques", + "displayOrder": 3 + }, + { + "id": "cs403-m5-reengineering", + "slug": "reengineering-reverse-engineering", + "title": "Re-engineering, Reverse Engineering, Tool Support", + "displayOrder": 4 + }, + { + "id": "cs403-m5-project-management", + "slug": "project-management", + "title": "Project Management Concepts, Feasibility Analysis, Project and Process Planning, Resources Allocations", + "displayOrder": 5 + }, + { + "id": "cs403-m5-estimation", + "slug": "effort-schedule-cost", + "title": "Software efforts, Schedule, and Cost estimations", + "displayOrder": 6 + }, + { + "id": "cs403-m5-scheduling", + "slug": "project-scheduling-tracking", + "title": "Project Scheduling and Tracking", + "displayOrder": 7 + }, + { + "id": "cs403-m5-risk", + "slug": "risk-assessment-mitigation", + "title": "Risk Assessment and Mitigation", + "displayOrder": 8 + }, + { + "id": "cs403-m5-sqa", + "slug": "sqa", + "title": "Software Quality Assurance (SQA)", + "displayOrder": 9 + }, + { + "id": "cs403-m5-project-plan", + "slug": "project-plan-metrics", + "title": "Project Plan, Project Metrics", + "displayOrder": 10 + } + ], + "questionIds": [ + "cs403_m5_june2025_q1", + "cs403_m5_june2025_q2", + "cs403_m5_june2024_q3", + "cs403_m5_dec2024_q3", + "cs403_m5_dec2024_q4", + "cs403_m5_dec2024_q5", + "cs403_m5_dec2024_q6", + "cs403_m5_june2024_q7", + "cs403_m5_june2024_q8", + "cs403_m5_nov2023_q9", + "cs403_m5_nov2023_q10", + "cs403_m5_nov2023_q11", + "cs403_m5_nov2023_q12", + "cs403_m5_nov2023_q13", + "cs403_m5_june2023_q14", + "cs403_m5_june2023_q15", + "cs403_m5_june2023_q16", + "cs403_m5_nov2022_q17", + "cs403_m5_nov2022_q18", + "cs403_m5_nov2022_q19" + ], + "predictedQuestionIds": [] } ] -} +} \ No newline at end of file diff --git a/content/rgpv/cse/semester-4/cs-404/pyqs.json b/content/rgpv/cse/semester-4/cs-404/pyqs.json index d508159..1161985 100644 --- a/content/rgpv/cse/semester-4/cs-404/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-404/pyqs.json @@ -2,8 +2,970 @@ "subject": { "id": "cs-404", "code": "CS-404", - "name": "Computer Org. & Architecture (COA)", - "title": "CS-404 - Computer Org. & Architecture (COA)" + "name": "Computer Organization & Architecture", + "title": "AL/CSIT (CI)/CS/CT/CO/IO/IS-404 (GS) – Computer Organization & Architecture", + "semester": "IV", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] -} + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Briefly explain the addressing modes in detail.", + "unit": "Unit 1", + "type": "addressing-modes" + }, + { + "id": "q1b", + "label": "b)", + "text": "Discuss Stack Organization in detail.", + "unit": "Unit 1", + "type": "stack" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is Arithmetic operation? Explain how negative numbers are represented in 2's complement form?", + "unit": "Unit 3", + "type": "arithmetic" + }, + { + "id": "q2b", + "label": "b)", + "text": "Discuss Binary Addition. Explain the concept of Half Adder and Full Adder.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Write a short note on Direct Memory Access (DMA).", + "unit": "Unit 4", + "type": "dma" + }, + { + "id": "q3b", + "label": "b)", + "text": "Explain serial and parallel data transfer techniques in detail.", + "unit": "Unit 4", + "type": "data-transfer" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4", + "label": "", + "text": "What is Cache mapping? Explain all cache mapping techniques in detail.", + "unit": "Unit 5", + "type": "cache" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Write a short note on AMD processor.", + "unit": "Unit 6", + "type": "processor" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the difference between Single and Multi-processor System.", + "unit": "Unit 6", + "type": "multiprocessor" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6", + "label": "", + "text": "Discuss: a) CISC Architecture b) Magnetic Tape.", + "unit": "Unit 6/5", + "type": "mixed" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7", + "label": "", + "text": "Write short notes on: a) Hit Ratio b) Average Access Time.", + "unit": "Unit 5", + "type": "cache" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Briefly explain Hardwired and Micro-programmed control unit.", + "unit": "Unit 2", + "type": "control-unit" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain basic principles of computer architecture.", + "unit": "Unit 1", + "type": "architecture" + }, + { + "id": "q1b", + "label": "b)", + "text": "What is Multiprocessing? Discuss types of data transfer in detail.", + "unit": "Unit 4", + "type": "multiprocessing" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Explain: i) Stack organization ii) Bus structure and addressing modes iii) Fetch and execution cycle.", + "unit": "Unit 1", + "type": "basics" + }, + { + "id": "q2b", + "label": "b)", + "text": "Discuss instruction types and explain execution of micro instruction.", + "unit": "Unit 2", + "type": "control-unit" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Write Booths algorithm. Also explain floating point arithmetic operation.", + "unit": "Unit 3", + "type": "arithmetic" + }, + { + "id": "q3b", + "label": "b)", + "text": "Describe signal addition and subtraction in detail.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Elaborate: i) Serial and parallel data transfer ii) Synchronous and asynchronous modes of data transfer.", + "unit": "Unit 4", + "type": "data-transfer" + }, + { + "id": "q4b", + "label": "b)", + "text": "Write notes on: i) Direct memory access ii) PCI Bus and SCSI Bus.", + "unit": "Unit 4", + "type": "dma" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Compare: i) Main memory and secondary memory ii) Cache memory and Virtual memory.", + "unit": "Unit 5", + "type": "memory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Describe replacement algorithm and write steps to improve cache performance.", + "unit": "Unit 5", + "type": "cache" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Explain characteristics and structure of multiprocessor.", + "unit": "Unit 6", + "type": "multiprocessor" + }, + { + "id": "q6b", + "label": "b)", + "text": "What is concept of pipelining? Differentiate vector processing and array processing.", + "unit": "Unit 6", + "type": "pipelining" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Describe: i) LRU algorithm ii) Two's complement representation iii) Memory management hardware.", + "unit": "Unit 5", + "type": "memory" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is inter-processor communication and synchronization? Also describe inter-processor arbitration.", + "unit": "Unit 6", + "type": "multiprocessor" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "Discuss multicore processor in detail.", + "unit": "Unit 6", + "type": "multicore" + }, + { + "id": "q8b", + "label": "b)", + "text": "Write short notes on: i) Semiconductor memories ii) Hardwired control unit iii) RISC and CISC iv) Micro instruction formats.", + "unit": "Unit 2", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "November 2023", + "year": 2023, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Draw and explain the architecture of a computer system.", + "unit": "Unit 1", + "type": "architecture" + }, + { + "id": "q1b", + "label": "b)", + "text": "Explain the addressing modes with suitable examples.", + "unit": "Unit 1", + "type": "addressing-modes" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Discuss the Booth's algorithm for multiplication of signed numbers.", + "unit": "Unit 3", + "type": "arithmetic" + }, + { + "id": "q2b", + "label": "b)", + "text": "What do you understand by direct memory access? Explain with block diagram how DMA operation is carried out.", + "unit": "Unit 4", + "type": "dma" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Explain the concept of pipelining.", + "unit": "Unit 6", + "type": "pipelining" + }, + { + "id": "q3b", + "label": "b)", + "text": "Differentiate between vectored and non-vectored interrupts.", + "unit": "Unit 4", + "type": "interrupts" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain the instruction formats for computer system.", + "unit": "Unit 1", + "type": "instruction-format" + }, + { + "id": "q4b", + "label": "b)", + "text": "List the differences between volatile and non-volatile memories?", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Discuss memory hierarchy in computer system.", + "unit": "Unit 5", + "type": "memory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the mapping techniques in cache memory.", + "unit": "Unit 5", + "type": "cache" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Explain: i) Cache hit and Cache miss ii) Cache coherency.", + "unit": "Unit 5", + "type": "cache" + }, + { + "id": "q6b", + "label": "b)", + "text": "Write short notes on the USB interface.", + "unit": "Unit 4", + "type": "io" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain RISC Vs CISC.", + "unit": "Unit 6", + "type": "risc-cisc" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain Micro-program sequencer.", + "unit": "Unit 2", + "type": "control-unit" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8a", + "label": "a)", + "text": "What is memory organization? Discuss the different types of memory organization in computer system.", + "unit": "Unit 5", + "type": "memory" + }, + { + "id": "q8b", + "label": "b)", + "text": "Explain the PCI, BUS and LRU algorithm in briefly.", + "unit": "Unit 4", + "type": "io" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the role and significance of registers in a CPU's general register organization.", + "unit": "Unit 1", + "type": "registers" + }, + { + "id": "q1b", + "label": "b)", + "text": "Differentiate between Hardwired control unit and Micro-programmed control unit.", + "unit": "Unit 2", + "type": "control-unit" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is register transfer language? Explain representation of instructions in RTL with suitable examples.", + "unit": "Unit 1", + "type": "rtl" + }, + { + "id": "q2b", + "label": "b)", + "text": "Discuss how two's complement is used for representing negative numbers and performing subtraction as addition with complement.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Discuss how binary division is performed and the steps involved with flowchart.", + "unit": "Unit 3", + "type": "arithmetic" + }, + { + "id": "q3b", + "label": "b)", + "text": "Design a 4-bit adder/subtractor circuit and explain how addition and subtraction are performed.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Why interface is needed in input output device? Explain how it is connected to I/O devices with neat sketch.", + "unit": "Unit 4", + "type": "io" + }, + { + "id": "q4b", + "label": "b)", + "text": "Describe the strobe control and hand shaking methods in asynchronous data transfer.", + "unit": "Unit 4", + "type": "data-transfer" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What is the need of I/O processor? Explain the working of I/O processor.", + "unit": "Unit 4", + "type": "io" + }, + { + "id": "q5b", + "label": "b)", + "text": "Discuss different types of secondary memory devices (HDDs, magnetic tapes, optical discs). Compare advantages and disadvantages.", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Define cache memory and explain its role in improving CPU performance. Discuss principles of locality.", + "unit": "Unit 5", + "type": "cache" + }, + { + "id": "q6b", + "label": "b)", + "text": "Describe the role of MMU in a computer system. Explain address translation between virtual and physical addresses.", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Define RISC and CISC architectures and explain their fundamental differences.", + "unit": "Unit 6", + "type": "risc-cisc" + }, + { + "id": "q7b", + "label": "b)", + "text": "Discuss how pipelining improves instruction execution throughput and overall system performance.", + "unit": "Unit 6", + "type": "pipelining" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Bus structure b) SCSI Bus c) Random Access Memory d) Inter processor arbitration.", + "unit": "Unit 1/4/5/6", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Differentiate between accumulator, index, stack and general-purpose registers in terms of their functions and usage.", + "unit": "Unit 1", + "type": "registers" + }, + { + "id": "q1b", + "label": "b)", + "text": "Discuss the sequence of steps involved in fetching an instruction from memory and executing it.", + "unit": "Unit 2", + "type": "control-unit" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Describe how micro instructions are arranged in control memory and how they are interpreted.", + "unit": "Unit 2", + "type": "control-unit" + }, + { + "id": "q2b", + "label": "b)", + "text": "Draw flowchart for Booth's algorithm for multiplication of signed 2's complement numbers and explain with example.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Describe basic arithmetic operations supported by floating-point arithmetic including addition, subtraction, multiplication and division.", + "unit": "Unit 3", + "type": "arithmetic" + }, + { + "id": "q3b", + "label": "b)", + "text": "What components are required to design the arithmetic unit? Explain with neat sketch.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Discuss fundamental differences between serial and parallel data transfer methods in terms of data transmission, speed and implementation complexity.", + "unit": "Unit 4", + "type": "data-transfer" + }, + { + "id": "q4b", + "label": "b)", + "text": "What is direct memory transfer? Give an overview and block diagram of a DMA controller.", + "unit": "Unit 4", + "type": "dma" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Differentiate synchronous and asynchronous data transfer.", + "unit": "Unit 4", + "type": "data-transfer" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the concept of memory hierarchy and its significance in modern computer systems.", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Compare and contrast different cache mapping techniques: direct mapping, set-associative and fully associative. Discuss advantages and disadvantages.", + "unit": "Unit 5", + "type": "cache" + }, + { + "id": "q6b", + "label": "b)", + "text": "Explain memory segmentation and how it complements virtual memory. Discuss advantages and challenges.", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Describe different types of interconnection networks used in multiprocessor systems.", + "unit": "Unit 6", + "type": "multiprocessor" + }, + { + "id": "q7b", + "label": "b)", + "text": "Define array processing and explain its significance in computer architecture and parallel computing.", + "unit": "Unit 6", + "type": "array-processing" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Instruction types b) PCI Bus c) Read Only Memory d) Inter-processor communication and synchronization.", + "unit": "Unit 2/4/5/6", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Discuss the structure and role of program counter, instruction register and memory register during a fetch-execute cycle.", + "unit": "Unit 2", + "type": "control-unit" + }, + { + "id": "q1b", + "label": "b)", + "text": "How does the control word help in micro-operation execution? Illustrate with an example.", + "unit": "Unit 1", + "type": "micro-operations" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Illustrate the concept of bus structure. How does it aid in CPU and memory communication?", + "unit": "Unit 1", + "type": "bus" + }, + { + "id": "q2b", + "label": "b)", + "text": "Explain 1's and 2's complement representation for negative numbers with examples.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Describe Booth's algorithm for multiplication. Illustrate with a 4-bit example.", + "unit": "Unit 3", + "type": "arithmetic" + }, + { + "id": "q3b", + "label": "b)", + "text": "Compare fixed point and floating point arithmetic operations with examples.", + "unit": "Unit 3", + "type": "arithmetic" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "How does USB differ from SCSI bus in terms of speed, cost and application?", + "unit": "Unit 4", + "type": "io" + }, + { + "id": "q4b", + "label": "b)", + "text": "Write a comparative note on different types of I/O interfaces.", + "unit": "Unit 4", + "type": "io" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain the working of PCI bus. How does it improve I/O performance?", + "unit": "Unit 4", + "type": "io" + }, + { + "id": "q5b", + "label": "b)", + "text": "Differentiate magnetic tape, disk and optical storage based on access time, reliability and cost.", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "How does cache memory improve system performance? Explain cache design.", + "unit": "Unit 5", + "type": "cache" + }, + { + "id": "q6b", + "label": "b)", + "text": "Write a program in Pseudo code to simulate page replacement using LRU.", + "unit": "Unit 5", + "type": "memory" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Describe the structure and working of inter-processor communication and synchronization.", + "unit": "Unit 5", + "type": "multiprocessor" + }, + { + "id": "q7b", + "label": "b)", + "text": "Compare RISC and CISC architectures with examples.", + "unit": "Unit 5", + "type": "risc-cisc" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on any two: a) Direct Memory Access b) Virtual Memory c) Read Only Memory.", + "unit": "Unit 4/5", + "type": "mixed" + } + ] + } + ] + } + ] +} \ No newline at end of file diff --git a/content/rgpv/cse/semester-4/cs-404/syllabus.json b/content/rgpv/cse/semester-4/cs-404/syllabus.json index 8124271..2794bf2 100644 --- a/content/rgpv/cse/semester-4/cs-404/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-404/syllabus.json @@ -3,100 +3,403 @@ "id": "cs-404", "code": "CS-404", "name": "Computer Org. & Architecture", - "title": "CS-404 - Computer Org. & Architecture", - "semester": "IV" + "title": "CS-404 – Computer Org. & Architecture (COA)", + "university": "Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal", + "scheme": "New Scheme Based On AICTE Flexible Curricula", + "semester": "IV", + "branch": "CSE-Computer Science Engineering" }, "modules": [ { - "id": "module-1", + "id": "cs404-m1", "number": 1, "title": "Basic Structure of Computer", - "hours": 8, + "hours": null, "topics": [ - "Structure of Desktop Computers", - "CPU: General Register Organization-Memory Register, Instruction Register, Control Word, Stack Organization", - "Instruction Format", - "ALU", - "I/O System", - "bus", - "CPU and Memory Program Counter", - "Bus Structure", - "Register Transfer Language-Bus and Memory Transfer", - "addressing modes" - ] + { + "id": "cs404-m1-desktop-structure", + "slug": "desktop-structure", + "title": "Structure of Desktop Computers", + "displayOrder": 1 + }, + { + "id": "cs404-m1-cpu-registers", + "slug": "cpu-general-register-organization", + "title": "CPU: General Register Organization-Memory Register, Instruction Register, Control Word", + "displayOrder": 2 + }, + { + "id": "cs404-m1-stack-org", + "slug": "stack-organization", + "title": "Stack Organization", + "displayOrder": 3 + }, + { + "id": "cs404-m1-instruction-format", + "slug": "instruction-format", + "title": "Instruction Format", + "displayOrder": 4 + }, + { + "id": "cs404-m1-alu-io", + "slug": "alu-io-system-bus", + "title": "ALU, I/O System, bus", + "displayOrder": 5 + }, + { + "id": "cs404-m1-pc-bus-rtl", + "slug": "cpu-memory-pc-bus-rtl", + "title": "CPU and Memory Program Counter, Bus Structure, Register Transfer Language-Bus and Memory Transfer", + "displayOrder": 6 + }, + { + "id": "cs404-m1-addressing-modes", + "slug": "addressing-modes", + "title": "Addressing modes", + "displayOrder": 7 + } + ], + "questionIds": [ + "cs404_m1_june2025_q1", + "cs404_m1_june2025_q2", + "cs404_m1_dec2024_q3", + "cs404_m1_june2024_q4", + "cs404_m1_june2024_q5", + "cs404_m1_june2024_q6", + "cs404_m1_nov2023_q7", + "cs404_m1_nov2023_q8", + "cs404_m1_nov2023_q9", + "cs404_m1_june2023_q10", + "cs404_m1_june2023_q11", + "cs404_m1_nov2022_q12", + "cs404_m1_nov2022_q13" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "cs404-m2", "number": 2, "title": "Control Unit Organization", - "hours": 8, + "hours": null, "topics": [ - "Basic Concept of Instruction", - "Instruction Types", - "Micro Instruction Formats", - "Fetch and Execution cycle", - "Hardwired control unit", - "Microprogrammed Control unit microprogram sequencer Control Memory", - "Sequencing and Execution of Micro Instruction" - ] + { + "id": "cs404-m2-instruction-types", + "slug": "instruction-types", + "title": "Basic Concept of Instruction, Instruction Types", + "displayOrder": 1 + }, + { + "id": "cs404-m2-micro-instruction", + "slug": "micro-instruction-formats", + "title": "Micro Instruction Formats", + "displayOrder": 2 + }, + { + "id": "cs404-m2-fetch-execute", + "slug": "fetch-execution-cycle", + "title": "Fetch and Execution cycle", + "displayOrder": 3 + }, + { + "id": "cs404-m2-hardwired-control", + "slug": "hardwired-control-unit", + "title": "Hardwired control unit", + "displayOrder": 4 + }, + { + "id": "cs404-m2-microprogrammed-control", + "slug": "microprogrammed-control-unit", + "title": "Microprogrammed Control unit microprogram sequencer Control Memory, Sequencing and Execution of Micro Instruction", + "displayOrder": 5 + } + ], + "questionIds": [ + "cs404_m2_june2025_q1", + "cs404_m2_dec2024_q2", + "cs404_m2_dec2024_q3", + "cs404_m2_dec2024_q4", + "cs404_m2_june2024_q5", + "cs404_m2_nov2023_q6", + "cs404_m2_june2023_q7", + "cs404_m2_june2023_q8", + "cs404_m2_nov2022_q9" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "cs404-m3", "number": 3, "title": "Computer Arithmetic", - "hours": 8, + "hours": null, "topics": [ - "Addition and Subtraction", - "Tools Compliment Representation", - "Signed Addition and Subtraction", - "Multiplication and division", - "Booths Algorithm", - "Division Operation", - "Floating Point Arithmetic Operation", - "design of Arithmetic unit" - ] + { + "id": "cs404-m3-add-sub", + "slug": "addition-subtraction", + "title": "Addition and Subtraction", + "displayOrder": 1 + }, + { + "id": "cs404-m3-complement", + "slug": "twos-complement-representation", + "title": "Two's Complement Representation, Signed Addition and Subtraction", + "displayOrder": 2 + }, + { + "id": "cs404-m3-multiplication-division", + "slug": "multiplication-division", + "title": "Multiplication and division", + "displayOrder": 3 + }, + { + "id": "cs404-m3-booths-algorithm", + "slug": "booths-algorithm", + "title": "Booth's Algorithm", + "displayOrder": 4 + }, + { + "id": "cs404-m3-division-operation", + "slug": "division-operation", + "title": "Division Operation", + "displayOrder": 5 + }, + { + "id": "cs404-m3-floating-point", + "slug": "floating-point-arithmetic", + "title": "Floating Point Arithmetic Operation", + "displayOrder": 6 + }, + { + "id": "cs404-m3-arithmetic-unit", + "slug": "arithmetic-unit-design", + "title": "Design of Arithmetic unit", + "displayOrder": 7 + } + ], + "questionIds": [ + "cs404_m3_june2025_q1", + "cs404_m3_june2025_q2", + "cs404_m3_june2025_q3", + "cs404_m3_dec2024_q4", + "cs404_m3_dec2024_q5", + "cs404_m3_dec2024_q6", + "cs404_m3_june2024_q7", + "cs404_m3_june2024_q8", + "cs404_m3_june2024_q9", + "cs404_m3_nov2023_q10", + "cs404_m3_june2023_q11", + "cs404_m3_june2023_q12", + "cs404_m3_nov2022_q13", + "cs404_m3_nov2022_q14" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "cs404-m4", "number": 4, "title": "I/O Organization", - "hours": 8, + "hours": null, "topics": [ - "I/O Interface –PCI Bus, SCSI Bus, USB", - "Data Transfer: Serial, Parallel, Synchronous, Asynchronous Modes of Data Transfer", - "Direct Memory Access(DMA)", - "I/O Processor" - ] + { + "id": "cs404-m4-io-interface", + "slug": "io-interface-pci-scsi-usb", + "title": "I/O Interface –PCI Bus, SCSI Bus, USB", + "displayOrder": 1 + }, + { + "id": "cs404-m4-data-transfer", + "slug": "data-transfer-modes", + "title": "Data Transfer: Serial, Parallel, Synchronous, Asynchronous Modes of Data Transfer", + "displayOrder": 2 + }, + { + "id": "cs404-m4-dma", + "slug": "direct-memory-access", + "title": "Direct Memory Access(DMA)", + "displayOrder": 3 + }, + { + "id": "cs404-m4-io-processor", + "slug": "io-processor", + "title": "I/O Processor", + "displayOrder": 4 + } + ], + "questionIds": [ + "cs404_m4_june2025_q1", + "cs404_m4_june2025_q2", + "cs404_m4_june2025_q3", + "cs404_m4_june2025_q4", + "cs404_m4_dec2024_q5", + "cs404_m4_dec2024_q6", + "cs404_m4_dec2024_q7", + "cs404_m4_dec2024_q8", + "cs404_m4_june2024_q9", + "cs404_m4_june2024_q10", + "cs404_m4_june2024_q11", + "cs404_m4_june2024_q12", + "cs404_m4_nov2023_q13", + "cs404_m4_nov2023_q14", + "cs404_m4_nov2023_q15", + "cs404_m4_nov2023_q16", + "cs404_m4_june2023_q17", + "cs404_m4_june2023_q18", + "cs404_m4_june2023_q19", + "cs404_m4_nov2022_q20", + "cs404_m4_nov2022_q21" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "cs404-m5", "number": 5, "title": "Memory Organization", - "hours": 8, + "hours": null, "topics": [ - "Main memory-RAM, ROM", - "Secondary Memory –Magnetic Tape, Disk, Optical Storage", - "Cache Memory: Cache Structure and Design, Mapping Scheme, Replacement Algorithm, Improving Cache Performance", - "Virtual Memory", - "memory management hardware" - ] + { + "id": "cs404-m5-main-memory", + "slug": "main-memory-ram-rom", + "title": "Main memory-RAM, ROM", + "displayOrder": 1 + }, + { + "id": "cs404-m5-secondary-memory", + "slug": "secondary-memory", + "title": "Secondary Memory –Magnetic Tape, Disk, Optical Storage", + "displayOrder": 2 + }, + { + "id": "cs404-m5-cache-structure", + "slug": "cache-structure-design", + "title": "Cache Memory: Cache Structure and Design", + "displayOrder": 3 + }, + { + "id": "cs404-m5-mapping", + "slug": "cache-mapping-schemes", + "title": "Mapping Scheme", + "displayOrder": 4 + }, + { + "id": "cs404-m5-replacement", + "slug": "replacement-algorithms", + "title": "Replacement Algorithm", + "displayOrder": 5 + }, + { + "id": "cs404-m5-cache-performance", + "slug": "cache-performance-improvement", + "title": "Improving Cache Performance", + "displayOrder": 6 + }, + { + "id": "cs404-m5-virtual-memory", + "slug": "virtual-memory", + "title": "Virtual Memory", + "displayOrder": 7 + }, + { + "id": "cs404-m5-mmu", + "slug": "memory-management-hardware", + "title": "Memory management hardware", + "displayOrder": 8 + } + ], + "questionIds": [ + "cs404_m5_june2025_q1", + "cs404_m5_june2025_q2", + "cs404_m5_june2025_q3", + "cs404_m5_june2025_q4", + "cs404_m5_dec2024_q5", + "cs404_m5_dec2024_q6", + "cs404_m5_dec2024_q7", + "cs404_m5_dec2024_q8", + "cs404_m5_june2024_q9", + "cs404_m5_june2024_q10", + "cs404_m5_june2024_q11", + "cs404_m5_june2024_q12", + "cs404_m5_nov2023_q13", + "cs404_m5_nov2023_q14", + "cs404_m5_nov2023_q15", + "cs404_m5_nov2023_q16", + "cs404_m5_nov2023_q17", + "cs404_m5_june2023_q18", + "cs404_m5_june2023_q19", + "cs404_m5_june2023_q20", + "cs404_m5_nov2022_q21", + "cs404_m5_nov2022_q22", + "cs404_m5_nov2022_q23" + ], + "predictedQuestionIds": [] }, { - "id": "module-6", + "id": "cs404-m6", "number": 6, "title": "Multiprocessors", - "hours": 8, + "hours": null, "topics": [ - "Characteristics of Multiprocessor", - "Structure of Multiprocessor-Inter-processor Arbitration", - "Inter-Processor Communication and Synchronization", - "Memory in Multiprocessor System", - "Concept of Pipelining", - "Vector Processing", - "Array Processing", - "RISC And CISC", - "Study of Multicore Processor –Intel, AMD" - ] + { + "id": "cs404-m6-multiprocessor-structure", + "slug": "multiprocessor-characteristics-structure", + "title": "Characteristics of Multiprocessor, Structure of Multiprocessor", + "displayOrder": 1 + }, + { + "id": "cs404-m6-interprocessor", + "slug": "interprocessor-arbitration-communication", + "title": "Inter-processor Arbitration, Inter-Processor Communication and Synchronization", + "displayOrder": 2 + }, + { + "id": "cs404-m6-memory-mp", + "slug": "memory-multiprocessor-system", + "title": "Memory in Multiprocessor System", + "displayOrder": 3 + }, + { + "id": "cs404-m6-pipelining", + "slug": "pipelining", + "title": "Concept of Pipelining", + "displayOrder": 4 + }, + { + "id": "cs404-m6-vector-array", + "slug": "vector-array-processing", + "title": "Vector Processing, Array Processing", + "displayOrder": 5 + }, + { + "id": "cs404-m6-risc-cisc", + "slug": "risc-and-cisc", + "title": "RISC And CISC", + "displayOrder": 6 + }, + { + "id": "cs404-m6-multicore", + "slug": "multicore-processors", + "title": "Study of Multicore Processor –Intel, AMD", + "displayOrder": 7 + } + ], + "questionIds": [ + "cs404_m6_june2025_q1", + "cs404_m6_june2025_q2", + "cs404_m6_dec2024_q3", + "cs404_m6_dec2024_q4", + "cs404_m6_dec2024_q5", + "cs404_m6_june2024_q6", + "cs404_m6_june2024_q7", + "cs404_m6_june2024_q8", + "cs404_m6_nov2023_q9", + "cs404_m6_nov2023_q10", + "cs404_m6_june2023_q11", + "cs404_m6_june2023_q12", + "cs404_m6_june2023_q13", + "cs404_m6_june2023_q14", + "cs404_m6_nov2022_q15", + "cs404_m6_nov2022_q16", + "cs404_m6_nov2022_q17" + ], + "predictedQuestionIds": [] } ] -} +} \ No newline at end of file diff --git a/content/rgpv/cse/semester-4/cs-405/pyqs.json b/content/rgpv/cse/semester-4/cs-405/pyqs.json index b208aae..187c824 100644 --- a/content/rgpv/cse/semester-4/cs-405/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-405/pyqs.json @@ -2,8 +2,928 @@ "subject": { "id": "cs-405", "code": "CS-405", - "name": "Operating Systems (OS)", - "title": "CS-405 - Operating Systems (OS)" + "name": "Operating Systems", + "title": "AD/CD/CS/SD-405 (GS) – Operating Systems", + "semester": "IV", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, - "papers": [] -} + "papers": [ + { + "exam": "November 2022", + "year": 2022, + "month": "November", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the different types of services in Operating system and its features.", + "unit": "Unit 1", + "type": "os-basics" + }, + { + "id": "q1b", + "label": "b)", + "text": "Define the Utility programs with example. Explain system call.", + "unit": "Unit 1", + "type": "system-calls" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is Process? Explain the process states diagram.", + "unit": "Unit 3", + "type": "process" + }, + { + "id": "q2b", + "label": "b)", + "text": "Solve using preemptive priority scheduling algorithm for given processes. Draw Gantt chart and calculate Average waiting time and Turnaround time.", + "unit": "Unit 3", + "type": "cpu-scheduling" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Consider the given resource allocation graph. Find if the system is in a deadlock state otherwise find a safe sequence.", + "unit": "Unit 4", + "type": "deadlock" + }, + { + "id": "q3b", + "label": "b)", + "text": "Difference between Deadlock and Starvation. Explain the necessary Condition for Deadlock.", + "unit": "Unit 4", + "type": "deadlock" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain the types of Semaphores in process synchronization.", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q4b", + "label": "b)", + "text": "What are the different criteria for evaluating the CPU scheduling algorithm?", + "unit": "Unit 3", + "type": "cpu-scheduling" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Consider system with byte-addressable memory, 32-bit logical addresses, 4KB page size, 4-byte page table entries. Find page table size in MB.", + "unit": "Unit 3", + "type": "memory" + }, + { + "id": "q5b", + "label": "b)", + "text": "Describe fixed and variable partitioned contiguous memory allocation scheme with merits and demerits.", + "unit": "Unit 3", + "type": "memory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Disk requests for cylinders 10,22,20,2,40,6,38 at cylinder 20. Find total seek time for FCFS and SCAN (6ms/cylinder).", + "unit": "Unit 2", + "type": "disk-scheduling" + }, + { + "id": "q6b", + "label": "b)", + "text": "How many types of disk allocation methods? Describe Indexed method with merits and demerits.", + "unit": "Unit 2", + "type": "file-system" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain the deadlock recovery in brief.", + "unit": "Unit 4", + "type": "deadlock" + }, + { + "id": "q7b", + "label": "b)", + "text": "Explain the I/O buffering and Interrupt driven operation in short.", + "unit": "Unit 4", + "type": "io" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two): a) Distributed OS b) Multiprocessor OS c) Network OS d) Paged Segmentation.", + "unit": "Unit 5/3", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2023", + "year": 2023, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Define an operating system. What are the goals of an operating system? Explain.", + "unit": "Unit 1", + "type": "os-basics" + }, + { + "id": "q1b", + "label": "b)", + "text": "Describe the differences among short term, medium term and long term scheduling.", + "unit": "Unit 3", + "type": "cpu-scheduling" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is meant by system call? How it can be used. How does an application program use these call during execution?", + "unit": "Unit 1", + "type": "system-calls" + }, + { + "id": "q2b", + "label": "b)", + "text": "Define Process States. Draw the diagram of PCB.", + "unit": "Unit 3", + "type": "process" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Disk drive with 200 cylinders (0-199), work queue: 23,89,132,42,187. Determine total distance for SCAN and LOOK.", + "unit": "Unit 2", + "type": "disk-scheduling" + }, + { + "id": "q3b", + "label": "b)", + "text": "List the advantages and disadvantages of Magnetic Tape memory.", + "unit": "Unit 2", + "type": "file-system" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Explain in detail about various ways of free space management.", + "unit": "Unit 2", + "type": "file-system" + }, + { + "id": "q4b", + "label": "b)", + "text": "What is the difference between threads and process.", + "unit": "Unit 3", + "type": "process" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain paging and segmentation. How are they helpful in removing fragmentation?", + "unit": "Unit 3", + "type": "memory" + }, + { + "id": "q5b", + "label": "b)", + "text": "What is deadlock prevention? A computer has six tape drives, each process needs two. For which values of n is the system deadlock free?", + "unit": "Unit 4", + "type": "deadlock" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Explain mutual exclusion with suitable example.", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q6b", + "label": "b)", + "text": "Discuss Reader-Writers solution using Monitors.", + "unit": "Unit 4", + "type": "synchronization" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain file system used in Linux and Windows.", + "unit": "Unit 5", + "type": "os-comparison" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is a file? Briefly explain different directory structures. What kind of directory structure is used in UNIX?", + "unit": "Unit 2", + "type": "file-system" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on: a) Concurrent Programming b) Virus c) Remote Procedure Call (RPC) d) Time Sharing.", + "unit": "Unit 4/5/1", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "June 2024", + "year": 2024, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "In multiprogramming/time-sharing, several users share system. What are two security problems? Can same security be ensured as dedicated machine?", + "unit": "Unit 1", + "type": "os-basics" + }, + { + "id": "q1b", + "label": "b)", + "text": "What are the five major activities of an operating system in regards to process management?", + "unit": "Unit 3", + "type": "process" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Why do some systems keep track of file type while others don't? Which system is better?", + "unit": "Unit 2", + "type": "file-system" + }, + { + "id": "q2b", + "label": "b)", + "text": "For a file system with 512-byte blocks, explain logical-to-physical address mapping for contiguous, linked and indexed allocation.", + "unit": "Unit 2", + "type": "file-system" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "What resources are used when a thread is created? How do they differ from process creation?", + "unit": "Unit 3", + "type": "process" + }, + { + "id": "q3b", + "label": "b)", + "text": "Given a segment table, find physical addresses for logical addresses: 0430, 110, 2500, 3400.", + "unit": "Unit 3", + "type": "memory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What is busy waiting? What other kinds of waiting exist? Can busy waiting be avoided?", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q4b", + "label": "b)", + "text": "Can a system detect starving processes? Explain how or how to deal with starvation.", + "unit": "Unit 3", + "type": "cpu-scheduling" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What are the advantages and disadvantages of making the computer network transparent to the user?", + "unit": "Unit 5", + "type": "distributed-os" + }, + { + "id": "q5b", + "label": "b)", + "text": "List three possible types of failures in a distributed system.", + "unit": "Unit 5", + "type": "distributed-os" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "What are the benefits of mapping objects into virtual memory? Explain.", + "unit": "Unit 3", + "type": "memory" + }, + { + "id": "q6b", + "label": "b)", + "text": "What are the benefits of DFS compared to a file system in a centralized system?", + "unit": "Unit 5", + "type": "distributed-os" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Why Semaphore is important in OS? Explain Binary and counting semaphores with example.", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q7b", + "label": "b)", + "text": "What is Overlay? How do dynamic linking and loading perform in memory management?", + "unit": "Unit 3", + "type": "memory" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two): a) Synchronization b) Paging c) System Calls.", + "unit": "Unit 4/3/1", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2024", + "year": 2024, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1", + "label": "", + "text": "Explain the need for the Process Control Block (PCB) fields.", + "unit": "Unit 3", + "type": "process" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2", + "label": "", + "text": "Given processes with burst time, priority and arrival time. Find scheduling sequence, turnaround time and waiting time for FCFS, RR(q=3), preemptive SJF.", + "unit": "Unit 3", + "type": "cpu-scheduling" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3", + "label": "", + "text": "How multilevel feedback queue scheduling differs from multilevel queue scheduling.", + "unit": "Unit 3", + "type": "cpu-scheduling" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4", + "label": "", + "text": "What is Resource Allocation Graph? Explain occurrence and avoidance of deadlock among 3 processes and 3 resources.", + "unit": "Unit 4", + "type": "deadlock" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5", + "label": "", + "text": "Page requests: 1,2,3,5,4,1,2,5,3,2,4,3. With three frames, how many page faults using Optimal Page Replacement?", + "unit": "Unit 3", + "type": "memory" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6", + "label": "", + "text": "Write short notes on (any two): a) Thrashing b) LRU algorithm c) PCB d) Contiguous and Linked Disk Allocation e) Optimal Page Replacement f) Interrupts g) Multilevel Feedback Queue Scheduling.", + "unit": "Unit 3/2/4", + "type": "mixed" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7", + "label": "", + "text": "Define the term 'Directory'. Explain any two schemes of logical directory structures.", + "unit": "Unit 2", + "type": "file-system" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "When do page-faults occur? Describe the action taken by the OS when page-fault occurs.", + "unit": "Unit 3", + "type": "memory" + } + ] + } + ] + }, + { + "exam": "June 2025", + "year": 2025, + "month": "June", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "What are the five major activities of an operating system in regards to memory management?", + "unit": "Unit 3", + "type": "memory" + }, + { + "id": "q1b", + "label": "b)", + "text": "List the functions of OS. How operating system perform management task in a system?", + "unit": "Unit 1", + "type": "os-basics" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "Give an example of an application where data should be accessed sequentially and randomly.", + "unit": "Unit 2", + "type": "file-system" + }, + { + "id": "q2b", + "label": "b)", + "text": "Disk with 5000 cylinders at cylinder 143, previous at 125. Find total distance for SSTF, SCAN and LOOK for given queue.", + "unit": "Unit 2", + "type": "disk-scheduling" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "Consider variant of RR where entries in ready queue are pointers to PCB. Effect of two pointers to same process? Major advantage and drawback?", + "unit": "Unit 3", + "type": "cpu-scheduling" + }, + { + "id": "q3b", + "label": "b)", + "text": "How many page faults for optimal page replacement with 4 frames for given reference string?", + "unit": "Unit 3", + "type": "memory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "Process P wants to wait for two messages from mailbox A and B. What sequence of send/receive?", + "unit": "Unit 4", + "type": "ipc" + }, + { + "id": "q4b", + "label": "b)", + "text": "Why use interrupt-driven I/O for single serial port but polling I/O for terminal concentrator?", + "unit": "Unit 4", + "type": "io" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "What aspects of a distributed system would you select for a system running on a totally reliable network?", + "unit": "Unit 5", + "type": "distributed-os" + }, + { + "id": "q5b", + "label": "b)", + "text": "List three possible types of failures in a distributed system.", + "unit": "Unit 5", + "type": "distributed-os" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Define a semaphore for dining philosopher's problem.", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q6b", + "label": "b)", + "text": "Describe method for process migration across different architectures running same OS and different OS.", + "unit": "Unit 5", + "type": "distributed-os" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Explain concurrency controls. Differences between real and virtual concurrency?", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q7b", + "label": "b)", + "text": "How process is differing from program? Describe process transition diagram in detail.", + "unit": "Unit 3", + "type": "process" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two): a) Deadlock prevention and avoidance b) Kernel architecture in Unix c) System calls.", + "unit": "Unit 4/5/1", + "type": "mixed" + } + ] + } + ] + }, + { + "exam": "December 2025", + "year": 2025, + "month": "December", + "questions": [ + { + "id": "q1", + "questionNumber": "Q.1", + "subQuestions": [ + { + "id": "q1a", + "label": "a)", + "text": "Explain the evolution of operating system in detail.", + "unit": "Unit 1", + "type": "os-basics" + }, + { + "id": "q1b", + "label": "b)", + "text": "List the functions of OS. How operating system perform management task in a system?", + "unit": "Unit 1", + "type": "os-basics" + } + ] + }, + { + "id": "q2", + "questionNumber": "Q.2", + "subQuestions": [ + { + "id": "q2a", + "label": "a)", + "text": "What is a File? Write different file attributes and operations?", + "unit": "Unit 2", + "type": "file-system" + }, + { + "id": "q2b", + "label": "b)", + "text": "For a file system with 512-byte blocks, explain logical-to-physical address mapping for contiguous, linked and indexed allocation.", + "unit": "Unit 2", + "type": "file-system" + } + ] + }, + { + "id": "q3", + "questionNumber": "Q.3", + "subQuestions": [ + { + "id": "q3a", + "label": "a)", + "text": "How process is differing from program? Describe process transition diagram in detail.", + "unit": "Unit 3", + "type": "process" + }, + { + "id": "q3b", + "label": "b)", + "text": "Given a segment table, find physical addresses for logical addresses: 0430, 110, 2500, 3400.", + "unit": "Unit 3", + "type": "memory" + } + ] + }, + { + "id": "q4", + "questionNumber": "Q.4", + "subQuestions": [ + { + "id": "q4a", + "label": "a)", + "text": "What are the five major activities of an operating system in regards to memory management?", + "unit": "Unit 3", + "type": "memory" + }, + { + "id": "q4b", + "label": "b)", + "text": "What is busy waiting? What other kinds of waiting exist? Can busy waiting be avoided?", + "unit": "Unit 4", + "type": "synchronization" + } + ] + }, + { + "id": "q5", + "questionNumber": "Q.5", + "subQuestions": [ + { + "id": "q5a", + "label": "a)", + "text": "Explain concurrency controls. Differences between real and virtual concurrency?", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q5b", + "label": "b)", + "text": "Explain the concept of buffering and spooling.", + "unit": "Unit 4", + "type": "io" + } + ] + }, + { + "id": "q6", + "questionNumber": "Q.6", + "subQuestions": [ + { + "id": "q6a", + "label": "a)", + "text": "Why Semaphore is important in OS? Explain Binary and counting semaphores with suitable example.", + "unit": "Unit 4", + "type": "synchronization" + }, + { + "id": "q6b", + "label": "b)", + "text": "What are the advantages and disadvantages of making the computer network transparent to the user?", + "unit": "Unit 5", + "type": "distributed-os" + } + ] + }, + { + "id": "q7", + "questionNumber": "Q.7", + "subQuestions": [ + { + "id": "q7a", + "label": "a)", + "text": "Discuss the design issues of distributed operating system.", + "unit": "Unit 5", + "type": "distributed-os" + }, + { + "id": "q7b", + "label": "b)", + "text": "List three possible types of failures in a distributed system.", + "unit": "Unit 5", + "type": "distributed-os" + } + ] + }, + { + "id": "q8", + "questionNumber": "Q.8", + "subQuestions": [ + { + "id": "q8", + "label": "", + "text": "Write short notes on (any two): a) Synchronization b) Demand paging c) System calls d) Kernel architecture in Unix.", + "unit": "Unit 4/3/1/5", + "type": "mixed" + } + ] + } + ] + } + ] +} \ No newline at end of file diff --git a/content/rgpv/cse/semester-4/cs-405/syllabus.json b/content/rgpv/cse/semester-4/cs-405/syllabus.json index c2dcaf2..6b7a17c 100644 --- a/content/rgpv/cse/semester-4/cs-405/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-405/syllabus.json @@ -3,86 +3,251 @@ "id": "cs-405", "code": "CS-405", "name": "Operating Systems", - "title": "CS-405 - Operating Systems", - "semester": "IV" + "title": "CS-405 – Operating Systems (OS)", + "university": "Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal", + "scheme": "New Scheme Based On AICTE Flexible Curricula", + "semester": "IV", + "branch": "CSE-Computer Science Engineering" }, "modules": [ { - "id": "module-1", + "id": "cs405-m1", "number": 1, "title": "Introduction to Operating Systems", - "hours": 8, + "hours": null, "topics": [ - "Function, Evolution, Different Types", - "Desirable Characteristics and features of an O/S", - "Operating Systems Services: Types of Services, Different ways of providing these Services – Utility Programs, System Calls" - ] + { + "id": "cs405-m1-functions-evolution", + "slug": "functions-evolution-types", + "title": "Function, Evolution, Different Types", + "displayOrder": 1 + }, + { + "id": "cs405-m1-characteristics", + "slug": "desirable-characteristics-features", + "title": "Desirable Characteristics and features of an O/S", + "displayOrder": 2 + }, + { + "id": "cs405-m1-services", + "slug": "operating-systems-services", + "title": "Operating Systems Services: Types of Services, Different ways of providing these Services – Utility Programs, System Calls", + "displayOrder": 3 + } + ], + "questionIds": [ + "cs405_m1_nov2022_q1", + "cs405_m1_nov2022_q2", + "cs405_m1_june2023_q3", + "cs405_m1_june2023_q4", + "cs405_m1_june2024_q5", + "cs405_m1_june2025_q6", + "cs405_m1_june2025_q7", + "cs405_m1_june2023_q8", + "cs405_m1_june2024_dec2024_june2025_q9" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "cs405-m2", "number": 2, "title": "File Systems", - "hours": 8, + "hours": null, "topics": [ - "File Concept", - "User’s and System Programmer’s view of File System", - "Disk Organization, Tape Organization", - "Different Modules of a File System", - "Disk Space Allocation Methods – Contiguous, Linked, Indexed", - "Directory Structures", - "File Protection", - "System Calls for File Management", - "Disk Scheduling Algorithms" - ] + { + "id": "cs405-m2-file-concept", + "slug": "file-concept-views", + "title": "File Concept, User's and System Programmer's view of File System", + "displayOrder": 1 + }, + { + "id": "cs405-m2-disk-tape-org", + "slug": "disk-tape-organization", + "title": "Disk Organization, Tape Organization", + "displayOrder": 2 + }, + { + "id": "cs405-m2-file-system-modules", + "slug": "file-system-modules", + "title": "Different Modules of a File System", + "displayOrder": 3 + }, + { + "id": "cs405-m2-allocation-methods", + "slug": "disk-space-allocation", + "title": "Disk Space Allocation Methods – Contiguous, Linked, Indexed", + "displayOrder": 4 + }, + { + "id": "cs405-m2-directory-structures", + "slug": "directory-structures", + "title": "Directory Structures", + "displayOrder": 5 + }, + { + "id": "cs405-m2-file-protection", + "slug": "file-protection", + "title": "File Protection", + "displayOrder": 6 + }, + { + "id": "cs405-m2-file-system-calls", + "slug": "system-calls-file-management", + "title": "System Calls for File Management", + "displayOrder": 7 + }, + { + "id": "cs405-m2-disk-scheduling", + "slug": "disk-scheduling-algorithms", + "title": "Disk Scheduling Algorithms", + "displayOrder": 8 + } + ], + "questionIds": [ + "cs405_m2_nov2022_q1", + "cs405_m2_nov2022_q2", + "cs405_m2_june2023_q3", + "cs405_m2_june2023_q4", + "cs405_m2_june2023_q5", + "cs405_m2_june2023_q6", + "cs405_m2_june2024_q7", + "cs405_m2_june2024_june2025_q8", + "cs405_m2_dec2024_q9", + "cs405_m2_june2025_q10", + "cs405_m2_june2025_q11", + "cs405_m2_june2025_q12", + "cs405_m2_dec2024_q13" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "cs405-m3", "number": 3, "title": "CPU Scheduling & Memory Management", - "hours": 8, + "hours": null, "topics": [ - "CPU Scheduling: Process Concept, Scheduling Concepts, Types of Schedulers", - "Process State Diagram", - "Scheduling Algorithms, Algorithms Evaluation", - "System calls for Process Management", - "Multiple Processor Scheduling", - "Concept of Threads", - "Memory Management: Different Memory Management Techniques – Partitioning, Swapping, Segmentation, Paging, Paged Segmentation", - "Comparison of these techniques", - "Techniques for supporting the execution of large programs: Overlay, Dynamic Linking and Loading", - "Virtual Memory – Concept, Implementation by Demand Paging etc." - ] + { + "id": "cs405-m3-process-concept", + "slug": "process-concept-scheduling", + "title": "CPU Scheduling: Process Concept, Scheduling Concepts, Types of Schedulers, Process State Diagram, Scheduling Algorithms, Algorithms Evaluation, System calls for Process Management; Multiple Processor Scheduling; Concept of Threads", + "displayOrder": 1 + }, + { + "id": "cs405-m3-memory-management", + "slug": "memory-management-techniques", + "title": "Memory Management: Different Memory Management Techniques – Partitioning, Swapping, Segmentation, Paging, Paged Segmentation, Comparison of these techniques, Techniques for supporting the execution of large programs: Overlay, Dynamic Linking and Loading, Virtual Memory – Concept, Implementation by Demand Paging etc.", + "displayOrder": 2 + } + ], + "questionIds": [ + "cs405_m3_nov2022_q1", + "cs405_m3_nov2022_q2", + "cs405_m3_nov2022_q3", + "cs405_m3_nov2022_q4", + "cs405_m3_nov2022_q5", + "cs405_m3_june2023_q6", + "cs405_m3_june2023_q7", + "cs405_m3_june2023_q8", + "cs405_m3_june2023_q9", + "cs405_m3_june2024_q10", + "cs405_m3_june2024_q11", + "cs405_m3_june2024_june2025_q12", + "cs405_m3_june2024_q13", + "cs405_m3_june2024_q14", + "cs405_m3_june2024_q15", + "cs405_m3_dec2024_q16", + "cs405_m3_dec2024_q17", + "cs405_m3_dec2024_q18", + "cs405_m3_dec2024_q19", + "cs405_m3_dec2024_q20", + "cs405_m3_june2025_q21", + "cs405_m3_june2025_q22", + "cs405_m3_june2025_q23", + "cs405_m3_june2025_q24", + "cs405_m3_nov2022_q25", + "cs405_m3_june2024_q26", + "cs405_m3_dec2024_q27", + "cs405_m3_june2025_q28" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "cs405-m4", "number": 4, "title": "Input / Output & Concurrent Processes", - "hours": 8, + "hours": null, "topics": [ - "Input / Output: Principles and Programming", - "Input/Output Problems", - "Asynchronous Operations", - "Speed gap Format conversion", - "I/O Interfaces", - "Programme Controlled I/O", - "Interrupt Driven I/O", - "Concurrent I/O", - "Concurrent Processes: Real and Virtual Concurrency", - "Mutual Exclusion, Synchronization, Inter-Process Communication", - "Critical Section Problem, Solution to Critical Section Problem: Semaphores – Binary and Counting Semaphores", - "WAIT & SIGNAL Operations and their implementation", - "Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance, Recovery" - ] + { + "id": "cs405-m4-io", + "slug": "input-output", + "title": "Input / Output: Principles and Programming, Input/Output Problems, Asynchronous Operations, Speed gap Format conversion, I/O Interfaces, Programme Controlled I/O, Interrupt Driven I/O, Concurrent I/O", + "displayOrder": 1 + }, + { + "id": "cs405-m4-concurrent-processes", + "slug": "concurrent-processes", + "title": "Concurrent Processes: Real and Virtual Concurrency, Mutual Exclusion, Synchronization, Inter-Process Communication, Critical Section Problem, Solution to Critical Section Problem: Semaphores – Binary and Counting Semaphores, WAIT & SIGNAL Operations and their implementation. Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance, Recovery", + "displayOrder": 2 + } + ], + "questionIds": [ + "cs405_m4_nov2022_q1", + "cs405_m4_nov2022_q2", + "cs405_m4_nov2022_q3", + "cs405_m4_nov2022_q4", + "cs405_m4_nov2022_q5", + "cs405_m4_june2023_q6", + "cs405_m4_june2023_q7", + "cs405_m4_june2023_q8", + "cs405_m4_june2024_june2025_q9", + "cs405_m4_june2024_june2025_q10", + "cs405_m4_dec2024_q11", + "cs405_m4_june2025_q12", + "cs405_m4_june2025_q13", + "cs405_m4_june2025_q14", + "cs405_m4_june2025_q15", + "cs405_m4_june2025_q16", + "cs405_m4_june2023_q17", + "cs405_m4_june2024_q18", + "cs405_m4_june2025_q19" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "cs405-m5", "number": 5, "title": "Network, Distributed and Multiprocessor Operating Systems", - "hours": 8, + "hours": null, "topics": [ - "Introduction to Network, Distributed and Multiprocessor Operating Systems", - "Case Studies: Unix/Linux, WINDOWS and other Contemporary Operating Systems" - ] + { + "id": "cs405-m5-intro", + "slug": "network-distributed-multiprocessor-os", + "title": "Introduction to Network, Distributed and Multiprocessor Operating Systems", + "displayOrder": 1 + }, + { + "id": "cs405-m5-case-studies", + "slug": "os-case-studies", + "title": "Case Studies: Unix/Linux, WINDOWS and other Contemporary Operating Systems", + "displayOrder": 2 + } + ], + "questionIds": [ + "cs405_m5_june2023_q1", + "cs405_m5_june2024_june2025_q2", + "cs405_m5_june2024_june2025_q3", + "cs405_m5_june2024_q4", + "cs405_m5_june2025_q5", + "cs405_m5_june2025_q6", + "cs405_m5_june2025_q7", + "cs405_m5_nov2022_q8", + "cs405_m5_nov2022_q9", + "cs405_m5_nov2022_q10", + "cs405_m5_june2023_q11", + "cs405_m5_june2023_q12", + "cs405_m5_june2025_q13" + ], + "predictedQuestionIds": [] } ] -} +} \ No newline at end of file diff --git a/content/rgpv/csit/semester-3/csit-302/pyqs.json b/content/rgpv/csit/semester-3/csit-302/pyqs.json index 903b6d3..ee1b2e1 100644 --- a/content/rgpv/csit/semester-3/csit-302/pyqs.json +++ b/content/rgpv/csit/semester-3/csit-302/pyqs.json @@ -3,7 +3,7 @@ "id": "csit-302", "code": "CSIT-302", "name": "Discrete Structure", - "title": "CSIT-302 - Discrete Structure", + "title": "CS/CT/CO/IT/CI (CSIT)-302 – Discrete Structure", "semester": "III", "gradingSystem": "Grading System (GS)", "maxMarks": 70, @@ -15,486 +15,499 @@ }, "papers": [ { - "exam": "December 2025", - "year": 2025, - "month": "December", + "exam": "November 2022", + "year": 2022, + "month": "November", "questions": [ { - "id": "dec25-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "dec25-q1a", + "id": "q1a", "label": "a)", - "text": "Define countable and uncountable sets. Prove that the set of rational numbers is countable.", - "unit": "Unit 1" + "text": "Show that the relation 'R' defined by (a, b) R (c, d) if a + d = b + c is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "dec25-q1b", + "id": "q1b", "label": "b)", - "text": "Using Venn diagram, prove: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)", - "latex": "A \\cap (B \\cup C) = (A \\cap B) \\cup (A \\cap C)", - "unit": "Unit 1" + "text": "If X = {1, 2, 3, 4} and R = {(x, y) | x < y}. Draw the graph of 'R' and also give its matrix.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "dec25-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "dec25-q2a", + "id": "q2a", "label": "a)", - "text": "Define relation. Explain equivalence relation and partial ordering relation with suitable examples.", - "unit": "Unit 1" + "text": "Prove that if R is an equivalence relation on a set A, show that R⁻¹ is also an equivalence relation on A.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "dec25-q2b", + "id": "q2b", "label": "b)", - "text": "Let A = {1, 2, 3}, R = {(1,1), (2,2), (3,3), (1,2), (2,1)}. Check whether R is an equivalence relation and find equivalence classes.", - "unit": "Unit 1" + "text": "What is Mathematical induction? Use mathematical induction to prove that: 1.1! + 2.2! + ... + n.n! = (n + 1)! - 1 where n is a positive integer.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "dec25-q3", + "id": "q3", "questionNumber": "Q.3", "subQuestions": [ { - "id": "dec25-q3a", + "id": "q3a", "label": "a)", - "text": "Define one-one, onto and bijective functions. Prove that inverse of a function exists if and only if the function is bijective.", - "unit": "Unit 1" + "text": "Find the explicit formula for the Fibonacci numbers. Use fₙ = fₙ₋₁ + fₙ₋₂ as recursive condition and f₀ = 0 and f₁ = 1 as initial condition.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "dec25-q3b", + "id": "q3b", "label": "b)", - "text": "State and prove Pigeonhole Principle.", - "unit": "Unit 1" + "text": "Draw the Hasse diagram representing the positive divisors of 36.", + "unit": "Unit 5", + "type": "theory" } ] }, { - "id": "dec25-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "dec25-q4a", + "id": "q4a", "label": "a)", - "text": "Construct truth table for the proposition (p → q) ↔ (¬p ∨ q) and show that it is a tautology.", - "latex": "(p \\to q) \\leftrightarrow (\\neg p \\lor q)", - "unit": "Unit 3" + "text": "Prove that the set G = {0, 1, 2, 3, 4, 5, 6} is a finite abelian group of order 7 with respect to multiplication modulo 7 as the composition in G.", + "unit": "Unit 2", + "type": "theory" }, { - "id": "dec25-q4b", + "id": "q4b", "label": "b)", - "text": "Convert the following statement into predicate logic and write its negation: \"Every student studies Discrete Mathematics.\"", - "unit": "Unit 3" + "text": "State the Lagrange's Theorem with example. Also explain Permutation and Symmetric Group.", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "dec25-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "dec25-q5a", + "id": "q5a", "label": "a)", - "text": "Prove by mathematical induction that: 1 + 2 + 3 + ... + n = n(n+1)/2", - "latex": "1 + 2 + 3 + \\cdots + n = \\frac{n(n+1)}{2}", - "unit": "Unit 1" + "text": "Find PDNF by constructing its PCNF of (Q ∨ P) ∧ (Q ∨ R) ∧ (∼(P ∨ R) ∨ ∼Q).", + "unit": "Unit 3", + "type": "theory" }, { - "id": "dec25-q5b", + "id": "q5b", "label": "b)", - "text": "Prove by contradiction that √2 is irrational.", - "latex": "\\sqrt{2}", - "unit": "Unit 1" + "text": "Prove that for any three propositions P, Q, R the compound proposition (P → (Q → R)) → ((P → Q) → (P → R)) is a tautology by laws of logic.", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "dec25-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "dec25-q6a", + "id": "q6a", "label": "a)", - "text": "Define group and Abelian group. Prove that identity element of a group is unique.", - "unit": "Unit 2" + "text": "Explain Tautologies, Contradiction and Contingencies with suitable examples.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "dec25-q6b", + "id": "q6b", "label": "b)", - "text": "Find all subgroups of the group Z_8.", - "latex": "Z_8", - "unit": "Unit 2" + "text": "Explain the method of proving theorems by direct, indirect, contradiction and by cases.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "dec25-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "dec25-q7a", + "id": "q7a", "label": "a)", - "text": "Define Finite State Machine. Explain FSM as a language recognizer.", - "unit": "Unit 3" + "text": "Give a simple condition on the weights of a graph that will guarantee that there is a unique maximal spanning tree for the graph.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "dec25-q7b", + "id": "q7b", "label": "b)", - "text": "Design a finite state machine that accepts all binary strings ending with 01.", - "unit": "Unit 3" + "text": "Define Isomorphism of graphs. What are the steps followed in discovering the Isomorphism?", + "unit": "Unit 4", + "type": "theory" } ] }, { - "id": "dec25-q8", + "id": "q8", "questionNumber": "Q.8", "subQuestions": [ { - "id": "dec25-q8a", + "id": "q8a", "label": "a)", - "text": "Define Euler path and Euler circuit. State necessary and sufficient conditions for their existence.", - "unit": "Unit 4" + "text": "Explain Eulerian and Hamiltonian graphs with examples, also draw the graphs of the following: i) Eulerian but not Hamiltonian ii) Hamiltonian but not Eulerian", + "unit": "Unit 4", + "type": "theory" }, { - "id": "dec25-q8b", + "id": "q8b", "label": "b)", - "text": "Explain Dijkstra's Algorithm and find the shortest path from a given source vertex 0 to all other vertices in a weighted graph. [Image: A weighted undirected graph with 5 vertices labeled 0 to 4. The edges and their weights are: edge between 0 and 1 with weight 4, edge between 0 and 2 with weight 8, edge between 1 and 4 with weight 6, edge between 2 and 3 with weight 2, and edge between 3 and 4 with weight 10]", - "unit": "Unit 4" + "text": "Prove that the sum of the degree of all the vertices in a graph G is equal to twice the number of edges in G.", + "unit": "Unit 4", + "type": "theory" } ] } ] }, { - "exam": "June 2025", - "year": 2025, + "exam": "June 2023", + "year": 2023, "month": "June", "questions": [ { - "id": "jun25-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "jun25-q1a", + "id": "q1a", "label": "a)", - "text": "Consider three sets A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6} and C = {1, 5, 7}. Using Venn diagrams, determine and shade the regions corresponding to (A ∪ B) ∩ (B ∩ C) and A ∩ (B ∪ C). Verify if these expressions are equivalent by listing the elements.", - "latex": "(A \\cup B) \\cap (B \\cap C) \\text{ and } A \\cap (B \\cup C)", - "unit": "Unit 1" + "text": "Prove that P(A) ⊆ P(B) if and only if A ⊆ B.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "jun25-q1b", + "id": "q1b", "label": "b)", - "text": "Define and illustrate an equivalence relation by constructing an equivalence relation on the set S = {1, 2, 3, 4, 5, 6} where two elements are related if they have the same remainder when divided by 3.", - "unit": "Unit 1" + "text": "Suppose that R is the relation on the set of strings of English letters such that aRb if and only if l(a) = l(b), where l(x) is the length of the string x. Is R an equivalence relation?", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "jun25-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "jun25-q2a", + "id": "q2a", "label": "a)", - "text": "What is pigeonhole principle? Prove it by using mathematical induction and use it to show that in a group of 15 people, at least two share the same birth month.", - "unit": "Unit 1" + "text": "Illustrate the concept of an inverse function. Let f : Z → Z be such that f(x) = x + 1. Is f invertible? if it is then what is its inverse?", + "unit": "Unit 1", + "type": "theory" }, { - "id": "jun25-q2b", + "id": "q2b", "label": "b)", - "text": "Explain a recursively defined function. Solve the recurrence relation f(n) = f(n-1) + 3 with initial condition f(0) = 2.", - "latex": "f(n) = f(n-1) + 3, f(0) = 2", - "unit": "Unit 5" + "text": "Define group. Explain the properties of groups.", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "jun25-q3", + "id": "q3", "questionNumber": "Q.3", "subQuestions": [ { - "id": "jun25-q3a", - "label": "a)", - "text": "Prove that the set G = {0, 1, 2, 3} under addition modulo 4 is an abelian group. Identify the identity and inverse elements.", - "unit": "Unit 2" - }, - { - "id": "jun25-q3b", - "label": "b)", - "text": "Define a homomorphism between two groups. Verify whether the mapping f: R → R defined by f(x) = 2x is a homomorphism under addition.", - "latex": "f: \\mathbb{R} \\to \\mathbb{R}, f(x) = 2x", - "unit": "Unit 2" + "id": "q3a", + "label": "", + "text": "Let S = N × N. Let * be the operation on S defined by (a, b) * (a', b') = (aa', bb'). i) Define f : (S, *) → (Q, ×) by f(a, b) = a/b. Show that f is a homomorphism. ii) Find the congruence relation ∼ in S determined by the homomorphism f, that is, where x ∼ y if f(x) = f(y).", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "jun25-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "jun25-q4a", + "id": "q4a", "label": "a)", - "text": "Consider the propositions p, q and r, where: p: \"It is raining.\" q: \"I am carrying an umbrella.\" r: \"I stay dry.\" Assume the implication (p → q) → r. Construct a truth table for the expression (p → q) → r and determine if it is a tautology or contradiction.", - "latex": "(p \\to q) \\to r", - "unit": "Unit 3" + "text": "Show that the ((p ∨ q) ∧ ¬p) → q compound proposition is a tautology.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "jun25-q4b", + "id": "q4b", "label": "b)", - "text": "What are predicates in propositional logic? Define universal and existential quantifiers with examples.", - "unit": "Unit 3" + "text": "Use existential and universal quantifiers to express the statement. \"No one has more than three grandmothers\" using the propositional function G(x, y), which represents \"x is the grandmother of y.\"", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "jun25-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "jun25-q5a", + "id": "q5a", "label": "a)", - "text": "Define graph theory and explain the basic terminology of graphs such as vertices, edges, degree and adjacency.", - "unit": "Unit 4" + "text": "Discuss the 6 tuple notation of finite state machine M with an example.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "jun25-q5b", + "id": "q5b", "label": "b)", - "text": "Define and give an example of an isomorphic graph pair. Verify isomorphism between two adjacency matrices.", - "unit": "Unit 4" + "text": "Consider the complete weighted graph G in the following figure with 5 vertices. Find a Hamiltonian circuit of minimal weight.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.5-b_june-2023.png", + "imageAlt": "A complete weighted graph with 5 vertices labeled A, B, C, D, E. The graph forms a pentagon shape with inner star connections. Edge weights are: A-B=100, B-C=125, C-D=300, D-E=75, E-A=175, A-C=200, A-D=225, B-D=250, B-E=225, C-E=275." } ] }, { - "id": "jun25-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "jun25-q6a", + "id": "q6a", "label": "a)", - "text": "For the graph G with vertices V = {A, B, C, D} and edges E = {(A,B), (B,C), (C,D), (D,A), (A,C)}, determine: i) Whether the graph contains a Eulerian path or circuit or not. ii) All Hamiltonian circuits in the graph G.", - "latex": "V = \\{A, B, C, D\\}, E = \\{(A,B), (B,C), (C,D), (D,A), (A,C)\\}", - "unit": "Unit 4" + "text": "Discuss the various applications of graph colouring.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "jun25-q6b", + "id": "q6b", "label": "b)", - "text": "How many permutations can be formed from the letters of the word \"MATHEMATICS\" such that all vowels are together?", - "unit": "Unit 5" + "text": "State Euler's formula for a planar graph. Give an example of a planar graph with 5 vertices and 5 regions and verify Euler's formula for your example.", + "unit": "Unit 4", + "type": "theory" } ] }, { - "id": "jun25-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "jun25-q7a", + "id": "q7a", "label": "a)", - "text": "What is a Hasse diagram? Draw the Hasse diagram for the set {1, 2, 3, 6, 9, 18} with the divisibility relation.", - "unit": "Unit 5" + "text": "Consider the set A = {4, 5, 6, 7}. Let R be the relation ≤ on A. Draw the directed graph and the Hasse diagram of R.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "jun25-q7b", + "id": "q7b", "label": "b)", - "text": "Define a lattice and prove that every finite lattice has a unique least upper bound and greatest lower bound.", - "unit": "Unit 5" + "text": "Consider the lattice M in the following figure. i) Find the non-zero join irreducible elements and atoms of M. ii) Is M distributive and complemented?", + "unit": "Unit 5", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.7-b_june-2023.png", + "imageAlt": "A Hasse diagram labeled M with 6 nodes. Bottom node is 0. Top node is 1. Node 0 connects upwards to 'a' and 'b'. Node 'a' connects upwards to 'c'. Node 'b' connects upwards to 'c' and 'd'. Nodes 'c' and 'd' connect upwards to 1." } ] }, { - "id": "jun25-q8", + "id": "q8", "questionNumber": "Q.8", - "text": "Write short notes on (any four):", "subQuestions": [ { - "id": "jun25-q8i", - "label": "i)", - "text": "Finite state machines as language recognizers", - "unit": "Unit 3" - }, - { - "id": "jun25-q8ii", - "label": "ii)", - "text": "Binomial theorem", - "unit": "Unit 5" - }, - { - "id": "jun25-q8iii", - "label": "iii)", - "text": "Permutation group", - "unit": "Unit 2" - }, - { - "id": "jun25-q8iv", - "label": "iv)", - "text": "Partial Ordering Relation", - "unit": "Unit 1" - }, - { - "id": "jun25-q8v", - "label": "v)", - "text": "Countable and uncountable sets", - "unit": "Unit 1" + "id": "q8a", + "label": "", + "text": "Discuss in brief any two of the following: i) Partial ordering relation ii) Cosets iii) Disjunctive normal form iv) Pigeonhole principle", + "unit": "Unit 1, Unit 2, Unit 3, Unit 1", + "type": "theory" } ] } ] }, { - "exam": "December 2024", - "year": 2024, + "exam": "December 2023", + "year": 2023, "month": "December", "questions": [ { - "id": "dec24-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "dec24-q1a", + "id": "q1a", "label": "a)", - "text": "Define various types of functions. How many symmetric and reflexive relations are possible from a set A containing 'n' elements?", - "unit": "Unit 1" + "text": "Out of 120 students surveyed, it was found that 20 students have studied French, 50 students have studied English, 70 students have studied Hindi, 5 have studied English and French, 20 have studied English and Hindi, 10 have studied Hindi and French, only 3 students have studied all the three languages. Find how many students have studied: i) Hindi alone ii) French alone iii) English, but not Hindi iv) Hindi, but not French", + "unit": "Unit 1", + "type": "numerical" }, { - "id": "dec24-q1b", + "id": "q1b", "label": "b)", - "text": "Let Z be the group of integers with binary operation * defined by a * b = a + b - 2, for all a, b ∈ Z. Find the identity element of the group ⟨Z, *⟩.", - "latex": "a * b = a + b - 2, a, b \\in Z, \\langle Z, * \\rangle", - "unit": "Unit 2" + "text": "If R be a relation in the set of integers Z defined by R = {(x, y) : x ∈ Z, y ∈ Z, (x - y) is multiple of 3}. Show that it is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "dec24-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "dec24-q2a", + "id": "q2a", "label": "a)", - "text": "Show that every Cyclic group is Abelian. Prove that a lattice with 5 elements is not a Boolean algebra.", - "unit": "Unit 2 / Unit 5" + "text": "If f : R → R is defined by: f(x) = {3x - 12, x > 3; 2x² + 3, -2 < x ≤ 3; 3x² - 7, x ≤ -2}. Find f⁻¹(3), f⁻¹(0), and f⁻¹(-2).", + "unit": "Unit 1", + "type": "numerical" }, { - "id": "dec24-q2b", + "id": "q2b", "label": "b)", - "text": "Define Pigeon hole Principle. Write the contra positive of the implication: \"if it is Sunday then it is a holiday.\"", - "unit": "Unit 1 / Unit 3" + "text": "Show that 1² + 2² + 3² + ... + n² = n(n+1)(2n+1)/6, n ≥ 1 by mathematical induction.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "dec24-q3", + "id": "q3", "questionNumber": "Q.3", "subQuestions": [ { - "id": "dec24-q3a", + "id": "q3a", "label": "a)", - "text": "Show that there does not exist a graph with 5 vertices with degrees 1, 3, 4, 2, 3 respectively.", - "unit": "Unit 4" + "text": "Prove that F = {a + b√2 | a, b are rational} is a field.", + "unit": "Unit 2", + "type": "theory" }, { - "id": "dec24-q3b", + "id": "q3b", "label": "b)", - "text": "Obtain the generating function for the sequence 4, 4, 4, 4, 4, 4. Explain complete digraph.", - "unit": "Unit 5 / Unit 4" + "text": "Define the following: i) Symmetric Group ii) Normal Subgroup iii) Homomorphism", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "dec24-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "dec24-q4a", + "id": "q4a", "label": "a)", - "text": "Define planar graph. Prove that for any connected planar graph, v - e + r = 2 Where v, e, r is the number of vertices, edges, and regions of the graph respectively.", - "latex": "v - e + r = 2", - "unit": "Unit 4" + "text": "Construct the truth table of the following formula: i) (∼(p ∨ (q ∨ r)) ⇔ ((p ∨ q) ∧ (p ∨ r))) ii) ((∼q ⇒ ∼p) ⇒ (p ⇒ q))", + "unit": "Unit 3", + "type": "theory" }, { - "id": "dec24-q4b", + "id": "q4b", "label": "b)", - "text": "Find the numbers between 1 to 500 that are not divisible by any of the integers 2 or 3 or 5 or 7.", - "unit": "Unit 5" + "text": "Write the negation of the following: i) If the determinant of a system of linear equations is zero then either the system has no solution or has an indefinite number of solutions. ii) Either today is not a Sunday or today is not a Wednesday.", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "dec24-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "dec24-q5a", + "id": "q5a", "label": "a)", - "text": "A collection of 10 electric bulbs contain 3 defective ones. (i) In how many ways can a sample of four bulbs be selected? (ii) In how many ways can a sample of 4 bulbs be selected which contain 2 good bulbs and 2 defective ones? (iii) In how many ways can a sample of 4 bulbs be selected so that either the sample contains 3 good ones and 1 defectives ones or 1 good and 3 defectives ones?", - "unit": "Unit 5" + "text": "Show that the proposition ∼(p ∧ q) and ∼p ∨ ∼q are logically equivalent.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "dec24-q5b", + "id": "q5b", "label": "b)", - "text": "Discuss about Complete digraph and Euler Graph with the help of suitable examples.", - "unit": "Unit 4" + "text": "Obtain the conjunctive normal form (CNF) of: i) p ∧ (p ⇒ q) ii) ∼p ⇒ [r ∧ (p ⇒ q)]", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "dec24-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "dec24-q6a", + "id": "q6a", "label": "a)", - "text": "Solve the following recurrence equation using generating function. G(K) - 7G(K-1) + 10G(K-2) = 8K + 6.", - "latex": "G(K) - 7G(K-1) + 10G(K-2) = 8K + 6", - "unit": "Unit 5" + "text": "Determine whether the graphs F₁ and F₂ are isomorphic.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.6-a_dec-2023.png", + "imageAlt": "Two graphs labeled F1 and F2. Graph F1 has 5 vertices with edges crossing, resembling a distorted bowtie or a cycle with chords. Graph F2 is a pentagon with 5 vertices and one internal diagonal edge connecting two non-adjacent vertices." }, { - "id": "dec24-q6b", + "id": "q6b", "label": "b)", - "text": "Prove the validity of the following argument \"if the races are fixed so the casinos are crooked, then the tourist trade will decline. If the tourist trade decreases, then the police will be happy. The police force is never happy. Therefore, the races are not fixed.\"", - "unit": "Unit 3" + "text": "Find an Euler Path in the graph below.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.6-b_dec-2023.png", + "imageAlt": "Undirected graph with 7 vertices labeled A, B, C, D, E, F, G. Vertices A, B, C are in the top row, G, F, E in the bottom row, and D in the center. Edges connect: A-B, B-C, C-E, E-F, F-G, G-A (forming an outer rectangle loop), plus internal edges A-D, C-D, A-F, and C-F." } ] }, { - "id": "dec24-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "dec24-q7a", + "id": "q7a", "label": "a)", - "text": "Let (L, ∨, ∧, ≤) be a distributive lattice and a, b ∈ L. if a ∧ b = a ∧ c and a ∨ b = a ∨ c then show that b = c.", - "latex": "(L, \\lor, \\land, \\leq), a, b \\in L, a \\land b = a \\land c, a \\lor b = a \\lor c, b = c", - "unit": "Unit 5" + "text": "Define a lattice. Let (L, ≤, ∨, ∧) be a lattice, and a, b, c, d ∈ L be such that a ≤ b and c ≤ d. Show that a ∨ c ≤ b ∨ d and a ∧ c ≤ b ∧ d.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "dec24-q7b", + "id": "q7b", "label": "b)", - "text": "Explain various Rules of Inference for Propositional Logic.", - "unit": "Unit 3" + "text": "Show that D₁₂ and D₁₈ are isomorphic lattices. Further, show that none is isomorphic to the lattice D₂₀.", + "unit": "Unit 5", + "type": "theory" } ] }, { - "id": "dec24-q8", + "id": "q8", "questionNumber": "Q.8", "subQuestions": [ { - "id": "dec24-q8a", + "id": "q8a", "label": "a)", - "text": "What is Ring? Define elementary properties of Ring with example.", - "unit": "Unit 2" + "text": "Show that aₙ = c₁2ⁿ + c₂4ⁿ is a solution of the recurrence relation aₙ - 6aₙ₋₁ + 8aₙ₋₂ = 0.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "dec24-q8b", + "id": "q8b", "label": "b)", - "text": "Prove or disprove that intersection of two normal subgroups of a group G is again a normal subgroup of G.", - "unit": "Unit 2" + "text": "Find the sequence having the generating function G(x) given by: G(x) = x / (1 - 2x)", + "unit": "Unit 5", + "type": "theory" } ] } @@ -506,648 +519,659 @@ "month": "June", "questions": [ { - "id": "jun24-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "jun24-q1a", + "id": "q1a", "label": "a)", "text": "Explain the following: i) Euler Graph ii) Isomorphic graphs iii) Minimal spanning tree iv) Height of the tree", - "unit": "Unit 4" + "unit": "Unit 4", + "type": "theory" }, { - "id": "jun24-q1b", + "id": "q1b", "label": "b)", "text": "Let Z be the group of integers with binary operation * defined by a * b = a + b - 2, for all a, b ∈ Z. Find the identity element of the group ⟨Z, *⟩.", - "latex": "a * b = a + b - 2, a, b \\in Z, \\langle Z, * \\rangle", - "unit": "Unit 2" + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "jun24-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "jun24-q2a", + "id": "q2a", "label": "a)", "text": "Prove that the Complement of each element in a Boolean Algebra B is unique.", - "unit": "Unit 5" + "unit": "Unit 5", + "type": "theory" }, { - "id": "jun24-q2b", + "id": "q2b", "label": "b)", "text": "Let A be any finite set and P(A) be the power set of A. ⊆ be the inclusion relation on the elements of P(A). Draw the Hasse diagrams of (P(A), ⊆) for the following: i) A = {a} ii) A = {a, b} iii) A = {a, b, c} iv) A = {a, b, c, d}", - "latex": "P(A), \\subseteq, (P(A), \\subseteq)", - "unit": "Unit 5" + "unit": "Unit 5", + "type": "theory" } ] }, { - "id": "jun24-q3", + "id": "q3", "questionNumber": "Q.3", "subQuestions": [ { - "id": "jun24-q3a", + "id": "q3a", "label": "a)", "text": "i) Prove that p ∧ q ⇒ q ∨ p is a Tautology. ii) Show that (p ∨ q) ∧ (¬p) ∧ (¬q) is a contradiction.", - "latex": "p \\land q \\Rightarrow q \\lor p, (p \\lor q) \\land (\\neg p) \\land (\\neg q)", - "unit": "Unit 3" + "unit": "Unit 3", + "type": "theory" }, { - "id": "jun24-q3b", + "id": "q3b", "label": "b)", "text": "Explain complete digraph and Euler Graph using suitable example of both.", - "unit": "Unit 4" + "unit": "Unit 4", + "type": "theory" } ] }, { - "id": "jun24-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "jun24-q4a", + "id": "q4a", "label": "a)", "text": "Define planar graph. Prove that for any connected planar graph, v - e + r = 2 where v, e, r is the number of vertices, edges, and regions of the graph respectively.", - "latex": "v - e + r = 2", - "unit": "Unit 4" + "unit": "Unit 4", + "type": "theory" }, { - "id": "jun24-q4b", + "id": "q4b", "label": "b)", "text": "Prove that the relation R defined by \"a is congruent to b modulo m\" on the set of integers is an equivalence relation.", - "unit": "Unit 1" + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "jun24-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "jun24-q5a", + "id": "q5a", "label": "a)", - "text": "Prove that 5^(2n) - 1 is divisible by 24, where n is any positive integer.", - "latex": "5^{2n} - 1", - "unit": "Unit 1" + "text": "Prove that 5²ⁿ - 1 is divisible by 24, where n is any positive integer.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "jun24-q5b", + "id": "q5b", "label": "b)", "text": "Draw the Hasse diagram representing the positive divisors of 36 and 45.", - "unit": "Unit 5" + "unit": "Unit 5", + "type": "theory" } ] }, { - "id": "jun24-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "jun24-q6a", + "id": "q6a", "label": "a)", - "text": "Show that the relation 'R' defined by (a, b)R(c, d) iff a + d = b + c is an equivalence relation.", - "latex": "(a, b)R(c, d), a + d = b + c", - "unit": "Unit 1" + "text": "Show that the relation 'R' defined by (a, b) R (c, d) iff a + d = b + c is an equivalence relation.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "jun24-q6b", + "id": "q6b", "label": "b)", "text": "Explain various Rules of Inference for Propositional Logic.", - "unit": "Unit 3" + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "jun24-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "jun24-q7a", + "id": "q7a", "label": "a)", "text": "Show that every Cyclic group is Abelian. Prove that a lattice with 5 elements is not a Boolean algebra.", - "unit": "Unit 2 / Unit 5" + "unit": "Unit 2, Unit 5", + "type": "theory" }, { - "id": "jun24-q7b", + "id": "q7b", "label": "b)", "text": "Define Pigeon hole Principle. Write the contra positive of the implication: \"if it is Sunday then it is a holiday.\"", - "unit": "Unit 1 / Unit 3" + "unit": "Unit 1, Unit 3", + "type": "theory" } ] }, { - "id": "jun24-q8", + "id": "q8", "questionNumber": "Q.8", "subQuestions": [ { - "id": "jun24-q8a", + "id": "q8a", "label": "a)", "text": "Prove that G = {0, 1, 2, 3, 4, 5, 6} is an abelian group of order 7 with respect to addition modulo 7.", - "latex": "G = \\{0, 1, 2, 3, 4, 5, 6\\}", - "unit": "Unit 2" + "unit": "Unit 2", + "type": "theory" }, { - "id": "jun24-q8b", + "id": "q8b", "label": "b)", "text": "Prove or disprove that intersection of two normal subgroups of a group G is again a normal subgroup of G. Define subgroup, normal subgroup, Quotient group, with an example for each.", - "unit": "Unit 2" + "unit": "Unit 2", + "type": "theory" } ] } ] }, { - "exam": "December 2023", - "year": 2023, + "exam": "December 2024", + "year": 2024, "month": "December", "questions": [ { - "id": "dec23-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "dec23-q1a", + "id": "q1a", "label": "a)", - "text": "Out of 120 students surveyed, it was found that 20 students have studied French, 50 students have studied English, 70 students have studied Hindi, 5 have studied English and French, 20 have studied English and Hindi, 10 have studied Hindi and French, only 3 students have studied all the three languages. Find how many students have studied: i) Hindi alone ii) French alone iii) English, but not Hindi iv) Hindi, but not French", - "unit": "Unit 1" + "text": "Define various types of functions. How many symmetric and reflexive relations are possible from a set A containing ‘n’ elements?", + "unit": "Unit 1", + "type": "theory" }, { - "id": "dec23-q1b", + "id": "q1b", "label": "b)", - "text": "If R be a relation in the set of integers Z defined by R = {(x,y) : x ∈ Z, y ∈ Z, (x-y) is multiple of 3} Show that it is an equivalence relation.", - "latex": "R = \\{(x,y) : x \\in \\mathbb{Z}, y \\in \\mathbb{Z}, (x-y) \\text{ is multiple of } 3\\}", - "unit": "Unit 1" + "text": "Let Z be the group of integers with binary operation * defined by a * b = a + b - 2, for all a, b ∈ Z. Find the identity element of the group ⟨Z, *⟩.", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "dec23-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "dec23-q2a", + "id": "q2a", "label": "a)", - "text": "If f: R → R is defined by: f(x) = { 3x - 12, x > 3; 2x^2 + 3, -2 < x <= 3; 3x^2 - 7, x <= -2 } Find f^(-1)(3), f^(-1)(0), and f^(-1)(-2).", - "latex": "f(x) = \\begin{cases} 3x - 12, & x > 3 \\\\ 2x^2 + 3, & -2 < x \\le 3 \\\\ 3x^2 - 7, & x \\le -2 \\end{cases}, \\quad f^{-1}(3), f^{-1}(0), f^{-1}(-2)", - "unit": "Unit 1" + "text": "Show that every Cyclic group is Abelian. Prove that a lattice with 5 elements is not a Boolean algebra.", + "unit": "Unit 2, Unit 5", + "type": "theory" }, { - "id": "dec23-q2b", + "id": "q2b", "label": "b)", - "text": "Show that 1^2 + 2^2 + 3^2 + ... + n^2 = (n(n+1)(2n+1))/6, n >= 1 by mathematical induction.", - "latex": "1^2 + 2^2 + 3^2 + \\cdots + n^2 = \\frac{n(n+1)(2n+1)}{6}, \\quad n \\ge 1", - "unit": "Unit 1" + "text": "Define Pigeon hole Principle. Write the contra positive of the implication: \"if it is Sunday then it is a holiday.\"", + "unit": "Unit 1, Unit 3", + "type": "theory" } ] }, { - "id": "dec23-q3", + "id": "q3", "questionNumber": "Q.3", "subQuestions": [ { - "id": "dec23-q3a", + "id": "q3a", "label": "a)", - "text": "Prove that F = {a + b√2 | a,b are rational} is a field.", - "latex": "F = \\{a + b\\sqrt{2} \\mid a,b \\text{ are rational}\\}", - "unit": "Unit 2" + "text": "Show that there does not exist a graph with 5 vertices with degrees 1, 3, 4, 2, 3 respectively.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "dec23-q3b", + "id": "q3b", "label": "b)", - "text": "Define the following: i) Symmetric Group ii) Normal Subgroup iii) Homomorphism", - "unit": "Unit 2" + "text": "Obtain the generating function for the sequence 4, 4, 4, 4, 4, 4. Explain complete digraph.", + "unit": "Unit 5, Unit 4", + "type": "theory" } ] }, { - "id": "dec23-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "dec23-q4a", + "id": "q4a", "label": "a)", - "text": "Construct the truth table of the following formula: i) (~ (p ∨ (q ∨ r)) ⇔ ((p ∨ q) ∧ (p ∨ r))) ii) ((~q ⇒ ~p) ⇒ (p ⇒ q))", - "latex": "(\\sim (p \\lor (q \\lor r)) \\Leftrightarrow ((p \\lor q) \\land (p \\lor r))), ((\\sim q \\Rightarrow \\sim p) \\Rightarrow (p \\Rightarrow q))", - "unit": "Unit 3" + "text": "Define planar graph. Prove that for any connected planar graph, v - e + r = 2 Where v, e, r is the number of vertices, edges, and regions of the graph respectively.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "dec23-q4b", + "id": "q4b", "label": "b)", - "text": "Write the negation of the following: i) If the determinant of a system of linear equations is zero then either the system has no solution or has an indefinite number of solutions. ii) Either today is not a Sunday or today is not a Wednesday.", - "unit": "Unit 3" + "text": "Find the numbers between 1 to 500 that are not divisible by any of the integers 2 or 3 or 5 or 7.", + "unit": "Unit 5", + "type": "numerical" } ] }, { - "id": "dec23-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "dec23-q5a", + "id": "q5a", "label": "a)", - "text": "Show that the proposition ~(p ∧ q) and ~p ∨ ~q are logically equivalent.", - "latex": "\\sim(p \\land q) \\text{ and } \\sim p \\lor \\sim q", - "unit": "Unit 3" + "text": "A collection of 10 electric bulbs contain 3 defective ones. (i) In how many ways can a sample of four bulbs be selected? (ii) In how many ways can a sample of 4 bulbs be selected which contain 2 good bulbs and 2 defective ones? (iii) In how many ways can a sample of 4 bulbs be selected so that either the sample contains 3 good ones and 1 defectives ones or 1 good and 3 defectives ones?", + "unit": "Unit 5", + "type": "numerical" }, { - "id": "dec23-q5b", + "id": "q5b", "label": "b)", - "text": "Obtain the conjunctive normal form (CNF) of: i) p ∧ (p ⇒ q) ii) ~p ⇒ [r ∧ (p ⇒ q)]", - "latex": "p \\land (p \\Rightarrow q), \\sim p \\Rightarrow [r \\land (p \\Rightarrow q)]", - "unit": "Unit 3" + "text": "Discuss about Complete digraph and Euler Graph with the help of suitable examples.", + "unit": "Unit 4", + "type": "theory" } ] }, { - "id": "dec23-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "dec23-q6a", + "id": "q6a", "label": "a)", - "text": "Determine whether the graphs F1 and F2 are isomorphic. [Image: Graph F1 with vertices A, B, C, D, E, F, G forming a complex polygon with internal crossing edges.]", - "unit": "Unit 4" + "text": "Solve the following recurrence equation using generating function. G(K) - 7 G(K-1) + 10 G(K-2) = 8K + 6.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "dec23-q6b", + "id": "q6b", "label": "b)", - "text": "Find an Euler Path in the graph below. [Image: Two graphs labeled F1 and F2. F1 is a complex shape with crossing lines, F2 is a pentagon with an internal star-like structure.]", - "unit": "Unit 4" + "text": "Prove the validity of the following argument \"if the races are fixed so the casinos are crooked, then the tourist trade will decline. If the tourist trade decreases, then the police will be happy. The police force is never happy. Therefore, the races are not fixed.\"", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "dec23-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "dec23-q7a", + "id": "q7a", "label": "a)", - "text": "Define a lattice. Let (L, ≤, ∨, ∧) be a lattice, and a, b, c, d ∈ L be such that a ≤ b and c ≤ d. Show that a ∨ c ≤ b ∨ d and a ∧ c ≤ b ∧ d.", - "latex": "(L, \\le, \\lor, \\land), a, b, c, d \\in L, a \\le b, c \\le d, a \\lor c \\le b \\lor d, a \\land c \\le b \\land d", - "unit": "Unit 5" + "text": "Let (L, ∨, ∧, ≤) be a distributive lattice and a, b ∈ L. if a ∧ b = a ∧ c and a ∨ b = a ∨ c then show that b = c.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "dec23-q7b", + "id": "q7b", "label": "b)", - "text": "Show that D12 and D18 are isomorphic lattices. Further, show that none is isomorphic to the lattice D20.", - "latex": "D_{12}, D_{18}, D_{20}", - "unit": "Unit 5" + "text": "Explain various Rules of Inference for Propositional Logic.", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "dec23-q8", + "id": "q8", "questionNumber": "Q.8", "subQuestions": [ { - "id": "dec23-q8a", + "id": "q8a", "label": "a)", - "text": "Show that a_n = c_1 2^n + c_2 4^n is a solution of the recurrence relation a_n - 6a_{n-1} + 8a_{n-2} = 0.", - "latex": "a_n = c_1 2^n + c_2 4^n, a_n - 6a_{n-1} + 8a_{n-2} = 0", - "unit": "Unit 5" + "text": "What is Ring? Define elementary properties of Ring with example.", + "unit": "Unit 2", + "type": "theory" }, { - "id": "dec23-q8b", + "id": "q8b", "label": "b)", - "text": "Find the sequence having the generating function G(x) given by: G(x) = x / (1 - 2x)", - "latex": "G(x) = \\frac{x}{1 - 2x}", - "unit": "Unit 5" + "text": "Prove or disprove that intersection of two normal subgroups of a group G is again a normal subgroup of G.", + "unit": "Unit 2", + "type": "theory" } ] } ] }, { - "exam": "June 2023", - "year": 2023, + "exam": "June 2025", + "year": 2025, "month": "June", "questions": [ { - "id": "jun23-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "jun23-q1a", + "id": "q1a", "label": "a)", - "text": "Prove that P(A) ⊆ P(B) if and only if A ⊆ B.", - "latex": "P(A) \\subseteq P(B) \\text{ if and only if } A \\subseteq B", - "unit": "Unit 1" + "text": "Consider three sets A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6} and C = {1, 5, 7}. Using Venn diagrams, determine and shade the regions corresponding to (A ∪ B) ∩ (B ∩ C) and A ∩ (B ∪ C). Verify if these expressions are equivalent by listing the elements.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "jun23-q1b", + "id": "q1b", "label": "b)", - "text": "Suppose that R is the relation on the set of strings of English letters such that aRb if and only if l(a) = l(b), where l(x) is the length of the string x. Is R an equivalence relation?", - "latex": "aRb, l(a) = l(b), l(x)", - "unit": "Unit 1" + "text": "Define and illustrate an equivalence relation by constructing an equivalence relation on the set S = {1, 2, 3, 4, 5, 6} where two elements are related if they have the same remainder when divided by 3.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "jun23-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "jun23-q2a", + "id": "q2a", "label": "a)", - "text": "Illustrate the concept of an inverse function. Let f : Z → Z be such that f(x) = x + 1. Is f invertible? if it is then what is its inverse?", - "latex": "f: \\mathbb{Z} \\to \\mathbb{Z}, f(x) = x + 1", - "unit": "Unit 1" + "text": "What is pigeonhole principle? Prove it by using mathematical induction and use it to show that in a group of 15 people, at least two share the same birth month.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "jun23-q2b", + "id": "q2b", "label": "b)", - "text": "Define group. Explain the properties of groups.", - "unit": "Unit 2" + "text": "Explain a recursively defined function. Solve the recurrence relation f(n) = f(n-1) + 3 with initial condition f(0) = 2.", + "unit": "Unit 5", + "type": "theory" } ] }, { - "id": "jun23-q3", + "id": "q3", "questionNumber": "Q.3", - "text": "Let S = N × N. Let * be the operation on S defined by (a, b) * (a', b') = (aa', bb').", - "latex": "S = \\mathbb{N} \\times \\mathbb{N}, (a, b) * (a', b') = (aa', bb')", "subQuestions": [ { - "id": "jun23-q3i", - "label": "i)", - "text": "Define f : (S, *) → (Q, ×) by f(a, b) = a/b. Show that f is a homomorphism.", - "latex": "f: (S, *) \\to (\\mathbb{Q}, \\times), f(a, b) = a/b", - "unit": "Unit 2" + "id": "q3a", + "label": "a)", + "text": "Prove that the set G = {0, 1, 2, 3} under addition modulo 4 is an abelian group. Identify the identity and inverse elements.", + "unit": "Unit 2", + "type": "theory" }, { - "id": "jun23-q3ii", - "label": "ii)", - "text": "Find the congruence relation ~ in S determined by the homomorphism f, that is, where x ~ y if f(x) = f(y).", - "latex": "x \\sim y \\text{ if } f(x) = f(y)", - "unit": "Unit 2" + "id": "q3b", + "label": "b)", + "text": "Define a homomorphism between two groups. Verify whether the mapping f: R → R defined by f(x) = 2x is a homomorphism under addition.", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "jun23-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "jun23-q4a", + "id": "q4a", "label": "a)", - "text": "Show that the ((p ∨ q) ∧ ¬p) → q compound proposition is a tautology.", - "latex": "((p \\lor q) \\land \\neg p) \\to q", - "unit": "Unit 3" + "text": "Consider the propositions p, q and r, where: p: \"It is raining.\" q: \"I am carrying an umbrella.\" r: \"I stay dry.\" Assume the implication (p → q) → r. Construct a truth table for the expression (p → q) → r and determine if it is a tautology or contradiction.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "jun23-q4b", + "id": "q4b", "label": "b)", - "text": "Use existential and universal quantifiers to express the statement. \"No one has more than three grandmothers\" using the propositional function G(x, y), which represents \"x is the grandmother of y.\"", - "latex": "G(x, y)", - "unit": "Unit 3" + "text": "What are predicates in propositional logic? Define universal and existential quantifiers with examples.", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "jun23-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "jun23-q5a", + "id": "q5a", "label": "a)", - "text": "Discuss the 6 tuple notation of finite state machine M with an example.", - "unit": "Unit 3" + "text": "Define graph theory and explain the basic terminology of graphs such as vertices, edges, degree and adjacency.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "jun23-q5b", + "id": "q5b", "label": "b)", - "text": "Consider the complete weighted graph G in the following figure with 5 vertices. Find a Hamiltonian circuit of minimal weight. [Image: A complete weighted graph with 5 vertices A, B, C, D, E and edges with given weights.]", - "unit": "Unit 4" + "text": "Define and give an example of an isomorphic graph pair. Verify isomorphism between two adjacency matrices.", + "unit": "Unit 4", + "type": "theory" } ] }, { - "id": "jun23-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "jun23-q6a", + "id": "q6a", "label": "a)", - "text": "Discuss the various applications of graph colouring.", - "unit": "Unit 4" + "text": "For the graph G with vertices V = {A, B, C, D} and edges E = {(A, B), (B, C), (C, D), (D, A), (A, C)}, determine: i) Whether the graph contains a Eulerian path or circuit or not. ii) All Hamiltonian circuits in the graph G.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "jun23-q6b", + "id": "q6b", "label": "b)", - "text": "State Euler's formula for a planar graph. Give an example of a planar graph with 5 vertices and 5 regions and verify Euler's formula for your example.", - "unit": "Unit 4" + "text": "How many permutations can be formed from the letters of the word “MATHEMATICS” such that all vowels are together?", + "unit": "Unit 5", + "type": "numerical" } ] }, { - "id": "jun23-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "jun23-q7a", + "id": "q7a", "label": "a)", - "text": "Consider the set A = {4, 5, 6, 7}. Let R be the relation ≤ on A. Draw the directed graph and the Hasse diagram of R.", - "latex": "A = \\{4, 5, 6, 7\\}, \\le", - "unit": "Unit 5" + "text": "What is a Hasse diagram? Draw the Hasse diagram for the set {1, 2, 3, 6, 9, 18} with the divisibility relation.", + "unit": "Unit 5", + "type": "theory" }, { - "id": "jun23-q7b", + "id": "q7b", "label": "b)", - "text": "Consider the lattice M in the following figure. i) Find the non-zero join irreducible elements and atoms of M. ii) Is M distributive and complemented? [Image: A Hasse diagram of a lattice M with elements 0, a, b, c, d, 1.]", - "unit": "Unit 5" + "text": "Define a lattice and prove that every finite lattice has a unique least upper bound and greatest lower bound.", + "unit": "Unit 5", + "type": "theory" } ] }, { - "id": "jun23-q8", + "id": "q8", "questionNumber": "Q.8", - "text": "Discuss in brief any two of the following:", "subQuestions": [ { - "id": "jun23-q8i", - "label": "i)", - "text": "Partial ordering relation", - "unit": "Unit 1" - }, - { - "id": "jun23-q8ii", - "label": "ii)", - "text": "Cosets", - "unit": "Unit 2" - }, - { - "id": "jun23-q8iii", - "label": "iii)", - "text": "Disjunctive normal form", - "unit": "Unit 3" - }, - { - "id": "jun23-q8iv", - "label": "iv)", - "text": "Pigeonhole principle", - "unit": "Unit 1" + "id": "q8a", + "label": "", + "text": "Write short notes on (any four): i) Finite state machines as language recognizers ii) Binomial theorem iii) Permutation group iv) Partial Ordering Relation v) Countable and uncountable sets", + "unit": "Unit 3, Unit 5, Unit 2, Unit 1, Unit 1", + "type": "theory" } ] } ] }, { - "exam": "November 2022", - "year": 2022, - "month": "November", + "exam": "December 2025", + "year": 2025, + "month": "December", "questions": [ { - "id": "nov22-q1", + "id": "q1", "questionNumber": "Q.1", "subQuestions": [ { - "id": "nov22-q1a", + "id": "q1a", "label": "a)", - "text": "Show that the relation 'R' defined by (a, b)R(c, d) if a + d = b + c is an equivalence relation.", - "latex": "(a, b)R(c, d) \\text{ if } a + d = b + c", - "unit": "Unit 1" + "text": "Define countable and uncountable sets. Prove that the set of rational numbers is countable.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "nov22-q1b", + "id": "q1b", "label": "b)", - "text": "If X = {1, 2, 3, 4} and R = {(x, y)|x < y}. Draw the graph of 'R' and also give its matrix.", - "latex": "X = \\{1, 2, 3, 4\\}, R = \\{(x, y) \\mid x < y\\}", - "unit": "Unit 1" + "text": "Using Venn diagram, prove: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "nov22-q2", + "id": "q2", "questionNumber": "Q.2", "subQuestions": [ { - "id": "nov22-q2a", + "id": "q2a", "label": "a)", - "text": "Prove that if R is an equivalence relation on a set A, show that R^{-1} is also an equivalence relation on A.", - "latex": "R^{-1}", - "unit": "Unit 1" + "text": "Define relation. Explain equivalence relation and partial ordering relation with suitable examples.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "nov22-q2b", + "id": "q2b", "label": "b)", - "text": "What is Mathematical induction? Use mathematical induction to prove that: 1.1! + 2.2! + ... + n.n! = (n + 1)! - 1 where n is a positive integer.", - "latex": "1.1! + 2.2! + \\cdots + n.n! = (n + 1)! - 1", - "unit": "Unit 1" + "text": "Let A = {1, 2, 3} R = {(1,1), (2,2), (3,3), (1,2), (2,1)}. Check whether R is an equivalence relation and find equivalence classes.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "nov22-q3", + "id": "q3", "questionNumber": "Q.3", "subQuestions": [ { - "id": "nov22-q3a", + "id": "q3a", "label": "a)", - "text": "Find the explicit formula for the Fibonacci numbers. Use f_n = f_{n-1} + f_{n-2} as recursive condition and f_0 = 0 and f_1 = 1 as initial condition.", - "latex": "f_n = f_{n-1} + f_{n-2}, f_0 = 0, f_1 = 1", - "unit": "Unit 5" + "text": "Define one-one, onto and bijective functions. Prove that inverse of a function exists if and only if the function is bijective.", + "unit": "Unit 1", + "type": "theory" }, { - "id": "nov22-q3b", + "id": "q3b", "label": "b)", - "text": "Draw the Hasse diagram representing the positive divisors of 36.", - "unit": "Unit 5" + "text": "State and prove Pigeonhole Principle.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "nov22-q4", + "id": "q4", "questionNumber": "Q.4", "subQuestions": [ { - "id": "nov22-q4a", + "id": "q4a", "label": "a)", - "text": "Prove that the set G = {0, 1, 2, 3, 4, 5, 6} is a finite abelian group of order 7 with respect to multiplication modulo 7 as the composition in G.", - "latex": "G = \\{0, 1, 2, 3, 4, 5, 6\\}", - "unit": "Unit 2" + "text": "Construct truth table for the proposition. (p → q) ↔ (¬p ∨ q) and show that it is a tautology.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "nov22-q4b", + "id": "q4b", "label": "b)", - "text": "State the Lagrange's Theorem with example. Also explain Permutation and Symmetric Group.", - "unit": "Unit 2" + "text": "Convert the following statement into predicate logic and write its negation: \"Every student studies Discrete Mathematics.\"", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "nov22-q5", + "id": "q5", "questionNumber": "Q.5", "subQuestions": [ { - "id": "nov22-q5a", + "id": "q5a", "label": "a)", - "text": "Find PDNF by constructing its PCNF of (Q ∨ P) ∧ (Q ∨ R) ∧ (~(P ∨ R) ∨ ~Q).", - "latex": "(Q \\lor P) \\land (Q \\lor R) \\land (\\sim(P \\lor R) \\lor \\sim Q)", - "unit": "Unit 3" + "text": "Prove by mathematical induction that: 1 + 2 + 3 + ... + n = n(n+1)/2", + "unit": "Unit 1", + "type": "theory" }, { - "id": "nov22-q5b", + "id": "q5b", "label": "b)", - "text": "Prove that for any three propositions P, Q, R the compound proposition (P → (Q → R)) → ((P → Q) → (P → R)) is a tautology by laws of logic.", - "latex": "(P \\to (Q \\to R)) \\to ((P \\to Q) \\to (P \\to R))", - "unit": "Unit 3" + "text": "Prove by contradiction that √2 is irrational.", + "unit": "Unit 1", + "type": "theory" } ] }, { - "id": "nov22-q6", + "id": "q6", "questionNumber": "Q.6", "subQuestions": [ { - "id": "nov22-q6a", + "id": "q6a", "label": "a)", - "text": "Explain Tautologies, Contradiction and Contingencies with suitable examples.", - "unit": "Unit 3" + "text": "Define group and Abelian group. Prove that identity element of a group is unique.", + "unit": "Unit 2", + "type": "theory" }, { - "id": "nov22-q6b", + "id": "q6b", "label": "b)", - "text": "Explain the method of proving theorems by direct, indirect, contradiction and by cases.", - "unit": "Unit 1" + "text": "Find all subgroups of the group Z₈.", + "unit": "Unit 2", + "type": "theory" } ] }, { - "id": "nov22-q7", + "id": "q7", "questionNumber": "Q.7", "subQuestions": [ { - "id": "nov22-q7a", + "id": "q7a", "label": "a)", - "text": "Give a simple condition on the weights of a graph that will guarantee that there is a unique maximal spanning tree for the graph.", - "unit": "Unit 4" + "text": "Define Finite State Machine. Explain FSM as a language recognizer.", + "unit": "Unit 3", + "type": "theory" }, { - "id": "nov22-q7b", + "id": "q7b", "label": "b)", - "text": "Define Isomorphism of graphs. What are the steps followed in discovering the Isomorphism?", - "unit": "Unit 4" + "text": "Design a finite state machine that accepts all binary strings ending with 01.", + "unit": "Unit 3", + "type": "theory" } ] }, { - "id": "nov22-q8", + "id": "q8", "questionNumber": "Q.8", "subQuestions": [ { - "id": "nov22-q8a", + "id": "q8a", "label": "a)", - "text": "Explain Eulerian and Hamiltonian graphs with examples, also draw the graphs of the following: i) Eulerian but not Hamiltonian ii) Hamiltonian but not Eulerian", - "unit": "Unit 4" + "text": "Define Euler path and Euler circuit. State necessary and sufficient conditions for their existence.", + "unit": "Unit 4", + "type": "theory" }, { - "id": "nov22-q8b", + "id": "q8b", "label": "b)", - "text": "Prove that the sum of the degree of all the vertices in a graph G is equal to twice the number of edges in G.", - "unit": "Unit 4" + "text": "Explain Dijkstra's Algorithm and find the shortest path from a given source vertex 0 to all other vertices in a weighted graph.", + "unit": "Unit 4", + "type": "theory", + "hasImage": true, + "imagePath": "ques-diagrams/Q.8-b_dec-2025.png", + "imageAlt": "A weighted undirected graph with 5 vertices labeled 0 to 4. The edges and their weights are: edge between 0 and 1 with weight 4, edge between 0 and 2 with weight 8, edge between 1 and 4 with weight 6, edge between 2 and 3 with weight 2, and edge between 3 and 4 with weight 10." } ] } diff --git a/content/rgpv/csit/semester-3/csit-302/syllabus.json b/content/rgpv/csit/semester-3/csit-302/syllabus.json index fc45112..c3ac23a 100644 --- a/content/rgpv/csit/semester-3/csit-302/syllabus.json +++ b/content/rgpv/csit/semester-3/csit-302/syllabus.json @@ -3,109 +3,684 @@ "id": "csit-302", "code": "CSIT-302", "name": "Discrete Structure", - "title": "CSIT-302 - Discrete Structure", - "semester": "III" + "title": "(CSIT)-302 – Discrete Structure", + "semester": "III", + "gradingSystem": "Grading System (GS)", + "maxMarks": 70, + "time": "3 Hours", + "commonInstructions": [ + "Attempt any five questions.", + "All questions carry equal marks." + ] }, "modules": [ { - "id": "module-1", + "id": "csit302-u1", "number": 1, "title": "Set Theory, Relation, Function, Theorem Proving Techniques", "hours": 8, "topics": [ - "Set Theory: Definition of sets", - "Countable and uncountable sets", - "Venn Diagrams", - "Proofs of some general identities on sets", - "Relation: Definition", - "Types of relation", - "Composition of relations", - "Pictorial representation of relation", - "Equivalence relation", - "Partial ordering relation", - "Job-Scheduling problem", - "Function: Definition", - "Type of functions: one to one, into and onto function", - "Inverse function", - "Composition of functions", - "Recursively defined functions", - "Pigeonhole principle", - "Theorem proving Techniques: Mathematical induction, Proof by contradiction" - ] + { + "id": "csit302-u1-set-theory-definition", + "slug": "set-theory-definition", + "title": "Set Theory: Definition of sets", + "displayOrder": 1 + }, + { + "id": "csit302-u1-countable-uncountable", + "slug": "countable-uncountable", + "title": "Countable and uncountable sets", + "displayOrder": 2 + }, + { + "id": "csit302-u1-venn-diagrams", + "slug": "venn-diagrams", + "title": "Venn Diagrams", + "displayOrder": 3 + }, + { + "id": "csit302-u1-proofs-set-identities", + "slug": "proofs-set-identities", + "title": "Proofs of some general identities on sets", + "displayOrder": 4 + }, + { + "id": "csit302-u1-relation-definition", + "slug": "relation-definition", + "title": "Relation: Definition", + "displayOrder": 5 + }, + { + "id": "csit302-u1-types-of-relation", + "slug": "types-of-relation", + "title": "Types of relation", + "displayOrder": 6 + }, + { + "id": "csit302-u1-composition-of-relations", + "slug": "composition-of-relations", + "title": "Composition of relations", + "displayOrder": 7 + }, + { + "id": "csit302-u1-pictorial-representation", + "slug": "pictorial-representation", + "title": "Pictorial representation of relation", + "displayOrder": 8 + }, + { + "id": "csit302-u1-equivalence-relation", + "slug": "equivalence-relation", + "title": "Equivalence relation", + "displayOrder": 9 + }, + { + "id": "csit302-u1-partial-ordering-relation", + "slug": "partial-ordering-relation", + "title": "Partial ordering relation", + "displayOrder": 10 + }, + { + "id": "csit302-u1-job-scheduling", + "slug": "job-scheduling", + "title": "Job-Scheduling problem", + "displayOrder": 11 + }, + { + "id": "csit302-u1-function-definition", + "slug": "function-definition", + "title": "Function: Definition", + "displayOrder": 12 + }, + { + "id": "csit302-u1-type-of-functions", + "slug": "type-of-functions", + "title": "Type of functions: one to one, into and onto function", + "displayOrder": 13 + }, + { + "id": "csit302-u1-inverse-function", + "slug": "inverse-function", + "title": "Inverse function", + "displayOrder": 14 + }, + { + "id": "csit302-u1-composition-of-functions", + "slug": "composition-of-functions", + "title": "Composition of functions", + "displayOrder": 15 + }, + { + "id": "csit302-u1-recursively-defined-functions", + "slug": "recursively-defined-functions", + "title": "Recursively defined functions", + "displayOrder": 16 + }, + { + "id": "csit302-u1-pigeonhole-principle", + "slug": "pigeonhole-principle", + "title": "Pigeonhole principle", + "displayOrder": 17 + }, + { + "id": "csit302-u1-mathematical-induction", + "slug": "mathematical-induction", + "title": "Mathematical induction", + "displayOrder": 18 + }, + { + "id": "csit302-u1-proof-by-contradiction", + "slug": "proof-by-contradiction", + "title": "Proof by contradiction", + "displayOrder": 19 + } + ], + "questionIds": [ + "q1a_nov2022", + "q1b_nov2022", + "q2a_nov2022", + "q2b_nov2022", + "q6b_nov2022", + "q1a_june2023", + "q1b_june2023", + "q2a_june2023", + "q8a_june2023_p1", + "q8a_june2023_p4", + "q1a_dec2023", + "q1b_dec2023", + "q2a_dec2023", + "q2b_dec2023", + "q4b_june2024", + "q5a_june2024", + "q6a_june2024", + "q7b_june2024", + "q1a_dec2024", + "q2b_dec2024", + "q1a_june2025", + "q1b_june2025", + "q2a_june2025", + "q8a_june2025_p4", + "q8a_june2025_p5", + "q1a_dec2025", + "q1b_dec2025", + "q2a_dec2025", + "q2b_dec2025", + "q3a_dec2025", + "q3b_dec2025", + "q5a_dec2025", + "q5b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-2", + "id": "csit302-u2", "number": 2, "title": "Algebraic Structures", "hours": 8, "topics": [ - "Algebraic Structures: Definition, Properties", - "Types: Semi Groups, Monoid, Groups, Abelian group", - "Properties of groups", - "Subgroup", - "Cyclic groups", - "Cosets", - "Factor group", - "Permutation groups", - "Normal subgroup", - "Homomorphism and Isomorphism: Homomorphism and isomorphism of Groups, example and standard results", - "Rings and Fields: Definition and standard results" - ] + { + "id": "csit302-u2-algebraic-structures-definition", + "slug": "algebraic-structures-definition", + "title": "Algebraic Structures: Definition", + "displayOrder": 1 + }, + { + "id": "csit302-u2-properties", + "slug": "algebraic-structures-properties", + "title": "Properties of Algebraic Structures", + "displayOrder": 2 + }, + { + "id": "csit302-u2-semi-groups-monoid", + "slug": "semi-groups-monoid", + "title": "Types: Semi Groups, Monoid", + "displayOrder": 3 + }, + { + "id": "csit302-u2-groups-abelian-group", + "slug": "groups-abelian-group", + "title": "Groups, Abelian group", + "displayOrder": 4 + }, + { + "id": "csit302-u2-properties-of-groups", + "slug": "properties-of-groups", + "title": "Properties of groups", + "displayOrder": 5 + }, + { + "id": "csit302-u2-subgroup", + "slug": "subgroup", + "title": "Subgroup", + "displayOrder": 6 + }, + { + "id": "csit302-u2-cyclic-groups", + "slug": "cyclic-groups", + "title": "Cyclic groups", + "displayOrder": 7 + }, + { + "id": "csit302-u2-cosets", + "slug": "cosets", + "title": "Cosets", + "displayOrder": 8 + }, + { + "id": "csit302-u2-factor-group", + "slug": "factor-group", + "title": "Factor group", + "displayOrder": 9 + }, + { + "id": "csit302-u2-permutation-groups", + "slug": "permutation-groups", + "title": "Permutation groups", + "displayOrder": 10 + }, + { + "id": "csit302-u2-normal-subgroup", + "slug": "normal-subgroup", + "title": "Normal subgroup", + "displayOrder": 11 + }, + { + "id": "csit302-u2-homomorphism-isomorphism", + "slug": "homomorphism-isomorphism", + "title": "Homomorphism and Isomorphism of Groups", + "displayOrder": 12 + }, + { + "id": "csit302-u2-homomorphism-examples", + "slug": "homomorphism-examples", + "title": "Homomorphism and Isomorphism: example and standard results", + "displayOrder": 13 + }, + { + "id": "csit302-u2-rings-definition", + "slug": "rings-definition", + "title": "Rings: Definition", + "displayOrder": 14 + }, + { + "id": "csit302-u2-rings-standard-results", + "slug": "rings-standard-results", + "title": "Rings: standard results", + "displayOrder": 15 + }, + { + "id": "csit302-u2-fields-definition", + "slug": "fields-definition", + "title": "Fields: Definition", + "displayOrder": 16 + }, + { + "id": "csit302-u2-fields-standard-results", + "slug": "fields-standard-results", + "title": "Fields: standard results", + "displayOrder": 17 + } + ], + "questionIds": [ + "q4a_nov2022", + "q4b_nov2022", + "q2b_june2023", + "q3a_june2023", + "q8a_june2023_p2", + "q3a_dec2023", + "q3b_dec2023", + "q1b_june2024", + "q7a_june2024", + "q8a_june2024", + "q8b_june2024", + "q1b_dec2024", + "q2a_dec2024", + "q8a_dec2024", + "q8b_dec2024", + "q3a_june2025", + "q3b_june2025", + "q8a_june2025_p3", + "q6a_dec2025", + "q6b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-3", + "id": "csit302-u3", "number": 3, "title": "Propositional Logic", "hours": 8, "topics": [ - "Propositional Logic: Proposition", - "First order logic", - "Basic logical operation", - "Truth tables", - "Tautologies", - "Contradictions", - "Algebra of Proposition", - "Logical implications", - "Logical equivalence", - "Predicates", - "Normal Forms", - "Universal and existential quantifiers", - "Finite State Machine: Introduction to finite state machine", - "Finite state machines as models of physical system equivalence machines", - "Finite state machines as language recognizers" - ] + { + "id": "csit302-u3-proposition", + "slug": "proposition", + "title": "Propositional Logic: Proposition", + "displayOrder": 1 + }, + { + "id": "csit302-u3-first-order-logic", + "slug": "first-order-logic", + "title": "First order logic", + "displayOrder": 2 + }, + { + "id": "csit302-u3-basic-logical-operation", + "slug": "basic-logical-operation", + "title": "Basic logical operation", + "displayOrder": 3 + }, + { + "id": "csit302-u3-truth-tables", + "slug": "truth-tables", + "title": "Truth tables", + "displayOrder": 4 + }, + { + "id": "csit302-u3-tautologies", + "slug": "tautologies", + "title": "Tautologies", + "displayOrder": 5 + }, + { + "id": "csit302-u3-contradictions", + "slug": "contradictions", + "title": "Contradictions", + "displayOrder": 6 + }, + { + "id": "csit302-u3-algebra-of-proposition", + "slug": "algebra-of-proposition", + "title": "Algebra of Proposition", + "displayOrder": 7 + }, + { + "id": "csit302-u3-logical-implications", + "slug": "logical-implications", + "title": "Logical implications", + "displayOrder": 8 + }, + { + "id": "csit302-u3-logical-equivalence", + "slug": "logical-equivalence", + "title": "Logical equivalence", + "displayOrder": 9 + }, + { + "id": "csit302-u3-predicates", + "slug": "predicates", + "title": "Predicates", + "displayOrder": 10 + }, + { + "id": "csit302-u3-normal-forms", + "slug": "normal-forms", + "title": "Normal Forms", + "displayOrder": 11 + }, + { + "id": "csit302-u3-universal-existential-quantifiers", + "slug": "universal-existential-quantifiers", + "title": "Universal and existential quantifiers", + "displayOrder": 12 + }, + { + "id": "csit302-u3-fsm-introduction", + "slug": "fsm-introduction", + "title": "Finite State Machine: Introduction", + "displayOrder": 13 + }, + { + "id": "csit302-u3-fsm-models", + "slug": "fsm-models", + "title": "Finite state machines as models of physical system equivalence machines", + "displayOrder": 14 + }, + { + "id": "csit302-u3-fsm-language-recognizers", + "slug": "fsm-language-recognizers", + "title": "Finite state machines as language recognizers", + "displayOrder": 15 + } + ], + "questionIds": [ + "q5a_nov2022", + "q5b_nov2022", + "q6a_nov2022", + "q4a_june2023", + "q4b_june2023", + "q5a_june2023", + "q8a_june2023_p3", + "q4a_dec2023", + "q4b_dec2023", + "q5a_dec2023", + "q5b_dec2023", + "q3a_june2024", + "q6b_june2024", + "q7b_june2024", + "q2b_dec2024", + "q6b_dec2024", + "q7b_dec2024", + "q4a_june2025", + "q4b_june2025", + "q8a_june2025_p1", + "q4a_dec2025", + "q4b_dec2025", + "q7a_dec2025", + "q7b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-4", + "id": "csit302-u4", "number": 4, "title": "Graph Theory", "hours": 8, "topics": [ - "Introduction: Basic terminology of graphs", - "Planar graphs", - "Multigraphs and weighted graphs", - "Connectivity & Paths: Isomorphic graphs, Paths, Cycles and connectivity", - "Shortest path in weighted graph", - "Advanced Paths: Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits", - "Coloring & Isomorphism: Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs" - ] + { + "id": "csit302-u4-basic-terminology", + "slug": "basic-terminology", + "title": "Basic terminology of graphs", + "displayOrder": 1 + }, + { + "id": "csit302-u4-planar-graphs", + "slug": "planar-graphs", + "title": "Planar graphs", + "displayOrder": 2 + }, + { + "id": "csit302-u4-multigraphs", + "slug": "multigraphs", + "title": "Multigraphs", + "displayOrder": 3 + }, + { + "id": "csit302-u4-weighted-graphs", + "slug": "weighted-graphs", + "title": "Weighted graphs", + "displayOrder": 4 + }, + { + "id": "csit302-u4-isomorphic-graphs", + "slug": "isomorphic-graphs", + "title": "Isomorphic graphs", + "displayOrder": 5 + }, + { + "id": "csit302-u4-paths-cycles-connectivity", + "slug": "paths-cycles-connectivity", + "title": "Paths, Cycles and connectivity", + "displayOrder": 6 + }, + { + "id": "csit302-u4-shortest-path", + "slug": "shortest-path", + "title": "Shortest path in weighted graph", + "displayOrder": 7 + }, + { + "id": "csit302-u4-eulerian-paths-circuits", + "slug": "eulerian-paths-circuits", + "title": "Introduction to Eulerian paths and circuits", + "displayOrder": 8 + }, + { + "id": "csit302-u4-hamiltonian-paths-circuits", + "slug": "hamiltonian-paths-circuits", + "title": "Hamiltonian paths and circuits", + "displayOrder": 9 + }, + { + "id": "csit302-u4-graph-coloring", + "slug": "graph-coloring", + "title": "Graph coloring", + "displayOrder": 10 + }, + { + "id": "csit302-u4-chromatic-number", + "slug": "chromatic-number", + "title": "Chromatic number", + "displayOrder": 11 + }, + { + "id": "csit302-u4-isomorphism-homomorphism-graphs", + "slug": "isomorphism-homomorphism-graphs", + "title": "Isomorphism and Homomorphism of graphs", + "displayOrder": 12 + } + ], + "questionIds": [ + "q7a_nov2022", + "q7b_nov2022", + "q8a_nov2022", + "q8b_nov2022", + "q5b_june2023", + "q6a_june2023", + "q6b_june2023", + "q6a_dec2023", + "q6b_dec2023", + "q1a_june2024", + "q3b_june2024", + "q4a_june2024", + "q3a_dec2024", + "q3b_dec2024", + "q4a_dec2024", + "q5b_dec2024", + "q5a_june2025", + "q5b_june2025", + "q6a_june2025", + "q8a_dec2025", + "q8b_dec2025" + ], + "predictedQuestionIds": [] }, { - "id": "module-5", + "id": "csit302-u5", "number": 5, "title": "Posets, Lattices, Combinatorics, Recurrence Relations", "hours": 8, "topics": [ - "Posets, Hasse Diagram and Lattices: Introduction, ordered set", - "Hasse diagram of partially ordered set", - "Isomorphic ordered set, well ordered set", - "Properties of Lattices, bounded and complemented lattices", - "Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multinomial Coefficients", - "Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms", - "Linear recurrence relations with constant coefficients", - "Homogeneous solutions, Particular solutions, Total solutions", - "Generating functions, Solution by method of generating functions" - ] + { + "id": "csit302-u5-posets-introduction", + "slug": "posets-introduction", + "title": "Posets: Introduction", + "displayOrder": 1 + }, + { + "id": "csit302-u5-ordered-set", + "slug": "ordered-set", + "title": "Ordered set", + "displayOrder": 2 + }, + { + "id": "csit302-u5-hasse-diagram", + "slug": "hasse-diagram", + "title": "Hasse diagram of partially ordered set", + "displayOrder": 3 + }, + { + "id": "csit302-u5-isomorphic-ordered-set", + "slug": "isomorphic-ordered-set", + "title": "Isomorphic ordered set", + "displayOrder": 4 + }, + { + "id": "csit302-u5-well-ordered-set", + "slug": "well-ordered-set", + "title": "Well ordered set", + "displayOrder": 5 + }, + { + "id": "csit302-u5-properties-of-lattices", + "slug": "properties-of-lattices", + "title": "Properties of Lattices", + "displayOrder": 6 + }, + { + "id": "csit302-u5-bounded-complemented-lattices", + "slug": "bounded-complemented-lattices", + "title": "Bounded and complemented lattices", + "displayOrder": 7 + }, + { + "id": "csit302-u5-combinatorics-introduction", + "slug": "combinatorics-introduction", + "title": "Combinatorics: Introduction", + "displayOrder": 8 + }, + { + "id": "csit302-u5-permutation-combination", + "slug": "permutation-combination", + "title": "Permutation and combination", + "displayOrder": 9 + }, + { + "id": "csit302-u5-binomial-theorem", + "slug": "binomial-theorem", + "title": "Binomial Theorem", + "displayOrder": 10 + }, + { + "id": "csit302-u5-multinomial-coefficients", + "slug": "multinomial-coefficients", + "title": "Multinomial Coefficients", + "displayOrder": 11 + }, + { + "id": "csit302-u5-recurrence-relation-introduction", + "slug": "recurrence-relation-introduction", + "title": "Introduction to Recurrence Relation", + "displayOrder": 12 + }, + { + "id": "csit302-u5-recursive-algorithms", + "slug": "recursive-algorithms", + "title": "Recursive algorithms", + "displayOrder": 13 + }, + { + "id": "csit302-u5-linear-recurrence-relations", + "slug": "linear-recurrence-relations", + "title": "Linear recurrence relations with constant coefficients", + "displayOrder": 14 + }, + { + "id": "csit302-u5-homogeneous-solutions", + "slug": "homogeneous-solutions", + "title": "Homogeneous solutions", + "displayOrder": 15 + }, + { + "id": "csit302-u5-particular-solutions", + "slug": "particular-solutions", + "title": "Particular solutions", + "displayOrder": 16 + }, + { + "id": "csit302-u5-total-solutions", + "slug": "total-solutions", + "title": "Total solutions", + "displayOrder": 17 + }, + { + "id": "csit302-u5-generating-functions", + "slug": "generating-functions", + "title": "Generating functions", + "displayOrder": 18 + }, + { + "id": "csit302-u5-solution-by-generating-functions", + "slug": "solution-by-generating-functions", + "title": "Solution by method of generating functions", + "displayOrder": 19 + } + ], + "questionIds": [ + "q3a_nov2022", + "q3b_nov2022", + "q7a_june2023", + "q7b_june2023", + "q7a_dec2023", + "q7b_dec2023", + "q8a_dec2023", + "q8b_dec2023", + "q2a_june2024", + "q2b_june2024", + "q5b_june2024", + "q7a_june2024", + "q2a_dec2024", + "q3b_dec2024", + "q4b_dec2024", + "q5a_dec2024", + "q6a_dec2024", + "q7a_dec2024", + "q2b_june2025", + "q6b_june2025", + "q7a_june2025", + "q7b_june2025", + "q8a_june2025_p2" + ], + "predictedQuestionIds": [] } ] } diff --git a/features/landing/ai-demo.tsx b/features/landing/ai-demo.tsx index 71c46dc..8188c66 100644 --- a/features/landing/ai-demo.tsx +++ b/features/landing/ai-demo.tsx @@ -172,7 +172,7 @@ export default function AIDemo() { {/* Left Side (Features) */} {aiFeatures.map((feature, idx) => { const isActive = activeIndex === idx; @@ -183,10 +183,10 @@ export default function AIDemo() { key={idx} onClick={() => setActiveIndex(idx)} variants={itemVariants} - className={`group relative text-left overflow-hidden rounded-[16px] sm:rounded-[20px] p-4 sm:p-5 transition-all duration-500 ease-[cubic-bezier(0.2,0.8,0.2,1)] min-w-[280px] w-[85vw] sm:w-auto lg:w-full snap-center flex-shrink-0 lg:flex-shrink ${ + className={`group relative text-left overflow-hidden rounded-[16px] sm:rounded-[20px] p-4 sm:p-5 transition-all duration-300 ease-[cubic-bezier(0.2,0.8,0.2,1)] min-w-[280px] w-[85vw] sm:w-auto lg:w-full snap-center flex-shrink-0 lg:flex-shrink active:scale-[0.98] ${ isActive - ? "border border-indigo-400/50 bg-white shadow-[0_20px_40px_-12px_rgba(99,102,241,0.2)] lg:scale-[1.02] lg:-translate-y-2 dark:border-indigo-500/[0.4] dark:bg-[#1e293b]/90 dark:shadow-[0_15px_30px_-10px_rgba(99,102,241,0.2)]" - : "border border-slate-100 sm:border-transparent bg-white shadow-[0_4px_20px_rgb(0,0,0,0.06)] hover:scale-[1.01] sm:hover:scale-[1.02] hover:-translate-y-1 sm:hover:-translate-y-2 hover:border-indigo-400/50 hover:bg-white hover:shadow-[0_30px_60px_-12px_rgba(99,102,241,0.25)] dark:border-white/[0.08] dark:bg-[#0f172a]/60 dark:shadow-[inset_0_1px_1px_rgba(255,255,255,0.05)] dark:hover:border-indigo-500/[0.2] dark:hover:bg-[#1e293b]/80" + ? "border border-indigo-500/50 bg-indigo-50/60 shadow-sm ring-1 ring-indigo-500/20 dark:border-indigo-400/40 dark:bg-indigo-500/[0.08] dark:ring-indigo-400/20" + : "border border-slate-200/70 bg-white/90 shadow-sm hover:bg-white hover:border-slate-300 dark:border-white/[0.06] dark:bg-[#0f172a]/40 dark:hover:bg-[#1e293b]/60 dark:hover:border-white/[0.1]" }`} >
-
- -
-

- Still have questions? -

-

- Can't find the answer you're looking for? Please chat to - our friendly team. -

-
- - - - - - + {/* Premium Texture & Glow */} +
+
+ +
+ {/* Dynamic Status Badge */} +
+ + + + + Support team is online +
+ +
+ +
+ +

+ Still have questions? +

+ +

+ Can't find the answer you're looking for? Please chat + to our friendly team. +

+ +
+ + + + + + +
From 19b727cbf737169c8c419d2c57031b26276b9ddc Mon Sep 17 00:00:00 2001 From: Ramoo Kachhee Date: Tue, 14 Jul 2026 22:48:08 +0530 Subject: [PATCH 3/3] fixed format --- content/rgpv/aiml/semester-3/al-302/pyqs.json | 2 +- content/rgpv/aiml/semester-4/al-401/pyqs.json | 2 +- content/rgpv/cse/semester-4/cs-403/pyqs.json | 2 +- content/rgpv/cse/semester-4/cs-403/syllabus.json | 2 +- content/rgpv/cse/semester-4/cs-404/pyqs.json | 2 +- content/rgpv/cse/semester-4/cs-404/syllabus.json | 2 +- content/rgpv/cse/semester-4/cs-405/pyqs.json | 2 +- content/rgpv/cse/semester-4/cs-405/syllabus.json | 2 +- 8 files changed, 8 insertions(+), 8 deletions(-) diff --git a/content/rgpv/aiml/semester-3/al-302/pyqs.json b/content/rgpv/aiml/semester-3/al-302/pyqs.json index f580cbe..f2df74e 100644 --- a/content/rgpv/aiml/semester-3/al-302/pyqs.json +++ b/content/rgpv/aiml/semester-3/al-302/pyqs.json @@ -1158,4 +1158,4 @@ ] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/aiml/semester-4/al-401/pyqs.json b/content/rgpv/aiml/semester-4/al-401/pyqs.json index 03a8a7f..51ee5c5 100644 --- a/content/rgpv/aiml/semester-4/al-401/pyqs.json +++ b/content/rgpv/aiml/semester-4/al-401/pyqs.json @@ -926,4 +926,4 @@ ] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/cse/semester-4/cs-403/pyqs.json b/content/rgpv/cse/semester-4/cs-403/pyqs.json index 1cb83bc..4624c3b 100644 --- a/content/rgpv/cse/semester-4/cs-403/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-403/pyqs.json @@ -982,4 +982,4 @@ ] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/cse/semester-4/cs-403/syllabus.json b/content/rgpv/cse/semester-4/cs-403/syllabus.json index efccd24..1284637 100644 --- a/content/rgpv/cse/semester-4/cs-403/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-403/syllabus.json @@ -424,4 +424,4 @@ "predictedQuestionIds": [] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/cse/semester-4/cs-404/pyqs.json b/content/rgpv/cse/semester-4/cs-404/pyqs.json index 1161985..691438f 100644 --- a/content/rgpv/cse/semester-4/cs-404/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-404/pyqs.json @@ -968,4 +968,4 @@ ] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/cse/semester-4/cs-404/syllabus.json b/content/rgpv/cse/semester-4/cs-404/syllabus.json index 2794bf2..3d6c5e7 100644 --- a/content/rgpv/cse/semester-4/cs-404/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-404/syllabus.json @@ -402,4 +402,4 @@ "predictedQuestionIds": [] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/cse/semester-4/cs-405/pyqs.json b/content/rgpv/cse/semester-4/cs-405/pyqs.json index 187c824..19a2086 100644 --- a/content/rgpv/cse/semester-4/cs-405/pyqs.json +++ b/content/rgpv/cse/semester-4/cs-405/pyqs.json @@ -926,4 +926,4 @@ ] } ] -} \ No newline at end of file +} diff --git a/content/rgpv/cse/semester-4/cs-405/syllabus.json b/content/rgpv/cse/semester-4/cs-405/syllabus.json index 6b7a17c..6aacfe0 100644 --- a/content/rgpv/cse/semester-4/cs-405/syllabus.json +++ b/content/rgpv/cse/semester-4/cs-405/syllabus.json @@ -250,4 +250,4 @@ "predictedQuestionIds": [] } ] -} \ No newline at end of file +}