This document provides information about the CSD 363 Social and Information Networks course, including the instructor, topics, labs, assessments, policies, and references. Over the semester, students will learn about network basics, structures, relations, communities, and applications through lectures, labs, quizzes, assignments, and exams. Labs involve hands-on modeling and analysis. Assessment includes a midterm, lab assignments, quizzes, and a final exam evaluating learning outcomes around key concepts and applications. Grading is relative and passing requires a minimum 30% score. The course has attendance and academic integrity policies.
This document provides information about the CSD 363 Social and Information Networks course, including the instructor, topics, labs, assessments, policies, and references. Over the semester, students will learn about network basics, structures, relations, communities, and applications through lectures, labs, quizzes, assignments, and exams. Labs involve hands-on modeling and analysis. Assessment includes a midterm, lab assignments, quizzes, and a final exam evaluating learning outcomes around key concepts and applications. Grading is relative and passing requires a minimum 30% score. The course has attendance and academic integrity policies.
This document provides information about the CSD 363 Social and Information Networks course, including the instructor, topics, labs, assessments, policies, and references. Over the semester, students will learn about network basics, structures, relations, communities, and applications through lectures, labs, quizzes, assignments, and exams. Labs involve hands-on modeling and analysis. Assessment includes a midterm, lab assignments, quizzes, and a final exam evaluating learning outcomes around key concepts and applications. Grading is relative and passing requires a minimum 30% score. The course has attendance and academic integrity policies.
NETWORKS Course Instructor - Dolly Sharma Date Topic Lab 8-Jan Introduction 10-Jan Applications 15-Jan Network basics Lab 1: Random Graph model and properties 17-Jan Tie strength Quiz 1 22-Jan Network structure Lab 2: Tie strength 24-Jan Homophily 29-Jan Affiliation Lab 3 31-Jan Spatial model of segregation 5 Feb Positive and negative relations Lab 4 7 Feb negative relations 12 Feb power laws, pref. att. 14 Feb structure of web Lab 5 19 Feb Link analysis Quiz 2 21 Feb Web search Date Topic Lab 4-Mar Information cascades 6 Mar Epidemics Lab 6 11 Mar Communities 13 Mar Communities 18 Mar Modularity Quiz 3 20 Mar Biological networks Assignment: Presentation 27 Mar Biological networks topic 31-Jan Biological networks 1 Apr Congestion networks Quiz 4 3 Apr Congestion networks 8 Apr Applications 10 Apr Applications 15 Apr Applications Presentations 17 Apr Applications 22 Apr Applications 24 Apr Applications Learning Evaluation Instrument Weightage Duration Outcomes
Mid Term Test 20% 1-2 hours LO1
Lab Assignments/ To be submitted by due
30% LO3 Project/ Presentation date
Quiz 20% In-class (Surprize) LO1 and LO2
End Term Exam 30% 2-3 hours LO1 and LO2
ASSESSMENT STRATEGY GRADING POLICY
Estimated minimum for
getting an A grade will be 80%. Grading will be relative in Minimum passing marks will this course. be 30%. The actual cutoff of A grade may be higher depending on the relative performance of the class. COURSE POLICY ▪ Attendance policy: Attendance must be maintained as per university policy where non- compliance would lead to an F∗ grade. ▪ Academic malpractice policy: There is zero-tolerance policy on cheating and malpractices during the exams and assignments. Use of mobile phones and other electronic devices is not allowed during the lectures and problem sessions. ▪ Policy on make-up exams: A make-up for any missed graded component will only be conducted based on genuine medical ground or other unavoidable circumstances, where condonement is approved by the Dean’s office. TEXT AND REFERENCES ▪ ‘Networks, Crowds, and Markets: Reasoning about a Highly Connected World’, Easley and Klienberg